./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_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_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/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 b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/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 b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:52:32,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:52:32,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:52:32,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:52:32,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:52:32,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:52:32,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:52:32,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:52:32,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:52:32,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:52:32,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:52:32,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:52:32,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:52:32,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:52:32,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:52:32,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:52:32,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:52:32,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:52:32,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:52:32,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:52:32,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:52:32,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:52:32,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:52:32,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:52:32,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:52:32,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:52:32,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:52:32,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:52:32,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:52:32,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:52:32,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:52:32,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:52:32,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:52:32,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:52:32,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:52:32,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:52:32,397 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 01:52:32,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:52:32,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:52:32,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:52:32,407 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 01:52:32,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:52:32,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:52:32,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:52:32,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:52:32,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:52:32,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:52:32,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:52:32,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:52:32,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:52:32,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:52:32,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:52:32,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:52:32,409 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:52:32,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:52:32,409 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:52:32,409 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:52:32,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:52:32,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:52:32,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:52:32,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:52:32,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:52:32,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:52:32,410 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 01:52:32,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:52:32,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:52:32,411 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_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/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 -> b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 [2018-11-23 01:52:32,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:52:32,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:52:32,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:52:32,448 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:52:32,448 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:52:32,449 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 01:52:32,493 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/5a0382dd1/29c2e4d80e1c41ec98f0b46f7671ae54/FLAGa5540ddb1 [2018-11-23 01:52:32,838 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:52:32,838 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 01:52:32,843 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/5a0382dd1/29c2e4d80e1c41ec98f0b46f7671ae54/FLAGa5540ddb1 [2018-11-23 01:52:32,854 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/5a0382dd1/29c2e4d80e1c41ec98f0b46f7671ae54 [2018-11-23 01:52:32,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:52:32,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:52:32,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:32,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:52:32,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:52:32,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:32" (1/1) ... [2018-11-23 01:52:32,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2a78e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:32, skipping insertion in model container [2018-11-23 01:52:32,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:32" (1/1) ... [2018-11-23 01:52:32,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:52:32,882 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:52:32,995 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:32,997 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:52:33,016 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:33,030 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:52:33,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33 WrapperNode [2018-11-23 01:52:33,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:33,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:33,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:52:33,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:52:33,036 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:52:33" (1/1) ... [2018-11-23 01:52:33,042 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:52:33" (1/1) ... [2018-11-23 01:52:33,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:33,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:52:33,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:52:33,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:52:33,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:52:33,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:52:33,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:52:33,121 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:52:33,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/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 01:52:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 01:52:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:52:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 01:52:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:52:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:52:33,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:52:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:52:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:52:33,380 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:52:33,380 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 01:52:33,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:33 BoogieIcfgContainer [2018-11-23 01:52:33,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:52:33,381 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:52:33,381 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:52:33,387 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:52:33,388 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:33" (1/1) ... [2018-11-23 01:52:33,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:52:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 14 states and 20 transitions. [2018-11-23 01:52:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2018-11-23 01:52:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 01:52:33,422 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:52:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:33,494 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 01:52:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:52:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 14 states and 13 transitions. [2018-11-23 01:52:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 01:52:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 01:52:33,500 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:52:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:52:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:52:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:52:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:52:33,709 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];havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0);fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem6, fabs_double_#t~union7, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem8, fabs_double_#t~union9.lsw, fabs_double_#t~union9.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; VAL [ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0] [?] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8);call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8);call fabs_double_#t~mem6 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4);fabs_double_~high~0 := fabs_double_#t~mem6;call write~real(fabs_double_#t~union7, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8);havoc fabs_double_#t~mem6;havoc fabs_double_#t~union7;call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset);havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0] [?] goto; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0] [?] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8);call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8);call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4);call fabs_double_#t~mem8 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8);fabs_double_~x := fabs_double_#t~mem8;call write~int(fabs_double_#t~union9.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4);call write~int(fabs_double_#t~union9.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4);havoc fabs_double_#t~mem8;havoc fabs_double_#t~union9.lsw, fabs_double_#t~union9.msw;call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset);havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0] [?] goto; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0] [?] fabs_double_#res := fabs_double_~x;main_#t~ret10 := fabs_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isinf_double_#in~x := main_~res~0;havoc isinf_double_#res;havoc isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_#t~mem4, isinf_double_#t~union5, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0, |ULTIMATE.start_fabs_double_#res|=6.0, |ULTIMATE.start_isinf_double_#in~x|=6.0] [?] call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);call isinf_double_#t~mem2 := read~int(isinf_double_~#ew_u~0.base, 4 + isinf_double_~#ew_u~0.offset, 4);isinf_double_~hx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);havoc isinf_double_#t~union3;havoc isinf_double_#t~mem2;call isinf_double_#t~mem4 := read~int(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4);isinf_double_~lx~0 := (if isinf_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem4 % 4294967296 % 4294967296 else isinf_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union5, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);havoc isinf_double_#t~mem4;havoc isinf_double_#t~union5;call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset);havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_isinf_double_~hx~0=2616, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0, |ULTIMATE.start_fabs_double_#res|=6.0, |ULTIMATE.start_isinf_double_#in~x|=6.0] [?] goto; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_isinf_double_~hx~0=2616, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0, |ULTIMATE.start_fabs_double_#res|=6.0, |ULTIMATE.start_isinf_double_#in~x|=6.0] [?] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647);isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0;isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296);main_#t~ret11 := isinf_double_#res;assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_isinf_double_~hx~0=2146434205, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0, |ULTIMATE.start_fabs_double_#res|=6.0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_isinf_double_#res|=0, |ULTIMATE.start_main_#t~ret11|=0] [?] assume 0 == main_#t~ret11;havoc main_#t~ret11; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_isinf_double_~hx~0=2146434205, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0, |ULTIMATE.start_fabs_double_#res|=6.0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_isinf_double_#res|=0] [?] assume !false; VAL [ULTIMATE.start_fabs_double_~high~0=30, ULTIMATE.start_fabs_double_~x=6.0, ULTIMATE.start_isinf_double_~hx~0=2146434205, ULTIMATE.start_isinf_double_~lx~0=3609, ULTIMATE.start_isinf_double_~x=6.0, ULTIMATE.start_main_~res~0=6.0, ULTIMATE.start_main_~x~0=6.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_fabs_double_#in~x|=6.0, |ULTIMATE.start_fabs_double_#res|=6.0, |ULTIMATE.start_isinf_double_#in~x|=6.0, |ULTIMATE.start_isinf_double_#res|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L69] fabs_double_#in~x := main_~x~0; [L69] havoc fabs_double_#res; [L69] havoc fabs_double_#t~mem6, fabs_double_#t~union7, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem8, fabs_double_#t~union9.lsw, fabs_double_#t~union9.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0; [L44-L58] fabs_double_~x := fabs_double_#in~x; [L45] havoc fabs_double_~high~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_~x=6.0, main_~x~0=6.0] [L47] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8); [L48] call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L49] call fabs_double_#t~mem6 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4); [L49] fabs_double_~high~0 := fabs_double_#t~mem6; [L49] call write~real(fabs_double_#t~union7, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L49] havoc fabs_double_#t~mem6; [L49] havoc fabs_double_#t~union7; [L47] call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset); [L47] havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L52] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8); [L53] call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L54] call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L55] call fabs_double_#t~mem8 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L55] fabs_double_~x := fabs_double_#t~mem8; [L55] call write~int(fabs_double_#t~union9.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4); [L55] call write~int(fabs_double_#t~union9.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L55] havoc fabs_double_#t~mem8; [L55] havoc fabs_double_#t~union9.lsw, fabs_double_#t~union9.msw; [L52] call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset); [L52] havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L57] fabs_double_#res := fabs_double_~x; [L69] main_#t~ret10 := fabs_double_#res; [L69] main_~res~0 := main_#t~ret10; [L69] havoc main_#t~ret10; [L72] isinf_double_#in~x := main_~res~0; [L72] havoc isinf_double_#res; [L72] havoc isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_#t~mem4, isinf_double_#t~union5, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L30-L42] isinf_double_~x := isinf_double_#in~x; [L31] havoc isinf_double_~hx~0; [L31] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L33] call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L35] call isinf_double_#t~mem2 := read~int(isinf_double_~#ew_u~0.base, 4 + isinf_double_~#ew_u~0.offset, 4); [L35] isinf_double_~hx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] call write~real(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L35] havoc isinf_double_#t~union3; [L35] havoc isinf_double_#t~mem2; [L36] call isinf_double_#t~mem4 := read~int(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4); [L36] isinf_double_~lx~0 := (if isinf_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem4 % 4294967296 % 4294967296 else isinf_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] call write~real(isinf_double_#t~union5, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L36] havoc isinf_double_#t~mem4; [L36] havoc isinf_double_#t~union5; [L33] call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset); [L33] havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~hx~0=2616, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L38] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L39] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L41] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L72] main_#t~ret11 := isinf_double_#res; [L72] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_#t~ret11=0, main_~res~0=6.0, main_~x~0=6.0] [L72-L75] assume 0 == main_#t~ret11; [L72] havoc main_#t~ret11; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L73] assert false; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L69] fabs_double_#in~x := main_~x~0; [L69] havoc fabs_double_#res; [L69] havoc fabs_double_#t~mem6, fabs_double_#t~union7, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem8, fabs_double_#t~union9.lsw, fabs_double_#t~union9.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0; [L44-L58] fabs_double_~x := fabs_double_#in~x; [L45] havoc fabs_double_~high~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_~x=6.0, main_~x~0=6.0] [L47] call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.alloc(8); [L48] call write~real(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L49] call fabs_double_#t~mem6 := read~int(fabs_double_~#gh_u~1.base, 4 + fabs_double_~#gh_u~1.offset, 4); [L49] fabs_double_~high~0 := fabs_double_#t~mem6; [L49] call write~real(fabs_double_#t~union7, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8); [L49] havoc fabs_double_#t~mem6; [L49] havoc fabs_double_#t~union7; [L47] call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset); [L47] havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L52] call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.alloc(8); [L53] call write~real(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L54] call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L55] call fabs_double_#t~mem8 := read~real(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8); [L55] fabs_double_~x := fabs_double_#t~mem8; [L55] call write~int(fabs_double_#t~union9.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4); [L55] call write~int(fabs_double_#t~union9.msw, fabs_double_~#sh_u~0.base, 4 + fabs_double_~#sh_u~0.offset, 4); [L55] havoc fabs_double_#t~mem8; [L55] havoc fabs_double_#t~union9.lsw, fabs_double_#t~union9.msw; [L52] call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset); [L52] havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L57] fabs_double_#res := fabs_double_~x; [L69] main_#t~ret10 := fabs_double_#res; [L69] main_~res~0 := main_#t~ret10; [L69] havoc main_#t~ret10; [L72] isinf_double_#in~x := main_~res~0; [L72] havoc isinf_double_#res; [L72] havoc isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_#t~mem4, isinf_double_#t~union5, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L30-L42] isinf_double_~x := isinf_double_#in~x; [L31] havoc isinf_double_~hx~0; [L31] havoc isinf_double_~lx~0; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L33] call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L35] call isinf_double_#t~mem2 := read~int(isinf_double_~#ew_u~0.base, 4 + isinf_double_~#ew_u~0.offset, 4); [L35] isinf_double_~hx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] call write~real(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L35] havoc isinf_double_#t~union3; [L35] havoc isinf_double_#t~mem2; [L36] call isinf_double_#t~mem4 := read~int(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4); [L36] isinf_double_~lx~0 := (if isinf_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem4 % 4294967296 % 4294967296 else isinf_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] call write~real(isinf_double_#t~union5, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8); [L36] havoc isinf_double_#t~mem4; [L36] havoc isinf_double_#t~union5; [L33] call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset); [L33] havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~hx~0=2616, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L38] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L39] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L41] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L72] main_#t~ret11 := isinf_double_#res; [L72] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_#t~ret11=0, main_~res~0=6.0, main_~x~0=6.0] [L72-L75] assume 0 == main_#t~ret11; [L72] havoc main_#t~ret11; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L73] assert false; VAL [#NULL.base=0, #NULL.offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L69] fabs_double_#in~x := main_~x~0; [L69] havoc fabs_double_#res; [L69] havoc fabs_double_#t~mem6, fabs_double_#t~union7, fabs_double_~#gh_u~1, fabs_double_#t~mem8, fabs_double_#t~union9, fabs_double_~#sh_u~0, fabs_double_~x, fabs_double_~high~0; [L44-L58] fabs_double_~x := fabs_double_#in~x; [L45] havoc fabs_double_~high~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_~x=6.0, main_~x~0=6.0] [L47] FCALL call fabs_double_~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L49] FCALL call fabs_double_#t~mem6 := read~int({ base: fabs_double_~#gh_u~1!base, offset: 4 + fabs_double_~#gh_u~1!offset }, 4); [L49] fabs_double_~high~0 := fabs_double_#t~mem6; [L49] FCALL call write~real(fabs_double_#t~union7, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L49] havoc fabs_double_#t~mem6; [L49] havoc fabs_double_#t~union7; [L47] FCALL call ULTIMATE.dealloc(fabs_double_~#gh_u~1); [L47] havoc fabs_double_~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L52] FCALL call fabs_double_~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L55] FCALL call fabs_double_#t~mem8 := read~real({ base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L55] fabs_double_~x := fabs_double_#t~mem8; [L55] FCALL call write~int(fabs_double_#t~union9!lsw, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 4); [L55] FCALL call write~int(fabs_double_#t~union9!msw, { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L55] havoc fabs_double_#t~mem8; [L55] havoc fabs_double_#t~union9; [L52] FCALL call ULTIMATE.dealloc(fabs_double_~#sh_u~0); [L52] havoc fabs_double_~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L57] fabs_double_#res := fabs_double_~x; [L69] main_#t~ret10 := fabs_double_#res; [L69] main_~res~0 := main_#t~ret10; [L69] havoc main_#t~ret10; [L72] isinf_double_#in~x := main_~res~0; [L72] havoc isinf_double_#res; [L72] havoc isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_#t~mem4, isinf_double_#t~union5, isinf_double_~#ew_u~0, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L30-L42] isinf_double_~x := isinf_double_#in~x; [L31] havoc isinf_double_~hx~0; [L31] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L33] FCALL call isinf_double_~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L35] FCALL call isinf_double_#t~mem2 := read~int({ base: isinf_double_~#ew_u~0!base, offset: 4 + isinf_double_~#ew_u~0!offset }, 4); [L35] isinf_double_~hx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(isinf_double_#t~union3, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L35] havoc isinf_double_#t~union3; [L35] havoc isinf_double_#t~mem2; [L36] FCALL call isinf_double_#t~mem4 := read~int({ base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 4); [L36] isinf_double_~lx~0 := (if isinf_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem4 % 4294967296 % 4294967296 else isinf_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(isinf_double_#t~union5, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L36] havoc isinf_double_#t~mem4; [L36] havoc isinf_double_#t~union5; [L33] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~0); [L33] havoc isinf_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~hx~0=2616, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L38] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L39] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L41] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L72] main_#t~ret11 := isinf_double_#res; [L72] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_#t~ret11=0, main_~res~0=6.0, main_~x~0=6.0] [L72] COND TRUE 0 == main_#t~ret11 [L72] havoc main_#t~ret11; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L69] fabs_double_#in~x := main_~x~0; [L69] havoc fabs_double_#res; [L69] havoc fabs_double_#t~mem6, fabs_double_#t~union7, fabs_double_~#gh_u~1, fabs_double_#t~mem8, fabs_double_#t~union9, fabs_double_~#sh_u~0, fabs_double_~x, fabs_double_~high~0; [L44-L58] fabs_double_~x := fabs_double_#in~x; [L45] havoc fabs_double_~high~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_~x=6.0, main_~x~0=6.0] [L47] FCALL call fabs_double_~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L49] FCALL call fabs_double_#t~mem6 := read~int({ base: fabs_double_~#gh_u~1!base, offset: 4 + fabs_double_~#gh_u~1!offset }, 4); [L49] fabs_double_~high~0 := fabs_double_#t~mem6; [L49] FCALL call write~real(fabs_double_#t~union7, { base: fabs_double_~#gh_u~1!base, offset: fabs_double_~#gh_u~1!offset }, 8); [L49] havoc fabs_double_#t~mem6; [L49] havoc fabs_double_#t~union7; [L47] FCALL call ULTIMATE.dealloc(fabs_double_~#gh_u~1); [L47] havoc fabs_double_~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L52] FCALL call fabs_double_~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(fabs_double_~x, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(fabs_double_~high~0, 2147483647), { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L55] FCALL call fabs_double_#t~mem8 := read~real({ base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 8); [L55] fabs_double_~x := fabs_double_#t~mem8; [L55] FCALL call write~int(fabs_double_#t~union9!lsw, { base: fabs_double_~#sh_u~0!base, offset: fabs_double_~#sh_u~0!offset }, 4); [L55] FCALL call write~int(fabs_double_#t~union9!msw, { base: fabs_double_~#sh_u~0!base, offset: 4 + fabs_double_~#sh_u~0!offset }, 4); [L55] havoc fabs_double_#t~mem8; [L55] havoc fabs_double_#t~union9; [L52] FCALL call ULTIMATE.dealloc(fabs_double_~#sh_u~0); [L52] havoc fabs_double_~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, main_~x~0=6.0] [L57] fabs_double_#res := fabs_double_~x; [L69] main_#t~ret10 := fabs_double_#res; [L69] main_~res~0 := main_#t~ret10; [L69] havoc main_#t~ret10; [L72] isinf_double_#in~x := main_~res~0; [L72] havoc isinf_double_#res; [L72] havoc isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_#t~mem4, isinf_double_#t~union5, isinf_double_~#ew_u~0, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0; [L30-L42] isinf_double_~x := isinf_double_#in~x; [L31] havoc isinf_double_~hx~0; [L31] havoc isinf_double_~lx~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L33] FCALL call isinf_double_~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(isinf_double_~x, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L35] FCALL call isinf_double_#t~mem2 := read~int({ base: isinf_double_~#ew_u~0!base, offset: 4 + isinf_double_~#ew_u~0!offset }, 4); [L35] isinf_double_~hx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(isinf_double_#t~union3, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L35] havoc isinf_double_#t~union3; [L35] havoc isinf_double_#t~mem2; [L36] FCALL call isinf_double_#t~mem4 := read~int({ base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 4); [L36] isinf_double_~lx~0 := (if isinf_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem4 % 4294967296 % 4294967296 else isinf_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(isinf_double_#t~union5, { base: isinf_double_~#ew_u~0!base, offset: isinf_double_~#ew_u~0!offset }, 8); [L36] havoc isinf_double_#t~mem4; [L36] havoc isinf_double_#t~union5; [L33] FCALL call ULTIMATE.dealloc(isinf_double_~#ew_u~0); [L33] havoc isinf_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_~hx~0=2616, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L38] isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647); [L39] isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0; [L41] isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L72] main_#t~ret11 := isinf_double_#res; [L72] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_#t~ret11=0, main_~res~0=6.0, main_~x~0=6.0] [L72] COND TRUE 0 == main_#t~ret11 [L72] havoc main_#t~ret11; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0, fabs_double_#in~x=6.0, fabs_double_#res=6.0, fabs_double_~high~0=30, fabs_double_~x=6.0, isinf_double_#in~x=6.0, isinf_double_#res=0, isinf_double_~hx~0=2146434205, isinf_double_~lx~0=3609, isinf_double_~x=6.0, main_~res~0=6.0, main_~x~0=6.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#NULL!base=0, #NULL!offset=0] [L47] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] FCALL call #t~mem6 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L49] ~high~0 := #t~mem6; [L49] FCALL call write~real(#t~union7, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L47] havoc ~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L52] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] FCALL call #t~mem8 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L55] ~x := #t~mem8; [L55] FCALL call write~int(#t~union9!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L55] FCALL call write~int(#t~union9!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9; [L52] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L52] havoc ~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L57] #res := ~x; [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L36] havoc #t~mem4; [L36] havoc #t~union5; [L33] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L33] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L72] COND TRUE 0 == #t~ret11 [L72] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); [L44-L58] ~x := #in~x; [L45] havoc ~high~0; VAL [#NULL!base=0, #NULL!offset=0] [L47] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L48] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] FCALL call #t~mem6 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L49] ~high~0 := #t~mem6; [L49] FCALL call write~real(#t~union7, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L49] havoc #t~mem6; [L49] havoc #t~union7; [L47] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L47] havoc ~#gh_u~1; VAL [#NULL!base=0, #NULL!offset=0] [L52] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L53] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L54] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] FCALL call #t~mem8 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L55] ~x := #t~mem8; [L55] FCALL call write~int(#t~union9!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L55] FCALL call write~int(#t~union9!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L55] havoc #t~mem8; [L55] havoc #t~union9; [L52] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L52] havoc ~#sh_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L57] #res := ~x; [L69] ~res~0 := #t~ret10; [L69] havoc #t~ret10; [L30-L42] ~x := #in~x; [L31] havoc ~hx~0; [L31] havoc ~lx~0; VAL [#NULL!base=0, #NULL!offset=0] [L33] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L35] ~hx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L35] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L35] havoc #t~union3; [L35] havoc #t~mem2; [L36] FCALL call #t~mem4 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L36] ~lx~0 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); [L36] FCALL call write~real(#t~union5, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L36] havoc #t~mem4; [L36] havoc #t~union5; [L33] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L33] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L38] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L39] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L40] ~hx~0 := 2146435072 - ~hx~0; [L41] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); [L72] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L72] COND TRUE 0 == #t~ret11 [L72] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0] [L73] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L68] double x = 1.0 / 0.0; [L45] __uint32_t high; [L47] ieee_double_shape_type gh_u; [L48] gh_u.value = (x) [L49] EXPR gh_u.parts.msw [L49] (high) = gh_u.parts.msw [L52] ieee_double_shape_type sh_u; [L53] sh_u.value = (x) [L54] sh_u.parts.msw = (high & 0x7fffffff) [L55] EXPR sh_u.value [L55] (x) = sh_u.value [L57] return x; [L69] double res = fabs_double(x); [L31] __int32_t hx, lx; [L33] ieee_double_shape_type ew_u; [L34] ew_u.value = (x) [L35] EXPR ew_u.parts.msw [L35] (hx) = ew_u.parts.msw [L36] EXPR ew_u.parts.lsw [L36] (lx) = ew_u.parts.lsw [L38] hx &= 0x7fffffff [L39] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L40] hx = 0x7ff00000 - hx [L41] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L72] COND TRUE !isinf_double(res) [L73] __VERIFIER_error() ----- [2018-11-23 01:52:33,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:52:33 ImpRootNode [2018-11-23 01:52:33,754 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 01:52:33,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:52:33,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:52:33,754 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:52:33,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:33" (3/4) ... [2018-11-23 01:52:33,758 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:52:33,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:52:33,759 INFO L168 Benchmark]: Toolchain (without parser) took 902.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:33,761 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:52:33,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.85 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 943.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:33,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.18 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:52:33,765 INFO L168 Benchmark]: Boogie Preprocessor took 63.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 943.5 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:33,766 INFO L168 Benchmark]: RCFGBuilder took 260.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:33,767 INFO L168 Benchmark]: CodeCheck took 372.58 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:33,767 INFO L168 Benchmark]: Witness Printer took 4.42 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 01:52:33,770 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, 18 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 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, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 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: 73]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of bitwiseAnd at line 38. Possible FailurePath: [L68] double x = 1.0 / 0.0; [L45] __uint32_t high; [L47] ieee_double_shape_type gh_u; [L48] gh_u.value = (x) [L49] EXPR gh_u.parts.msw [L49] (high) = gh_u.parts.msw [L52] ieee_double_shape_type sh_u; [L53] sh_u.value = (x) [L54] sh_u.parts.msw = (high & 0x7fffffff) [L55] EXPR sh_u.value [L55] (x) = sh_u.value [L57] return x; [L69] double res = fabs_double(x); [L31] __int32_t hx, lx; [L33] ieee_double_shape_type ew_u; [L34] ew_u.value = (x) [L35] EXPR ew_u.parts.msw [L35] (hx) = ew_u.parts.msw [L36] EXPR ew_u.parts.lsw [L36] (lx) = ew_u.parts.lsw [L38] hx &= 0x7fffffff [L39] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L40] hx = 0x7ff00000 - hx [L41] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L72] COND TRUE !isinf_double(res) [L73] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.85 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 943.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.18 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 943.5 MB in the beginning and 1.2 GB in the end (delta: -224.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 260.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * CodeCheck took 372.58 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 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 01:52:35,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:52:35,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:52:35,210 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:52:35,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:52:35,211 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:52:35,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:52:35,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:52:35,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:52:35,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:52:35,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:52:35,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:52:35,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:52:35,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:52:35,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:52:35,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:52:35,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:52:35,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:52:35,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:52:35,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:52:35,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:52:35,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:52:35,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:52:35,226 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:52:35,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:52:35,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:52:35,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:52:35,228 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:52:35,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:52:35,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:52:35,229 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:52:35,229 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:52:35,230 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:52:35,230 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:52:35,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:52:35,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:52:35,231 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 01:52:35,242 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:52:35,242 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:52:35,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:52:35,242 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 01:52:35,243 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:52:35,243 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:52:35,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:52:35,243 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:52:35,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:52:35,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:52:35,245 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:52:35,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:52:35,245 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:52:35,245 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:52:35,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:52:35,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:52:35,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:52:35,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:52:35,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:52:35,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:52:35,246 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 01:52:35,246 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:52:35,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:52:35,246 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:52:35,247 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 01:52:35,247 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_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/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 -> b885e206564f4e9bb7a421e0f9e82e87cbb5e4d9 [2018-11-23 01:52:35,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:52:35,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:52:35,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:52:35,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:52:35,285 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:52:35,285 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 01:52:35,321 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/d956a2cb5/471d53d11d24463584f6963828e83724/FLAG617d29934 [2018-11-23 01:52:35,650 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:52:35,651 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/sv-benchmarks/c/float-newlib/double_req_bl_1012a_true-unreach-call.c [2018-11-23 01:52:35,654 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/d956a2cb5/471d53d11d24463584f6963828e83724/FLAG617d29934 [2018-11-23 01:52:36,084 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/data/d956a2cb5/471d53d11d24463584f6963828e83724 [2018-11-23 01:52:36,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:52:36,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:52:36,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:36,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:52:36,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:52:36,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30cef67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36, skipping insertion in model container [2018-11-23 01:52:36,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:52:36,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:52:36,252 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:36,257 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:52:36,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:52:36,295 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:52:36,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36 WrapperNode [2018-11-23 01:52:36,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:52:36,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:36,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:52:36,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:52:36,301 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:52:36" (1/1) ... [2018-11-23 01:52:36,307 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:52:36" (1/1) ... [2018-11-23 01:52:36,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:52:36,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:52:36,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:52:36,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:52:36,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:52:36,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:52:36,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:52:36,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:52:36,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/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 01:52:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 01:52:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 01:52:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:52:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 01:52:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:52:36,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:52:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 01:52:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:52:36,512 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 01:52:36,532 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 01:52:36,556 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 01:52:36,599 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:52:36,599 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 01:52:36,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:36 BoogieIcfgContainer [2018-11-23 01:52:36,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:52:36,600 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:52:36,600 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:52:36,609 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:52:36,609 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:36" (1/1) ... [2018-11-23 01:52:36,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:52:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:52:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 14 states and 20 transitions. [2018-11-23 01:52:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2018-11-23 01:52:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 01:52:36,654 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:52:36,693 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:52:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:36,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:52:36,728 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 01:52:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:52:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 14 states and 13 transitions. [2018-11-23 01:52:36,737 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 01:52:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 01:52:36,737 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:52:36,738 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 01:52:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:52:36,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:52:36,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 01:52:36,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-23 01:52:36,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-11-23 01:52:36,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 01:52:36,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:52:36,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:52:36,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 01:52:36,885 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:95, output treesize:56 [2018-11-23 01:52:36,912 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:52:36,913 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:52:36,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-11-23 01:52:36,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:52:36,976 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 01:52:36,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-23 01:52:36,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 01:52:36,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-23 01:52:37,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 01:52:37,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 01:52:37,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 01:52:37,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:52:37,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 01:52:37,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 01:52:37,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:23 [2018-11-23 01:52:37,092 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 01:52:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:52:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 12 states and 11 transitions. [2018-11-23 01:52:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2018-11-23 01:52:37,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:52:37,440 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 3 iterations. [2018-11-23 01:52:37,446 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 01:52:37,498 INFO L579 CodeCheckObserver]: Invariant with dag size 7 [2018-11-23 01:52:37,504 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,505 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,508 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,508 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,509 INFO L579 CodeCheckObserver]: Invariant with dag size 7 [2018-11-23 01:52:37,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,509 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,510 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,510 INFO L579 CodeCheckObserver]: Invariant with dag size 19 [2018-11-23 01:52:37,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,511 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,513 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,514 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,514 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,514 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 01:52:37,515 INFO L579 CodeCheckObserver]: Invariant with dag size 7 [2018-11-23 01:52:37,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,515 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,516 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:52:37 ImpRootNode [2018-11-23 01:52:37,516 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 01:52:37,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:52:37,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:52:37,517 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:52:37,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:36" (3/4) ... [2018-11-23 01:52:37,520 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:52:37,528 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 01:52:37,528 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 01:52:37,528 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 01:52:37,550 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cb63e9a2-ebe1-4319-8f4d-5264a4d5a286/bin-2019/ukojak/witness.graphml [2018-11-23 01:52:37,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:52:37,551 INFO L168 Benchmark]: Toolchain (without parser) took 1463.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -52.6 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:37,552 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 01:52:37,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.71 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 01:52:37,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.14 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 01:52:37,553 INFO L168 Benchmark]: Boogie Preprocessor took 21.44 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 01:52:37,553 INFO L168 Benchmark]: RCFGBuilder took 258.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:37,553 INFO L168 Benchmark]: CodeCheck took 916.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:52:37,554 INFO L168 Benchmark]: Witness Printer took 33.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:52:37,555 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, 18 locations, 1 error locations. SAFE Result, 0.8s OverallTime, 3 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 14 SDslu, 12 SDs, 0 SdLazy, 52 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 5 QuantifiedInterpolants, 1909 SizeOfPredicates, 11 NumberOfNonLiveVariables, 71 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 - PositiveResult [Line: 73]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 51]: Loop Invariant [2018-11-23 01:52:37,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,557 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 46]: Loop Invariant [2018-11-23 01:52:37,557 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,557 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,557 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,557 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 32]: Loop Invariant [2018-11-23 01:52:37,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 01:52:37,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] Derived loop invariant: (\exists v_prenex_8 : bv64 :: (v_prenex_8[31:0] == lx && ~fp~LONGDOUBLE(v_prenex_8[63:63], v_prenex_8[62:52], v_prenex_8[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())) && v_prenex_8[63:32] == hx) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant [2018-11-23 01:52:37,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 01:52:37,559 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()) * 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 206.71 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 24.14 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 21.44 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. * RCFGBuilder took 258.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * CodeCheck took 916.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. * Witness Printer took 33.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! Received shutdown request...