./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1091_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_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1091_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/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 84dba58cac25505e0eb3c404a47a071a268de901 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1091_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/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 84dba58cac25505e0eb3c404a47a071a268de901 .................................................................................................................................................................................................................................................................................................................... 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 03:38:08,963 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:38:08,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:38:08,971 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:38:08,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:38:08,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:38:08,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:38:08,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:38:08,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:38:08,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:38:08,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:38:08,975 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:38:08,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:38:08,976 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:38:08,976 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:38:08,977 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:38:08,977 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:38:08,978 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:38:08,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:38:08,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:38:08,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:38:08,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:38:08,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:38:08,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:38:08,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:38:08,985 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:38:08,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:38:08,986 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:38:08,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:38:08,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:38:08,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:38:08,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:38:08,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:38:08,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:38:08,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:38:08,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:38:08,988 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 03:38:08,996 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:38:08,996 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:38:08,996 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:38:08,996 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 03:38:08,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:38:08,997 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:38:08,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:38:08,997 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:38:08,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:38:08,998 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:38:08,999 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:38:08,999 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 03:38:08,999 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 03:38:08,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:38:08,999 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:38:08,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 03:38:08,999 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:38:09,000 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:38:09,000 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:38:09,000 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 03:38:09,000 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:38:09,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:38:09,000 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_1fa57220-9b60-4e46-81c9-e27706d28a2c/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 -> 84dba58cac25505e0eb3c404a47a071a268de901 [2018-11-23 03:38:09,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:38:09,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:38:09,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:38:09,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:38:09,039 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:38:09,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1091_true-unreach-call.c [2018-11-23 03:38:09,083 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/a0ffbc153/390eb5045f864cd6a2e3c170032842f3/FLAGccc86b621 [2018-11-23 03:38:09,479 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:38:09,480 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/sv-benchmarks/c/float-newlib/double_req_bl_1091_true-unreach-call.c [2018-11-23 03:38:09,484 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/a0ffbc153/390eb5045f864cd6a2e3c170032842f3/FLAGccc86b621 [2018-11-23 03:38:09,494 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/a0ffbc153/390eb5045f864cd6a2e3c170032842f3 [2018-11-23 03:38:09,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:38:09,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:38:09,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:38:09,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:38:09,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:38:09,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9b2349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09, skipping insertion in model container [2018-11-23 03:38:09,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:38:09,524 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:38:09,632 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:38:09,634 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:38:09,654 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:38:09,669 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:38:09,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09 WrapperNode [2018-11-23 03:38:09,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:38:09,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:38:09,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:38:09,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:38:09,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:38:09,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:38:09,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:38:09,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:38:09,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... [2018-11-23 03:38:09,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:38:09,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:38:09,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:38:09,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:38:09,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/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 03:38:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 03:38:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:38:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 03:38:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:38:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:38:09,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:38:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:38:09,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:38:10,211 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:38:10,211 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 03:38:10,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:38:10 BoogieIcfgContainer [2018-11-23 03:38:10,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:38:10,212 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 03:38:10,212 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 03:38:10,223 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 03:38:10,223 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:38:10" (1/1) ... [2018-11-23 03:38:10,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:38:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-23 03:38:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-23 03:38:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 03:38:10,255 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:10,321 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 03:38:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-23 03:38:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-23 03:38:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 03:38:10,329 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:38:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:38:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:38:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:38:10,430 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_ceil~0 := 1.0E300;havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);ceil_double_#in~x := main_~x~0;havoc ceil_double_#res;havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0;ceil_double_~x := ceil_double_#in~x;havoc ceil_double_~i0~0;havoc ceil_double_~i1~0;havoc ceil_double_~j0~0;havoc ceil_double_~i~0;havoc ceil_double_~j~0; VAL [ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8);call ceil_double_#t~mem0 := read~int(ceil_double_~#ew_u~0.base, 4 + ceil_double_~#ew_u~0.offset, 4);ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8);havoc ceil_double_#t~mem0;havoc ceil_double_#t~union1;call ceil_double_#t~mem2 := read~int(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4);ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8);havoc ceil_double_#t~union3;havoc ceil_double_#t~mem2;call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset);havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(ceil_double_~j0~0 < 20); VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ceil_double_~j0~0 > 51;BeginParallelComposition{ParallelCodeBlock0: assume 1024 == ceil_double_~j0~0;ceil_double_#res := ~someBinaryArithmeticDOUBLEoperation(ceil_double_~x, ceil_double_~x);ParallelCodeBlock1: assume !(1024 == ceil_double_~j0~0);ceil_double_#res := ceil_double_~x;}EndParallelComposition VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, |ULTIMATE.start_ceil_double_#res|=3.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] main_#t~ret6 := ceil_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_double_#in~x := main_~res~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0);main_#t~ret7 := isnan_double_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_isnan_double_~x=3.0, ULTIMATE.start_main_~res~0=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, |ULTIMATE.start_ceil_double_#res|=3.0, |ULTIMATE.start_isnan_double_#in~x|=3.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_main_#t~ret7|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == main_#t~ret7;havoc main_#t~ret7; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_isnan_double_~x=3.0, ULTIMATE.start_main_~res~0=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, |ULTIMATE.start_ceil_double_#res|=3.0, |ULTIMATE.start_isnan_double_#in~x|=3.0, |ULTIMATE.start_isnan_double_#res|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [ULTIMATE.start_ceil_double_~i0~0=0, ULTIMATE.start_ceil_double_~i1~0=8945, ULTIMATE.start_ceil_double_~j0~0=52, ULTIMATE.start_ceil_double_~x=3.0, ULTIMATE.start_isnan_double_~x=3.0, ULTIMATE.start_main_~res~0=3.0, ULTIMATE.start_main_~x~0=3.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_ceil_double_#in~x|=3.0, |ULTIMATE.start_ceil_double_#res|=3.0, |ULTIMATE.start_isnan_double_#in~x|=3.0, |ULTIMATE.start_isnan_double_#res|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L90] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L91] ceil_double_#in~x := main_~x~0; [L91] havoc ceil_double_#res; [L91] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L23] call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] call ceil_double_#t~mem0 := read~int(ceil_double_~#ew_u~0.base, 4 + ceil_double_~#ew_u~0.offset, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] call ceil_double_#t~mem2 := read~int(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L26] havoc ceil_double_#t~union3; [L26] havoc ceil_double_#t~mem2; [L23] call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset); [L23] havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L29-L73] assume !(ceil_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L51-L73] assume ceil_double_~j0~0 > 51; [L52-L55] assume !(1024 == ceil_double_~j0~0); [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L91] main_#t~ret6 := ceil_double_#res; [L91] main_~res~0 := main_#t~ret6; [L91] havoc main_#t~ret6; [L94] isnan_double_#in~x := main_~res~0; [L94] havoc isnan_double_#res; [L94] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L94] main_#t~ret7 := isnan_double_#res; [L94] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L94-L97] assume 0 == main_#t~ret7; [L94] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L95] assert false; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L90] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L91] ceil_double_#in~x := main_~x~0; [L91] havoc ceil_double_#res; [L91] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, ceil_double_#t~mem4, ceil_double_#t~union5.lsw, ceil_double_#t~union5.msw, ceil_double_~#iw_u~0.base, ceil_double_~#iw_u~0.offset, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L23] call ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(ceil_double_~x, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] call ceil_double_#t~mem0 := read~int(ceil_double_~#ew_u~0.base, 4 + ceil_double_~#ew_u~0.offset, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(ceil_double_#t~union1, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] call ceil_double_#t~mem2 := read~int(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(ceil_double_#t~union3, ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset, 8); [L26] havoc ceil_double_#t~union3; [L26] havoc ceil_double_#t~mem2; [L23] call ULTIMATE.dealloc(ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset); [L23] havoc ceil_double_~#ew_u~0.base, ceil_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L29-L73] assume !(ceil_double_~j0~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L51-L73] assume ceil_double_~j0~0 > 51; [L52-L55] assume !(1024 == ceil_double_~j0~0); [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L91] main_#t~ret6 := ceil_double_#res; [L91] main_~res~0 := main_#t~ret6; [L91] havoc main_#t~ret6; [L94] isnan_double_#in~x := main_~res~0; [L94] havoc isnan_double_#res; [L94] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L94] main_#t~ret7 := isnan_double_#res; [L94] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L94-L97] assume 0 == main_#t~ret7; [L94] havoc main_#t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L95] assert false; VAL [#NULL.base=0, #NULL.offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L90] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L91] ceil_double_#in~x := main_~x~0; [L91] havoc ceil_double_#res; [L91] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0, ceil_double_#t~mem4, ceil_double_#t~union5, ceil_double_~#iw_u~0, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L23] FCALL call ceil_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(ceil_double_~x, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] FCALL call ceil_double_#t~mem0 := read~int({ base: ceil_double_~#ew_u~0!base, offset: 4 + ceil_double_~#ew_u~0!offset }, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(ceil_double_#t~union1, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] FCALL call ceil_double_#t~mem2 := read~int({ base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(ceil_double_#t~union3, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L26] havoc ceil_double_#t~union3; [L26] havoc ceil_double_#t~mem2; [L23] FCALL call ULTIMATE.dealloc(ceil_double_~#ew_u~0); [L23] havoc ceil_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(ceil_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ceil_double_~j0~0 > 51 [L52] COND FALSE !(1024 == ceil_double_~j0~0) [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L91] main_#t~ret6 := ceil_double_#res; [L91] main_~res~0 := main_#t~ret6; [L91] havoc main_#t~ret6; [L94] isnan_double_#in~x := main_~res~0; [L94] havoc isnan_double_#res; [L94] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L94] main_#t~ret7 := isnan_double_#res; [L94] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L94] COND TRUE 0 == main_#t~ret7 [L94] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L95] assert false; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0; [L90] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L91] ceil_double_#in~x := main_~x~0; [L91] havoc ceil_double_#res; [L91] havoc ceil_double_#t~mem0, ceil_double_#t~union1, ceil_double_#t~mem2, ceil_double_#t~union3, ceil_double_~#ew_u~0, ceil_double_#t~mem4, ceil_double_#t~union5, ceil_double_~#iw_u~0, ceil_double_~x, ceil_double_~i0~0, ceil_double_~i1~0, ceil_double_~j0~0, ceil_double_~i~0, ceil_double_~j~0; [L19-L81] ceil_double_~x := ceil_double_#in~x; [L20] havoc ceil_double_~i0~0; [L20] havoc ceil_double_~i1~0; [L20] havoc ceil_double_~j0~0; [L21] havoc ceil_double_~i~0; [L21] havoc ceil_double_~j~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L23] FCALL call ceil_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(ceil_double_~x, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] FCALL call ceil_double_#t~mem0 := read~int({ base: ceil_double_~#ew_u~0!base, offset: 4 + ceil_double_~#ew_u~0!offset }, 4); [L25] ceil_double_~i0~0 := (if ceil_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem0 % 4294967296 % 4294967296 else ceil_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(ceil_double_#t~union1, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L25] havoc ceil_double_#t~mem0; [L25] havoc ceil_double_#t~union1; [L26] FCALL call ceil_double_#t~mem2 := read~int({ base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 4); [L26] ceil_double_~i1~0 := (if ceil_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then ceil_double_#t~mem2 % 4294967296 % 4294967296 else ceil_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(ceil_double_#t~union3, { base: ceil_double_~#ew_u~0!base, offset: ceil_double_~#ew_u~0!offset }, 8); [L26] havoc ceil_double_#t~union3; [L26] havoc ceil_double_#t~mem2; [L23] FCALL call ULTIMATE.dealloc(ceil_double_~#ew_u~0); [L23] havoc ceil_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L28] ceil_double_~j0~0 := ~bitwiseAnd(ceil_double_~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(ceil_double_~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ceil_double_~j0~0 > 51 [L52] COND FALSE !(1024 == ceil_double_~j0~0) [L55] ceil_double_#res := ceil_double_~x; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L91] main_#t~ret6 := ceil_double_#res; [L91] main_~res~0 := main_#t~ret6; [L91] havoc main_#t~ret6; [L94] isnan_double_#in~x := main_~res~0; [L94] havoc isnan_double_#res; [L94] havoc isnan_double_~x; [L15] isnan_double_~x := isnan_double_#in~x; [L15] isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); [L94] main_#t~ret7 := isnan_double_#res; [L94] assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_#t~ret7=0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L94] COND TRUE 0 == main_#t~ret7 [L94] havoc main_#t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [L95] assert false; VAL [#NULL!base=0, #NULL!offset=0, ceil_double_#in~x=3.0, ceil_double_#res=3.0, ceil_double_~i0~0=0, ceil_double_~i1~0=8945, ceil_double_~j0~0=52, ceil_double_~x=3.0, isnan_double_#in~x=3.0, isnan_double_#res=0, isnan_double_~x=3.0, main_~res~0=3.0, main_~x~0=3.0, ~huge_ceil~0=1.0E300] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [L90] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ~j0~0 > 51 [L52] COND FALSE !(1024 == ~j0~0) [L55] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L91] ~res~0 := #t~ret6; [L91] havoc #t~ret6; [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L94] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L94] COND TRUE 0 == #t~ret7 [L94] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L95] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; [L90] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L29] COND FALSE !(~j0~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L51] COND TRUE ~j0~0 > 51 [L52] COND FALSE !(1024 == ~j0~0) [L55] #res := ~x; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L91] ~res~0 := #t~ret6; [L91] havoc #t~ret6; [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L94] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L94] COND TRUE 0 == #t~ret7 [L94] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L95] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L17] static const double huge_ceil = 1.0e300; [L90] double x = 0.0 / 0.0; [L20] __int32_t i0, i1, j0; [L21] __uint32_t i, j; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (i0) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (i1) = ew_u.parts.lsw [L28] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L29] COND FALSE !(j0 < 20) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L51] COND TRUE j0 > 51 [L52] COND FALSE !(j0 == 0x400) [L55] return x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L91] double res = ceil_double(x); [L15] return x != x; [L94] COND TRUE !isnan_double(res) [L95] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] ----- [2018-11-23 03:38:10,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 03:38:10 ImpRootNode [2018-11-23 03:38:10,484 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 03:38:10,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:38:10,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:38:10,485 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:38:10,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:38:10" (3/4) ... [2018-11-23 03:38:10,488 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:38:10,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:38:10,489 INFO L168 Benchmark]: Toolchain (without parser) took 992.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -110.1 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:10,490 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:38:10,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:10,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:10,492 INFO L168 Benchmark]: Boogie Preprocessor took 23.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:10,493 INFO L168 Benchmark]: RCFGBuilder took 456.28 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:10,493 INFO L168 Benchmark]: CodeCheck took 272.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:10,494 INFO L168 Benchmark]: Witness Printer took 3.90 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 03:38:10,497 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, 34 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 55 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, 17 NumberOfCodeBlocks, 17 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: 95]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 15, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of bitwiseAnd at line 28. Possible FailurePath: [L17] static const double huge_ceil = 1.0e300; [L90] double x = 0.0 / 0.0; [L20] __int32_t i0, i1, j0; [L21] __uint32_t i, j; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (i0) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (i1) = ew_u.parts.lsw [L28] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L29] COND FALSE !(j0 < 20) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L51] COND TRUE j0 > 51 [L52] COND FALSE !(j0 == 0x400) [L55] return x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L91] double res = ceil_double(x); [L15] return x != x; [L94] COND TRUE !isnan_double(res) [L95] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] * 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 456.28 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * CodeCheck took 272.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.90 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 03:38:11,931 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:38:11,933 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:38:11,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:38:11,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:38:11,943 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:38:11,944 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:38:11,945 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:38:11,946 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:38:11,947 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:38:11,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:38:11,947 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:38:11,948 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:38:11,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:38:11,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:38:11,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:38:11,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:38:11,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:38:11,954 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:38:11,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:38:11,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:38:11,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:38:11,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:38:11,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:38:11,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:38:11,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:38:11,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:38:11,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:38:11,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:38:11,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:38:11,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:38:11,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:38:11,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:38:11,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:38:11,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:38:11,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:38:11,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 03:38:11,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:38:11,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:38:11,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:38:11,977 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 03:38:11,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:38:11,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:38:11,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:38:11,978 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:38:11,978 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:38:11,978 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:38:11,978 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:38:11,979 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:38:11,980 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 03:38:11,981 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 03:38:11,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:38:11,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:38:11,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 03:38:11,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:38:11,982 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:38:11,982 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:38:11,983 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 03:38:11,983 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 03:38:11,983 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:38:11,983 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:38:11,983 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:38:11,983 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_1fa57220-9b60-4e46-81c9-e27706d28a2c/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 -> 84dba58cac25505e0eb3c404a47a071a268de901 [2018-11-23 03:38:12,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:38:12,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:38:12,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:38:12,026 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:38:12,027 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:38:12,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1091_true-unreach-call.c [2018-11-23 03:38:12,068 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/8a45e6f12/a97fa680f6aa4ca8b9a3ef6ba5d94e22/FLAGf5db34897 [2018-11-23 03:38:12,462 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:38:12,462 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/sv-benchmarks/c/float-newlib/double_req_bl_1091_true-unreach-call.c [2018-11-23 03:38:12,467 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/8a45e6f12/a97fa680f6aa4ca8b9a3ef6ba5d94e22/FLAGf5db34897 [2018-11-23 03:38:12,474 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/data/8a45e6f12/a97fa680f6aa4ca8b9a3ef6ba5d94e22 [2018-11-23 03:38:12,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:38:12,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:38:12,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:38:12,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:38:12,481 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:38:12,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2a43b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12, skipping insertion in model container [2018-11-23 03:38:12,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:38:12,507 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:38:12,626 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:38:12,630 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:38:12,651 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:38:12,671 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:38:12,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12 WrapperNode [2018-11-23 03:38:12,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:38:12,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:38:12,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:38:12,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:38:12,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:38:12,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:38:12,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:38:12,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:38:12,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... [2018-11-23 03:38:12,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:38:12,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:38:12,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:38:12,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:38:12,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:38:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/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 03:38:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 03:38:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:38:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 03:38:12,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 03:38:12,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:38:12,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:38:12,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 03:38:12,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:38:12,920 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:38:16,650 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:38:16,651 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 03:38:16,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:38:16 BoogieIcfgContainer [2018-11-23 03:38:16,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:38:16,651 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 03:38:16,652 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 03:38:16,658 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 03:38:16,658 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:38:16" (1/1) ... [2018-11-23 03:38:16,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:38:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-11-23 03:38:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-11-23 03:38:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 03:38:16,688 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:16,724 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:38:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:16,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:16,753 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 03:38:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 18 states and 24 transitions. [2018-11-23 03:38:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2018-11-23 03:38:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 03:38:16,760 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:16,761 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:38:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:16,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:16,848 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 03:38:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 20 states and 29 transitions. [2018-11-23 03:38:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2018-11-23 03:38:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:38:17,140 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:17,141 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:38:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:17,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:17,246 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 03:38:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 18 states and 23 transitions. [2018-11-23 03:38:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2018-11-23 03:38:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 03:38:19,547 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:19,547 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:38:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:19,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:19,579 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 03:38:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 18 states and 22 transitions. [2018-11-23 03:38:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 03:38:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:38:19,757 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:19,757 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:38:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:19,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:19,789 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 03:38:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 18 states and 20 transitions. [2018-11-23 03:38:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 03:38:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 03:38:19,793 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:38:19,794 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:38:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:38:19,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:38:19,904 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:38:19,905 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:38:19,906 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:38:19,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 113 [2018-11-23 03:38:19,921 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:38:19,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 110 treesize of output 86 [2018-11-23 03:38:19,935 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:38:19,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 48 [2018-11-23 03:38:19,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:38:19,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:38:19,997 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 43 treesize of output 33 [2018-11-23 03:38:19,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:38:20,015 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 03:38:20,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 03:38:20,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2018-11-23 03:38:20,377 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 03:38:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:38:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 10 states and 9 transitions. [2018-11-23 03:38:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2018-11-23 03:38:21,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 03:38:21,516 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 7 iterations. [2018-11-23 03:38:21,522 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 03:38:21,624 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-23 03:38:21,627 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 03:38:21,630 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 03:38:21,631 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 03:38:21,631 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-23 03:38:21,631 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 03:38:21,632 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 03:38:21,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 03:38:21 ImpRootNode [2018-11-23 03:38:21,632 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 03:38:21,632 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:38:21,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:38:21,633 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:38:21,633 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:38:16" (3/4) ... [2018-11-23 03:38:21,636 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 03:38:21,643 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-23 03:38:21,643 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 03:38:21,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-11-23 03:38:21,681 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1fa57220-9b60-4e46-81c9-e27706d28a2c/bin-2019/ukojak/witness.graphml [2018-11-23 03:38:21,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:38:21,682 INFO L168 Benchmark]: Toolchain (without parser) took 9204.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 949.7 MB in the beginning and 889.3 MB in the end (delta: 60.5 MB). Peak memory consumption was 207.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:21,683 INFO L168 Benchmark]: CDTParser took 0.16 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 03:38:21,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.24 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 932.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:21,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.21 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:38:21,684 INFO L168 Benchmark]: Boogie Preprocessor took 72.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:21,684 INFO L168 Benchmark]: RCFGBuilder took 3878.35 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:21,684 INFO L168 Benchmark]: CodeCheck took 4980.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 889.3 MB in the end (delta: 198.3 MB). Peak memory consumption was 198.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:38:21,685 INFO L168 Benchmark]: Witness Printer took 48.96 ms. Allocated memory is still 1.2 GB. Free memory is still 889.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:38:21,686 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, 34 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 7 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 856 SDtfs, 318 SDslu, 280 SDs, 0 SdLazy, 858 SolverSat, 260 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 497 GetRequests, 466 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 56 ConstructedInterpolants, 7 QuantifiedInterpolants, 4747 SizeOfPredicates, 23 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 95]: 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: 19]: Loop Invariant [2018-11-23 03:38:21,687 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 03:38:21,687 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-11-23 03:38:21,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 03:38:21,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 193.24 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 932.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.21 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -201.7 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3878.35 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: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * CodeCheck took 4980.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 889.3 MB in the end (delta: 198.3 MB). Peak memory consumption was 198.3 MB. Max. memory is 11.5 GB. * Witness Printer took 48.96 ms. Allocated memory is still 1.2 GB. Free memory is still 889.3 MB. 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...