./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1052c_true-unreach-call.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_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1052c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69b156b7cb8e47e9e9902f33725c5b7467b2d17a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1052c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69b156b7cb8e47e9e9902f33725c5b7467b2d17a ....................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_9)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:09:23,534 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:09:23,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:09:23,543 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:09:23,543 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:09:23,544 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:09:23,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:09:23,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:09:23,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:09:23,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:09:23,548 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:09:23,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:09:23,549 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:09:23,550 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:09:23,551 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:09:23,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:09:23,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:09:23,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:09:23,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:09:23,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:09:23,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:09:23,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:09:23,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:09:23,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:09:23,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:09:23,559 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:09:23,559 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:09:23,560 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:09:23,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:09:23,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:09:23,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:09:23,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:09:23,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:09:23,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:09:23,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:09:23,565 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:09:23,565 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 13:09:23,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:09:23,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:09:23,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:09:23,576 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:09:23,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:09:23,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:09:23,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:09:23,577 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:09:23,577 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:09:23,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:09:23,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:09:23,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:09:23,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:09:23,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:09:23,578 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:09:23,578 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:09:23,578 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:09:23,578 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:09:23,578 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:09:23,578 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:09:23,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:09:23,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:09:23,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:09:23,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:09:23,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:09:23,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:09:23,579 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 13:09:23,579 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:09:23,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:09:23,579 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_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak 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 -> Kojak 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 -> 69b156b7cb8e47e9e9902f33725c5b7467b2d17a [2018-11-23 13:09:23,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:09:23,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:09:23,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:09:23,611 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:09:23,612 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:09:23,612 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-11-23 13:09:23,647 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/39ba7cb2e/b1ba0ad74cf54e85b33673082c1d75cd/FLAG9f0e300ec [2018-11-23 13:09:23,967 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:09:23,968 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/sv-benchmarks/c/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-11-23 13:09:23,972 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/39ba7cb2e/b1ba0ad74cf54e85b33673082c1d75cd/FLAG9f0e300ec [2018-11-23 13:09:23,981 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/39ba7cb2e/b1ba0ad74cf54e85b33673082c1d75cd [2018-11-23 13:09:23,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:09:23,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:09:23,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:23,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:09:23,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:09:23,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:23" (1/1) ... [2018-11-23 13:09:23,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b26934e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:23, skipping insertion in model container [2018-11-23 13:09:23,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:23" (1/1) ... [2018-11-23 13:09:23,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:09:24,018 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:09:24,140 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:24,142 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:09:24,164 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:24,178 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:09:24,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24 WrapperNode [2018-11-23 13:09:24,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:24,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:24,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:09:24,179 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:09:24,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:24,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:09:24,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:09:24,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:09:24,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:09:24,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:09:24,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:09:24,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:09:24,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 13:09:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 13:09:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:09:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:09:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:09:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:09:24,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:09:24,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:09:24,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:09:24,687 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:09:24,687 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 13:09:24,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:24 BoogieIcfgContainer [2018-11-23 13:09:24,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:09:24,688 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:09:24,688 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:09:24,695 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:09:24,695 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:24" (1/1) ... [2018-11-23 13:09:24,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-23 13:09:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-23 13:09:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:09:24,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2018-11-23 13:09:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-11-23 13:09:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:09:24,801 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:09:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:09:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:09:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:09:24,901 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_floor~0 := 1.0E300;havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~someUnaryDOUBLEoperation(0.0);floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; VAL [ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8);call floor_double_#t~mem0 := read~int(floor_double_~#ew_u~0.base, 4 + floor_double_~#ew_u~0.offset, 4);floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~int(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4);floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(floor_double_~j0~0 < 20); VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume floor_double_~j0~0 > 51;BeginParallelComposition{ParallelCodeBlock0: assume 1024 == floor_double_~j0~0;floor_double_#res := ~someBinaryArithmeticDOUBLEoperation(floor_double_~x, floor_double_~x);ParallelCodeBlock1: assume !(1024 == floor_double_~j0~0);floor_double_#res := floor_double_~x;}EndParallelComposition VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, |ULTIMATE.start_floor_double_#res|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, |ULTIMATE.start_floor_double_#res|=0.0, |ULTIMATE.start_main_#t~short10|=false, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !main_#t~short10; VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, |ULTIMATE.start_floor_double_#res|=0.0, |ULTIMATE.start_main_#t~short10|=false, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !main_#t~short10;havoc main_#t~short10;havoc main_#t~ret9; VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, |ULTIMATE.start_floor_double_#res|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [ULTIMATE.start_floor_double_~i0~0=5904, ULTIMATE.start_floor_double_~i1~0=8456, ULTIMATE.start_floor_double_~j0~0=52, ULTIMATE.start_floor_double_~x=0.0, ULTIMATE.start_main_~res~0=0.0, ULTIMATE.start_main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_floor_double_#in~x|=0.0, |ULTIMATE.start_floor_double_#res|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L98] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L99] floor_double_#in~x := main_~x~0; [L99] havoc floor_double_#res; [L99] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L20] call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] call floor_double_#t~mem0 := read~int(floor_double_~#ew_u~0.base, 4 + floor_double_~#ew_u~0.offset, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] call floor_double_#t~mem2 := read~int(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset); [L20] havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L26-L69] assume !(floor_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L47-L69] assume floor_double_~j0~0 > 51; [L48-L51] assume !(1024 == floor_double_~j0~0); [L51] floor_double_#res := floor_double_~x; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L99] main_#t~ret8 := floor_double_#res; [L99] main_~res~0 := main_#t~ret8; [L99] havoc main_#t~ret8; [L102] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102] assume !main_#t~short10; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102-L105] assume !main_#t~short10; [L102] havoc main_#t~short10; [L102] havoc main_#t~ret9; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L103] assert false; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L98] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L99] floor_double_#in~x := main_~x~0; [L99] havoc floor_double_#res; [L99] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L20] call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] call floor_double_#t~mem0 := read~int(floor_double_~#ew_u~0.base, 4 + floor_double_~#ew_u~0.offset, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] call floor_double_#t~mem2 := read~int(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset); [L20] havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L26-L69] assume !(floor_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L47-L69] assume floor_double_~j0~0 > 51; [L48-L51] assume !(1024 == floor_double_~j0~0); [L51] floor_double_#res := floor_double_~x; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L99] main_#t~ret8 := floor_double_#res; [L99] main_~res~0 := main_#t~ret8; [L99] havoc main_#t~ret8; [L102] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102] assume !main_#t~short10; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102-L105] assume !main_#t~short10; [L102] havoc main_#t~short10; [L102] havoc main_#t~ret9; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L103] assert false; VAL [#NULL.base=0, #NULL.offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L98] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L99] floor_double_#in~x := main_~x~0; [L99] havoc floor_double_#res; [L99] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0, floor_double_#t~mem4, floor_double_#t~union5, floor_double_~#iw_u~0, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L20] FCALL call floor_double_~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(floor_double_~x, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] FCALL call floor_double_#t~mem0 := read~int({ base: floor_double_~#ew_u~0!base, offset: 4 + floor_double_~#ew_u~0!offset }, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(floor_double_#t~union1, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] FCALL call floor_double_#t~mem2 := read~int({ base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(floor_double_#t~union3, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] FCALL call ULTIMATE.dealloc(floor_double_~#ew_u~0); [L20] havoc floor_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(floor_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L47] COND TRUE floor_double_~j0~0 > 51 [L48] COND FALSE !(1024 == floor_double_~j0~0) [L51] floor_double_#res := floor_double_~x; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L99] main_#t~ret8 := floor_double_#res; [L99] main_~res~0 := main_#t~ret8; [L99] havoc main_#t~ret8; [L102] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102] COND FALSE !(main_#t~short10) VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102] COND TRUE !main_#t~short10 [L102] havoc main_#t~short10; [L102] havoc main_#t~ret9; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0; [L98] main_~x~0 := ~someUnaryDOUBLEoperation(0.0); [L99] floor_double_#in~x := main_~x~0; [L99] havoc floor_double_#res; [L99] havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0, floor_double_#t~mem4, floor_double_#t~union5, floor_double_~#iw_u~0, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0; [L16-L77] floor_double_~x := floor_double_#in~x; [L17] havoc floor_double_~i0~0; [L17] havoc floor_double_~i1~0; [L17] havoc floor_double_~j0~0; [L18] havoc floor_double_~i~0; [L18] havoc floor_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L20] FCALL call floor_double_~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(floor_double_~x, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] FCALL call floor_double_#t~mem0 := read~int({ base: floor_double_~#ew_u~0!base, offset: 4 + floor_double_~#ew_u~0!offset }, 4); [L22] floor_double_~i0~0 := (if floor_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem0 % 4294967296 % 4294967296 else floor_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(floor_double_#t~union1, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L22] havoc floor_double_#t~union1; [L22] havoc floor_double_#t~mem0; [L23] FCALL call floor_double_#t~mem2 := read~int({ base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 4); [L23] floor_double_~i1~0 := (if floor_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then floor_double_#t~mem2 % 4294967296 % 4294967296 else floor_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(floor_double_#t~union3, { base: floor_double_~#ew_u~0!base, offset: floor_double_~#ew_u~0!offset }, 8); [L23] havoc floor_double_#t~union3; [L23] havoc floor_double_#t~mem2; [L20] FCALL call ULTIMATE.dealloc(floor_double_~#ew_u~0); [L20] havoc floor_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L25] floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(floor_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L47] COND TRUE floor_double_~j0~0 > 51 [L48] COND FALSE !(1024 == floor_double_~j0~0) [L51] floor_double_#res := floor_double_~x; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L99] main_#t~ret8 := floor_double_#res; [L99] main_~res~0 := main_#t~ret8; [L99] havoc main_#t~ret8; [L102] main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102] COND FALSE !(main_#t~short10) VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_#t~short10=false, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L102] COND TRUE !main_#t~short10 [L102] havoc main_#t~short10; [L102] havoc main_#t~ret9; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, floor_double_#in~x=0.0, floor_double_#res=0.0, floor_double_~i0~0=5904, floor_double_~i1~0=8456, floor_double_~j0~0=52, floor_double_~x=0.0, main_~res~0=0.0, main_~x~0=0.0, ~huge_floor~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [L98] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L47] COND TRUE ~j0~0 > 51 [L48] COND FALSE !(1024 == ~j0~0) [L51] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] COND TRUE !#t~short10 [L102] havoc #t~short10; [L102] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; [L98] ~x~0 := ~someUnaryDOUBLEoperation(0.0); [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L26] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L47] COND TRUE ~j0~0 > 51 [L48] COND FALSE !(1024 == ~j0~0) [L51] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L102] COND TRUE !#t~short10 [L102] havoc #t~short10; [L102] havoc #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L14] static const double huge_floor = 1.0e300; [L98] double x = -0.0; [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] COND FALSE !(j0 < 20) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L47] COND TRUE j0 > 51 [L48] COND FALSE !(j0 == 0x400) [L51] return x; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L99] double res = floor_double(x); [L102] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L102] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L103] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- [2018-11-23 13:09:24,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:09:24 ImpRootNode [2018-11-23 13:09:24,934 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:09:24,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:09:24,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:09:24,934 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:09:24,935 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:24" (3/4) ... [2018-11-23 13:09:24,937 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:09:24,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:09:24,937 INFO L168 Benchmark]: Toolchain (without parser) took 953.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:24,939 INFO L168 Benchmark]: CDTParser took 0.11 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 13:09:24,939 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.29 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:24,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:24,940 INFO L168 Benchmark]: Boogie Preprocessor took 21.76 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:24,941 INFO L168 Benchmark]: RCFGBuilder took 423.21 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:24,941 INFO L168 Benchmark]: CodeCheck took 246.32 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:24,941 INFO L168 Benchmark]: Witness Printer took 2.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:09:24,944 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 38 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 103]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 98, overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L14] static const double huge_floor = 1.0e300; [L98] double x = -0.0; [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] COND FALSE !(j0 < 20) VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L47] COND TRUE j0 > 51 [L48] COND FALSE !(j0 == 0x400) [L51] return x; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L99] double res = floor_double(x); [L102] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L102] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L103] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.29 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.76 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.21 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * CodeCheck took 246.32 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: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.92 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. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 13:09:26,356 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:09:26,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:09:26,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:09:26,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:09:26,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:09:26,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:09:26,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:09:26,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:09:26,368 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:09:26,369 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:09:26,369 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:09:26,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:09:26,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:09:26,371 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:09:26,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:09:26,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:09:26,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:09:26,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:09:26,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:09:26,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:09:26,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:09:26,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:09:26,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:09:26,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:09:26,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:09:26,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:09:26,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:09:26,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:09:26,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:09:26,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:09:26,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:09:26,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:09:26,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:09:26,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:09:26,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:09:26,387 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 13:09:26,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:09:26,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:09:26,398 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:09:26,398 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:09:26,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:09:26,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:09:26,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:09:26,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:09:26,399 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:09:26,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:09:26,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:09:26,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:09:26,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:09:26,400 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:09:26,400 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:09:26,400 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:09:26,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:09:26,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:09:26,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:09:26,401 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:09:26,401 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:09:26,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:09:26,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:09:26,402 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:09:26,403 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_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak 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 -> Kojak 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 -> 69b156b7cb8e47e9e9902f33725c5b7467b2d17a [2018-11-23 13:09:26,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:09:26,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:09:26,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:09:26,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:09:26,440 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:09:26,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-11-23 13:09:26,475 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/869987d5e/4b8b57bc4eba4a759327f51997573b43/FLAG2d1bda804 [2018-11-23 13:09:26,874 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:09:26,875 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/sv-benchmarks/c/float-newlib/double_req_bl_1052c_true-unreach-call.c [2018-11-23 13:09:26,878 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/869987d5e/4b8b57bc4eba4a759327f51997573b43/FLAG2d1bda804 [2018-11-23 13:09:26,887 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/data/869987d5e/4b8b57bc4eba4a759327f51997573b43 [2018-11-23 13:09:26,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:09:26,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:09:26,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:26,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:09:26,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:09:26,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:26" (1/1) ... [2018-11-23 13:09:26,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2a43b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:26, skipping insertion in model container [2018-11-23 13:09:26,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:26" (1/1) ... [2018-11-23 13:09:26,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:09:26,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:09:27,042 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:27,045 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:09:27,070 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:27,088 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:09:27,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27 WrapperNode [2018-11-23 13:09:27,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:27,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:27,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:09:27,090 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:09:27,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:27,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:09:27,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:09:27,121 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:09:27,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... [2018-11-23 13:09:27,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:09:27,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:09:27,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:09:27,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:09:27,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_efcfe2f8-b304-48e6-b262-a5992cc6f98b/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 13:09:27,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 13:09:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:09:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:09:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 13:09:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:09:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:09:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 13:09:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:09:27,360 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:09:28,104 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:09:31,079 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:09:31,079 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 13:09:31,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:31 BoogieIcfgContainer [2018-11-23 13:09:31,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:09:31,080 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:09:31,080 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:09:31,086 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:09:31,086 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:31" (1/1) ... [2018-11-23 13:09:31,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-23 13:09:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-23 13:09:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:09:31,117 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:31,151 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:09:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:31,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2018-11-23 13:09:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-11-23 13:09:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:09:31,184 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:31,185 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:09:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:31,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 20 states and 26 transitions. [2018-11-23 13:09:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-11-23 13:09:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:09:31,401 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:31,402 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:09:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:31,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 22 states and 29 transitions. [2018-11-23 13:09:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2018-11-23 13:09:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:09:32,074 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:32,074 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:09:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:32,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 22 states and 27 transitions. [2018-11-23 13:09:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-11-23 13:09:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:09:32,107 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:32,107 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:09:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:32,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:09:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 22 states and 25 transitions. [2018-11-23 13:09:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 13:09:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:09:32,124 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:09:32,125 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 13:09:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:32,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:32,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:09:32,186 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:09:32,187 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:09:32,193 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:09:32,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2018-11-23 13:09:32,201 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_9)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createTraceCheck(CodeCheckObserver.java:624) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:454) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:09:32,203 INFO L168 Benchmark]: Toolchain (without parser) took 5312.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 949.7 MB in the beginning and 988.3 MB in the end (delta: -38.5 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:32,204 INFO L168 Benchmark]: CDTParser took 0.13 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 13:09:32,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:32,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.04 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:09:32,205 INFO L168 Benchmark]: Boogie Preprocessor took 70.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:32,206 INFO L168 Benchmark]: RCFGBuilder took 3887.62 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:32,206 INFO L168 Benchmark]: CodeCheck took 1122.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:09:32,212 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_9)) de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv4 32) ((_ extract 63 32) v_prenex_9)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 198.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 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 31.04 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3887.62 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: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * CodeCheck took 1122.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...