./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1071_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_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/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 922786d1b563f399f230d6bc6e72c1342da4d1a5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/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 922786d1b563f399f230d6bc6e72c1342da4d1a5 ................................................................................................................................................................................................................................................................................................................ 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 14:22:36,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:22:36,855 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:22:36,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:22:36,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:22:36,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:22:36,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:22:36,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:22:36,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:22:36,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:22:36,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:22:36,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:22:36,868 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:22:36,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:22:36,870 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:22:36,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:22:36,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:22:36,872 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:22:36,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:22:36,875 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:22:36,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:22:36,876 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:22:36,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:22:36,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:22:36,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:22:36,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:22:36,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:22:36,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:22:36,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:22:36,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:22:36,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:22:36,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:22:36,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:22:36,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:22:36,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:22:36,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:22:36,885 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 14:22:36,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:22:36,895 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:22:36,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:22:36,896 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 14:22:36,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:22:36,897 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:22:36,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:22:36,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:22:36,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:22:36,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:22:36,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:22:36,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:22:36,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:22:36,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:22:36,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:22:36,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:22:36,898 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:22:36,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:22:36,898 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:22:36,898 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:22:36,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:22:36,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:22:36,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:22:36,899 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:22:36,899 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:22:36,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:22:36,899 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 14:22:36,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:22:36,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:22:36,899 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_45843714-a70a-4426-9297-a55fba3224be/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 -> 922786d1b563f399f230d6bc6e72c1342da4d1a5 [2018-11-23 14:22:36,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:22:36,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:22:36,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:22:36,932 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:22:36,933 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:22:36,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 14:22:36,970 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/b68e44762/042e64e405f34858a88da25349545d97/FLAGd84a38950 [2018-11-23 14:22:37,389 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:22:37,390 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 14:22:37,396 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/b68e44762/042e64e405f34858a88da25349545d97/FLAGd84a38950 [2018-11-23 14:22:37,407 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/b68e44762/042e64e405f34858a88da25349545d97 [2018-11-23 14:22:37,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:22:37,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:22:37,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:37,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:22:37,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:22:37,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5f2024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37, skipping insertion in model container [2018-11-23 14:22:37,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:22:37,436 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:22:37,558 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:37,561 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:22:37,581 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:37,596 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:22:37,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37 WrapperNode [2018-11-23 14:22:37,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:37,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:37,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:22:37,597 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:22:37,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:37,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:22:37,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:22:37,659 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:22:37,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:22:37,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:22:37,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:22:37,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:22:37,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/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 14:22:37,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 14:22:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:22:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 14:22:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:22:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:22:37,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:22:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:22:37,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:22:37,927 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:22:37,928 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-11-23 14:22:37,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:37 BoogieIcfgContainer [2018-11-23 14:22:37,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:22:37,928 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:22:37,928 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:22:37,939 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:22:37,940 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:37" (1/1) ... [2018-11-23 14:22:37,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:22:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-23 14:22:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-23 14:22:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:22:37,974 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:22:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:38,035 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 14:22:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:22:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 21 states and 30 transitions. [2018-11-23 14:22:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2018-11-23 14:22:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 14:22:38,042 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:22:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:22:38,157 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8);call trunc_double_#t~mem0 := read~int(trunc_double_~#ew_u~0.base, 4 + trunc_double_~#ew_u~0.offset, 4);trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8);havoc trunc_double_#t~union1;havoc trunc_double_#t~mem0;call trunc_double_#t~mem2 := read~int(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4);trunc_double_~lsw~0 := trunc_double_#t~mem2;call write~real(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8);havoc trunc_double_#t~mem2;havoc trunc_double_#t~union3;call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset);havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] goto; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=5853, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] assume !(trunc_double_~exponent_less_1023~0 < 20); VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=5853, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] assume trunc_double_~exponent_less_1023~0 > 51; VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=5853, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] assume 1024 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=5853, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0] [?] main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;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~ret11 := isnan_double_#res;assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [ULTIMATE.start_isnan_double_~x=4.0, ULTIMATE.start_main_~res~0=4.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=5853, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isnan_double_#in~x|=4.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_main_#t~ret11|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=4.0] [?] assume 0 == main_#t~ret11;havoc main_#t~ret11; VAL [ULTIMATE.start_isnan_double_~x=4.0, ULTIMATE.start_main_~res~0=4.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=5853, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isnan_double_#in~x|=4.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=4.0] [?] assume !false; VAL [ULTIMATE.start_isnan_double_~x=4.0, ULTIMATE.start_main_~res~0=4.0, ULTIMATE.start_main_~x~0=0.0, ULTIMATE.start_trunc_double_~exponent_less_1023~0=1024, ULTIMATE.start_trunc_double_~lsw~0=5, ULTIMATE.start_trunc_double_~msw~0=0, ULTIMATE.start_trunc_double_~signbit~0=5853, ULTIMATE.start_trunc_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_isnan_double_#in~x|=4.0, |ULTIMATE.start_isnan_double_#res|=0, |ULTIMATE.start_trunc_double_#in~x|=0.0, |ULTIMATE.start_trunc_double_#res|=4.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L70] trunc_double_#in~x := main_~x~0; [L70] havoc trunc_double_#res; [L70] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] call trunc_double_#t~mem0 := read~int(trunc_double_~#ew_u~0.base, 4 + trunc_double_~#ew_u~0.offset, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] havoc trunc_double_#t~union1; [L25] havoc trunc_double_#t~mem0; [L26] call trunc_double_#t~mem2 := read~int(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] call write~real(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset); [L23] havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L30-L58] assume !(trunc_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L47-L58] assume trunc_double_~exponent_less_1023~0 > 51; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L48-L50] assume 1024 == trunc_double_~exponent_less_1023~0; [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L70] main_#t~ret10 := trunc_double_#res; [L70] main_~res~0 := main_#t~ret10; [L70] havoc main_#t~ret10; [L73] isnan_double_#in~x := main_~res~0; [L73] havoc isnan_double_#res; [L73] 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); [L73] main_#t~ret11 := isnan_double_#res; [L73] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_#t~ret11=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L73-L76] assume 0 == main_#t~ret11; [L73] havoc main_#t~ret11; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L74] assert false; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L70] trunc_double_#in~x := main_~x~0; [L70] havoc trunc_double_#res; [L70] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] call trunc_double_#t~mem0 := read~int(trunc_double_~#ew_u~0.base, 4 + trunc_double_~#ew_u~0.offset, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L25] havoc trunc_double_#t~union1; [L25] havoc trunc_double_#t~mem0; [L26] call trunc_double_#t~mem2 := read~int(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] call write~real(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset); [L23] havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L30-L58] assume !(trunc_double_~exponent_less_1023~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L47-L58] assume trunc_double_~exponent_less_1023~0 > 51; VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L48-L50] assume 1024 == trunc_double_~exponent_less_1023~0; [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL.base=0, #NULL.offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L70] main_#t~ret10 := trunc_double_#res; [L70] main_~res~0 := main_#t~ret10; [L70] havoc main_#t~ret10; [L73] isnan_double_#in~x := main_~res~0; [L73] havoc isnan_double_#res; [L73] 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); [L73] main_#t~ret11 := isnan_double_#res; [L73] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_#t~ret11=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L73-L76] assume 0 == main_#t~ret11; [L73] havoc main_#t~ret11; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L74] assert false; VAL [#NULL.base=0, #NULL.offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L70] trunc_double_#in~x := main_~x~0; [L70] havoc trunc_double_#res; [L70] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0, trunc_double_#t~mem4, trunc_double_#t~union5, trunc_double_~#iw_u~0, trunc_double_#t~mem6, trunc_double_#t~union7, trunc_double_~#iw_u~1, trunc_double_#t~mem8, trunc_double_#t~union9, trunc_double_~#iw_u~2, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] FCALL call trunc_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(trunc_double_~x, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] FCALL call trunc_double_#t~mem0 := read~int({ base: trunc_double_~#ew_u~0!base, offset: 4 + trunc_double_~#ew_u~0!offset }, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(trunc_double_#t~union1, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] havoc trunc_double_#t~union1; [L25] havoc trunc_double_#t~mem0; [L26] FCALL call trunc_double_#t~mem2 := read~int({ base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] FCALL call write~real(trunc_double_#t~union3, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] FCALL call ULTIMATE.dealloc(trunc_double_~#ew_u~0); [L23] havoc trunc_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L30] COND FALSE !(trunc_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L47] COND TRUE trunc_double_~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L48] COND TRUE 1024 == trunc_double_~exponent_less_1023~0 [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L70] main_#t~ret10 := trunc_double_#res; [L70] main_~res~0 := main_#t~ret10; [L70] havoc main_#t~ret10; [L73] isnan_double_#in~x := main_~res~0; [L73] havoc isnan_double_#res; [L73] 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); [L73] main_#t~ret11 := isnan_double_#res; [L73] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_#t~ret11=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L73] COND TRUE 0 == main_#t~ret11 [L73] havoc main_#t~ret11; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0; [L68] main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L70] trunc_double_#in~x := main_~x~0; [L70] havoc trunc_double_#res; [L70] havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0, trunc_double_#t~mem4, trunc_double_#t~union5, trunc_double_~#iw_u~0, trunc_double_#t~mem6, trunc_double_#t~union7, trunc_double_~#iw_u~1, trunc_double_#t~mem8, trunc_double_#t~union9, trunc_double_~#iw_u~2, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0; [L17-L60] trunc_double_~x := trunc_double_#in~x; [L18] havoc trunc_double_~signbit~0; [L19] havoc trunc_double_~msw~0; [L20] havoc trunc_double_~lsw~0; [L21] havoc trunc_double_~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~x=0.0] [L23] FCALL call trunc_double_~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(trunc_double_~x, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] FCALL call trunc_double_#t~mem0 := read~int({ base: trunc_double_~#ew_u~0!base, offset: 4 + trunc_double_~#ew_u~0!offset }, 4); [L25] trunc_double_~msw~0 := (if trunc_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then trunc_double_#t~mem0 % 4294967296 % 4294967296 else trunc_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(trunc_double_#t~union1, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L25] havoc trunc_double_#t~union1; [L25] havoc trunc_double_#t~mem0; [L26] FCALL call trunc_double_#t~mem2 := read~int({ base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 4); [L26] trunc_double_~lsw~0 := trunc_double_#t~mem2; [L26] FCALL call write~real(trunc_double_#t~union3, { base: trunc_double_~#ew_u~0!base, offset: trunc_double_~#ew_u~0!offset }, 8); [L26] havoc trunc_double_#t~mem2; [L26] havoc trunc_double_#t~union3; [L23] FCALL call ULTIMATE.dealloc(trunc_double_~#ew_u~0); [L23] havoc trunc_double_~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~x=0.0] [L28] trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L30] COND FALSE !(trunc_double_~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L47] COND TRUE trunc_double_~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L48] COND TRUE 1024 == trunc_double_~exponent_less_1023~0 [L49] trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); VAL [#NULL!base=0, #NULL!offset=0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L70] main_#t~ret10 := trunc_double_#res; [L70] main_~res~0 := main_#t~ret10; [L70] havoc main_#t~ret10; [L73] isnan_double_#in~x := main_~res~0; [L73] havoc isnan_double_#res; [L73] 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); [L73] main_#t~ret11 := isnan_double_#res; [L73] assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_#t~ret11=0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L73] COND TRUE 0 == main_#t~ret11 [L73] havoc main_#t~ret11; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, isnan_double_#in~x=4.0, isnan_double_#res=0, isnan_double_~x=4.0, main_~res~0=4.0, main_~x~0=0.0, trunc_double_#in~x=0.0, trunc_double_#res=4.0, trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=5, trunc_double_~msw~0=0, trunc_double_~signbit~0=5853, trunc_double_~x=0.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0] [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] ~msw~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~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#NULL!base=0, #NULL!offset=0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L73] COND TRUE 0 == #t~ret11 [L73] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#NULL!base=0, #NULL!offset=0] [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] ~msw~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~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#NULL!base=0, #NULL!offset=0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#NULL!base=0, #NULL!offset=0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#NULL!base=0, #NULL!offset=0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#NULL!base=0, #NULL!offset=0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#NULL!base=0, #NULL!offset=0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L73] COND TRUE 0 == #t~ret11 [L73] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L68] double x = 0.0 / 0.0; [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L30] COND FALSE !(exponent_less_1023 < 20) [L47] COND TRUE exponent_less_1023 > 51 [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; [L70] double res = trunc_double(x); [L15] return x != x; [L73] COND TRUE !isnan_double(res) [L74] __VERIFIER_error() ----- [2018-11-23 14:22:38,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:22:38 ImpRootNode [2018-11-23 14:22:38,191 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 14:22:38,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:22:38,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:22:38,191 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:22:38,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:37" (3/4) ... [2018-11-23 14:22:38,195 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:22:38,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:22:38,196 INFO L168 Benchmark]: Toolchain (without parser) took 787.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -120.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:38,198 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:22:38,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.00 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 945.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:38,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:38,200 INFO L168 Benchmark]: Boogie Preprocessor took 19.55 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 14:22:38,200 INFO L168 Benchmark]: RCFGBuilder took 249.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:38,201 INFO L168 Benchmark]: CodeCheck took 262.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:38,202 INFO L168 Benchmark]: Witness Printer took 4.47 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 14:22:38,206 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, 24 locations, 1 error locations. UNSAFE Result, 0.2s 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, 58 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 74]: 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 49, overapproximation of bitwiseAnd at line 28. Possible FailurePath: [L68] double x = 0.0 / 0.0; [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 [L30] COND FALSE !(exponent_less_1023 < 20) [L47] COND TRUE exponent_less_1023 > 51 [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; [L70] double res = trunc_double(x); [L15] return x != x; [L73] COND TRUE !isnan_double(res) [L74] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.00 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 945.8 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 62.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.55 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 249.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * CodeCheck took 262.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.47 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 14:22:39,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:22:39,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:22:39,650 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:22:39,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:22:39,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:22:39,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:22:39,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:22:39,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:22:39,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:22:39,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:22:39,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:22:39,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:22:39,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:22:39,658 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:22:39,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:22:39,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:22:39,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:22:39,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:22:39,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:22:39,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:22:39,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:22:39,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:22:39,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:22:39,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:22:39,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:22:39,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:22:39,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:22:39,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:22:39,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:22:39,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:22:39,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:22:39,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:22:39,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:22:39,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:22:39,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:22:39,672 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 14:22:39,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:22:39,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:22:39,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:22:39,682 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 14:22:39,683 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:22:39,683 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:22:39,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:22:39,683 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:22:39,683 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:22:39,684 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:22:39,685 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:22:39,685 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:22:39,685 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:22:39,685 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:22:39,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:22:39,685 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:22:39,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:22:39,685 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:22:39,685 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:22:39,686 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:22:39,686 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 14:22:39,686 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 14:22:39,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:22:39,686 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:22:39,686 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:22:39,686 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_45843714-a70a-4426-9297-a55fba3224be/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 -> 922786d1b563f399f230d6bc6e72c1342da4d1a5 [2018-11-23 14:22:39,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:22:39,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:22:39,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:22:39,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:22:39,729 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:22:39,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 14:22:39,772 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/0197fe750/1d492d0dace448f396ac4a6d9060dba4/FLAG59593178a [2018-11-23 14:22:40,102 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:22:40,102 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 14:22:40,107 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/0197fe750/1d492d0dace448f396ac4a6d9060dba4/FLAG59593178a [2018-11-23 14:22:40,117 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/data/0197fe750/1d492d0dace448f396ac4a6d9060dba4 [2018-11-23 14:22:40,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:22:40,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:22:40,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:40,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:22:40,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:22:40,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2129d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40, skipping insertion in model container [2018-11-23 14:22:40,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:22:40,152 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:22:40,305 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:40,309 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:22:40,331 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:22:40,351 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:22:40,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40 WrapperNode [2018-11-23 14:22:40,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:22:40,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:40,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:22:40,352 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:22:40,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:22:40,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:22:40,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:22:40,384 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:22:40,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:22:40,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:22:40,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:22:40,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:22:40,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:22:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/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 14:22:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 14:22:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:22:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:22:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 14:22:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:22:40,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:22:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 14:22:40,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:22:40,619 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:22:40,748 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:22:40,749 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-11-23 14:22:40,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:40 BoogieIcfgContainer [2018-11-23 14:22:40,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:22:40,750 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:22:40,750 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:22:40,759 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:22:40,759 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:40" (1/1) ... [2018-11-23 14:22:40,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:22:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:22:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-23 14:22:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-23 14:22:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 14:22:40,792 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:22:40,832 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 14:22:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:40,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:22:40,865 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 14:22:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:22:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 21 states and 30 transitions. [2018-11-23 14:22:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2018-11-23 14:22:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 14:22:40,872 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:22:40,872 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 14:22:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:40,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:22:40,984 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 14:22:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:22:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 23 states and 33 transitions. [2018-11-23 14:22:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2018-11-23 14:22:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 14:22:45,183 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:22:45,183 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 14:22:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:45,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:22:45,213 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 14:22:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:22:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 24 states and 33 transitions. [2018-11-23 14:22:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2018-11-23 14:22:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 14:22:45,227 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:22:45,228 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 14:22:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:22:45,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:22:45,302 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:22:45,303 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:22:45,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 14:22:45,355 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:22:45,361 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 24 treesize of output 24 [2018-11-23 14:22:45,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:45,376 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 24 treesize of output 18 [2018-11-23 14:22:45,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 14:22:45,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:22:45,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:22:45,387 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 14:22:45,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:22:45,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:17 [2018-11-23 14:22:45,533 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 14:22:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:22:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 14:22:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 14:22:48,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 14:22:48,335 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 5 iterations. [2018-11-23 14:22:48,341 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 14:22:48,387 INFO L579 CodeCheckObserver]: Invariant with dag size 6 [2018-11-23 14:22:48,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,394 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,396 INFO L579 CodeCheckObserver]: Invariant with dag size 1 [2018-11-23 14:22:48,396 INFO L579 CodeCheckObserver]: Invariant with dag size 5 [2018-11-23 14:22:48,396 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:22:48 ImpRootNode [2018-11-23 14:22:48,397 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 14:22:48,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:22:48,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:22:48,398 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:22:48,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:22:40" (3/4) ... [2018-11-23 14:22:48,402 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 14:22:48,411 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 14:22:48,412 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 14:22:48,412 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 14:22:48,432 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2018-11-23 14:22:48,449 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_45843714-a70a-4426-9297-a55fba3224be/bin-2019/ukojak/witness.graphml [2018-11-23 14:22:48,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:22:48,449 INFO L168 Benchmark]: Toolchain (without parser) took 8329.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 950.8 MB in the beginning and 993.3 MB in the end (delta: -42.4 MB). Peak memory consumption was 93.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:48,450 INFO L168 Benchmark]: CDTParser took 0.17 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 14:22:48,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:48,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.25 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:22:48,451 INFO L168 Benchmark]: Boogie Preprocessor took 68.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:48,451 INFO L168 Benchmark]: RCFGBuilder took 296.74 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:48,451 INFO L168 Benchmark]: CodeCheck took 7647.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.5 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:48,452 INFO L168 Benchmark]: Witness Printer took 51.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:22:48,454 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, 24 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 96 SDslu, 104 SDs, 0 SdLazy, 178 SolverSat, 64 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 4 QuantifiedInterpolants, 2206 SizeOfPredicates, 21 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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: 74]: 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: 17]: Loop Invariant [2018-11-23 14:22:48,455 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,455 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,455 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,456 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,456 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,456 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-11-23 14:22:48,456 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:22:48,456 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.17 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 229.50 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.25 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 296.74 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * CodeCheck took 7647.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.5 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. * Witness Printer took 51.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.3 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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...