./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1052c_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1052c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93969ab48cbc6136b5ad0701aa11c46dc35b2390 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1052c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93969ab48cbc6136b5ad0701aa11c46dc35b2390 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 02:57:47,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:57:47,204 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:57:47,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:57:47,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:57:47,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:57:47,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:57:47,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:57:47,217 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:57:47,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:57:47,218 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:57:47,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:57:47,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:57:47,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:57:47,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:57:47,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:57:47,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:57:47,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:57:47,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:57:47,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:57:47,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:57:47,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:57:47,227 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:57:47,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:57:47,227 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:57:47,228 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:57:47,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:57:47,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:57:47,230 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:57:47,231 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:57:47,231 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:57:47,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:57:47,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:57:47,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:57:47,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:57:47,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:57:47,233 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:57:47,243 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:57:47,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:57:47,244 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:57:47,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:57:47,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:57:47,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:57:47,245 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:57:47,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:57:47,246 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:57:47,247 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:57:47,247 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:57:47,247 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:57:47,247 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:57:47,247 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:57:47,247 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:57:47,247 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:57:47,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:57:47,248 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:57:47,248 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:57:47,248 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:57:47,248 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:57:47,248 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:57:47,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:57:47,249 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_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer 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 -> Automizer 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 -> 93969ab48cbc6136b5ad0701aa11c46dc35b2390 [2018-11-23 02:57:47,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:57:47,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:57:47,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:57:47,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:57:47,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:57:47,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1052c_true-unreach-call.c [2018-11-23 02:57:47,332 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/abd4ec22d/dcf41b4435b745ac88d2454fbb03130e/FLAG63ce63ec3 [2018-11-23 02:57:47,743 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:57:47,744 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/sv-benchmarks/c/float-newlib/float_req_bl_1052c_true-unreach-call.c [2018-11-23 02:57:47,748 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/abd4ec22d/dcf41b4435b745ac88d2454fbb03130e/FLAG63ce63ec3 [2018-11-23 02:57:47,759 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/abd4ec22d/dcf41b4435b745ac88d2454fbb03130e [2018-11-23 02:57:47,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:57:47,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:57:47,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:57:47,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:57:47,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:57:47,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:47,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723e66a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47, skipping insertion in model container [2018-11-23 02:57:47,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:47,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:57:47,795 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:57:47,912 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:57:47,914 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:57:47,930 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:57:47,946 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:57:47,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47 WrapperNode [2018-11-23 02:57:47,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:57:47,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:57:47,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:57:47,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:57:47,952 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:57:47" (1/1) ... [2018-11-23 02:57:47,957 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:57:47" (1/1) ... [2018-11-23 02:57:47,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:57:47,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:57:47,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:57:47,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:57:48,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:48,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:48,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:48,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:48,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:48,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:48,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... [2018-11-23 02:57:48,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:57:48,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:57:48,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:57:48,021 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:57:48,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:57:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 02:57:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:57:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:57:48,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:57:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:57:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:57:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-11-23 02:57:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-11-23 02:57:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:57:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:57:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:57:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:57:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:57:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 02:57:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 02:57:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:57:48,231 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:57:48,231 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 02:57:48,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:48 BoogieIcfgContainer [2018-11-23 02:57:48,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:57:48,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:57:48,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:57:48,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:57:48,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:57:47" (1/3) ... [2018-11-23 02:57:48,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90ef2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:48, skipping insertion in model container [2018-11-23 02:57:48,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:47" (2/3) ... [2018-11-23 02:57:48,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90ef2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:48, skipping insertion in model container [2018-11-23 02:57:48,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:48" (3/3) ... [2018-11-23 02:57:48,237 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c_true-unreach-call.c [2018-11-23 02:57:48,242 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:57:48,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:57:48,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:57:48,278 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:57:48,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:57:48,279 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:57:48,279 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:57:48,279 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:57:48,279 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:57:48,279 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:57:48,279 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:57:48,279 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:57:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-23 02:57:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:57:48,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:48,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:48,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:48,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2053199230, now seen corresponding path program 1 times [2018-11-23 02:57:48,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:57:48,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:57:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:48,389 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 02:57:48,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:48,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:57:48,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:57:48,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:57:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:57:48,402 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-23 02:57:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:48,416 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-23 02:57:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:57:48,416 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 02:57:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:48,422 INFO L225 Difference]: With dead ends: 78 [2018-11-23 02:57:48,422 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:57:48,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:57:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:57:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 02:57:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 02:57:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 02:57:48,451 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2018-11-23 02:57:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:48,452 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 02:57:48,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:57:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 02:57:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:57:48,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:48,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:48,454 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:48,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2027240245, now seen corresponding path program 1 times [2018-11-23 02:57:48,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:57:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:57:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:57:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:57:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:57:48,535 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450951, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450947.0, ~huge_floor~0=6442450947.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_floor~0 := 1.0E30; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450947.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450945, |old(~huge_floor~0)|=6442450947.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] RET #114#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call #t~ret6 := floor_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~j0~0;havoc ~i~0;havoc ~ix~0; VAL [floor_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] goto; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647);~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !(~j0~0 < 23); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !(~ix~0 % 4294967296 < 2139095040);#res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume true; VAL [floor_float_~i0~0=(- 2147483648), floor_float_~ix~0=(- 18014398509481985), floor_float_~j0~0=2147483520, floor_float_~x=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_float_#in~x|=6442450952.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] RET #118#return; VAL [main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=6442450946.0, ~huge_floor~0=1000000000000000000000000000000.0] [?] ~res~0 := #t~ret6;havoc #t~ret6;#t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [main_~res~0=6442450946.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !#t~short8; VAL [main_~res~0=6442450946.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !#t~short8;havoc #t~ret7;havoc #t~short8; VAL [main_~res~0=6442450946.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=6442450946.0, main_~x~0=6442450952.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450951, #NULL.offset=6442450945, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=6.442450952E9] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L13-L54] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450952E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79-L82] assume !#t~short8; [L79] havoc #t~ret7; [L79] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450951, #NULL.offset=6442450945, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~x=6.442450952E9] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L13-L54] ensures true; VAL [#in~x=6.442450952E9, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450952E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79-L82] assume !#t~short8; [L79] havoc #t~ret7; [L79] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450952E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND TRUE !#t~short8 [L79] havoc #t~ret7; [L79] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450952E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND TRUE !#t~short8 [L79] havoc #t~ret7; [L79] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450952E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND TRUE !#t~short8 [L79] havoc #t~ret7; [L79] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450945, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=6.442450947E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_floor~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450945, old(~huge_floor~0)=6.442450947E9, ~huge_floor~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L75] ~x~0 := ~someUnaryFLOAToperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L76] CALL call #t~ret6 := floor_float(~x~0); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~x=6.442450952E9] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~x=6.442450952E9] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=6.442450952E9, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=6.442450952E9] [L76] RET call #t~ret6 := floor_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450946E9, ~huge_floor~0=1.0E30, ~x~0=6.442450952E9] [L76] ~res~0 := #t~ret6; [L76] havoc #t~ret6; [L79] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L79] COND TRUE !#t~short8 [L79] havoc #t~ret7; [L79] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E30, ~res~0=6.442450946E9, ~x~0=6.442450952E9] [L11] static const float huge_floor = 1.0e30; VAL [\old(huge_floor)=6442450947, huge_floor=1000000000000000000000000000000] [L75] float x = -0.0f; VAL [huge_floor=1000000000000000000000000000000] [L76] CALL, EXPR floor_float(x) VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, x=6442450952] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L76] RET, EXPR floor_float(x) VAL [floor_float(x)=6442450946, huge_floor=1000000000000000000000000000000, x=6442450952] [L76] float res = floor_float(x); [L79] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [huge_floor=1000000000000000000000000000000, res=6442450946, res == -0.0f && __signbit_float(res) == 1=0, x=6442450952] [L79] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L80] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000, res=6442450946, x=6442450952] ----- [2018-11-23 02:57:48,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:57:48 BoogieIcfgContainer [2018-11-23 02:57:48,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:57:48,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:57:48,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:57:48,578 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:57:48,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:48" (3/4) ... [2018-11-23 02:57:48,581 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:57:48,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:57:48,582 INFO L168 Benchmark]: Toolchain (without parser) took 820.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 958.5 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:48,583 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:57:48,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.41 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 945.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:48,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.66 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:57:48,584 INFO L168 Benchmark]: Boogie Preprocessor took 59.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -206.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:48,585 INFO L168 Benchmark]: RCFGBuilder took 210.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:48,586 INFO L168 Benchmark]: TraceAbstraction took 344.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:48,586 INFO L168 Benchmark]: Witness Printer took 3.72 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 02:57:48,589 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.41 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 945.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.66 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -206.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 344.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of bitwiseAnd at line 21, overapproximation of someUnaryFLOAToperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L11] static const float huge_floor = 1.0e30; VAL [\old(huge_floor)=6442450947, huge_floor=1000000000000000000000000000000] [L75] float x = -0.0f; VAL [huge_floor=1000000000000000000000000000000] [L76] CALL, EXPR floor_float(x) VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, x=6442450952] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=6442450952, huge_floor=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=6442450952] [L76] RET, EXPR floor_float(x) VAL [floor_float(x)=6442450946, huge_floor=1000000000000000000000000000000, x=6442450952] [L76] float res = floor_float(x); [L79] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [huge_floor=1000000000000000000000000000000, res=6442450946, res == -0.0f && __signbit_float(res) == 1=0, x=6442450952] [L79] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L80] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000, res=6442450946, x=6442450952] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:57:50,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:57:50,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:57:50,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:57:50,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:57:50,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:57:50,033 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:57:50,035 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:57:50,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:57:50,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:57:50,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:57:50,037 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:57:50,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:57:50,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:57:50,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:57:50,040 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:57:50,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:57:50,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:57:50,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:57:50,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:57:50,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:57:50,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:57:50,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:57:50,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:57:50,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:57:50,047 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:57:50,048 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:57:50,049 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:57:50,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:57:50,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:57:50,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:57:50,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:57:50,051 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:57:50,051 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:57:50,051 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:57:50,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:57:50,052 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 02:57:50,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:57:50,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:57:50,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:57:50,063 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:57:50,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:57:50,063 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:57:50,063 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:57:50,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:57:50,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:57:50,064 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:57:50,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:57:50,064 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:57:50,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:57:50,064 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:57:50,064 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:57:50,065 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:57:50,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:57:50,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:57:50,065 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:57:50,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:57:50,065 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:57:50,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:57:50,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:57:50,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:57:50,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:57:50,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:57:50,066 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:57:50,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:57:50,066 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 02:57:50,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:57:50,067 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:57:50,067 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:57:50,067 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_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer 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 -> Automizer 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 -> 93969ab48cbc6136b5ad0701aa11c46dc35b2390 [2018-11-23 02:57:50,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:57:50,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:57:50,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:57:50,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:57:50,110 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:57:50,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1052c_true-unreach-call.c [2018-11-23 02:57:50,151 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/8023d341a/32e5f7b0a3374b54b704e1c94fbe2e08/FLAGec6d9d0a5 [2018-11-23 02:57:50,476 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:57:50,477 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/sv-benchmarks/c/float-newlib/float_req_bl_1052c_true-unreach-call.c [2018-11-23 02:57:50,481 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/8023d341a/32e5f7b0a3374b54b704e1c94fbe2e08/FLAGec6d9d0a5 [2018-11-23 02:57:50,906 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/data/8023d341a/32e5f7b0a3374b54b704e1c94fbe2e08 [2018-11-23 02:57:50,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:57:50,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:57:50,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:57:50,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:57:50,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:57:50,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:50" (1/1) ... [2018-11-23 02:57:50,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12511f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:50, skipping insertion in model container [2018-11-23 02:57:50,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:50" (1/1) ... [2018-11-23 02:57:50,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:57:50,942 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:57:51,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:57:51,078 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:57:51,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:57:51,119 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:57:51,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51 WrapperNode [2018-11-23 02:57:51,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:57:51,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:57:51,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:57:51,120 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:57:51,126 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:57:51" (1/1) ... [2018-11-23 02:57:51,133 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:57:51" (1/1) ... [2018-11-23 02:57:51,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:57:51,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:57:51,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:57:51,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:57:51,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... [2018-11-23 02:57:51,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... [2018-11-23 02:57:51,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... [2018-11-23 02:57:51,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... [2018-11-23 02:57:51,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... [2018-11-23 02:57:51,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... [2018-11-23 02:57:51,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... [2018-11-23 02:57:51,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:57:51,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:57:51,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:57:51,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:57:51,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:57:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:57:51,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:57:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:57:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:57:51,241 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-11-23 02:57:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-11-23 02:57:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:57:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:57:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 02:57:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:57:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:57:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 02:57:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 02:57:51,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 02:57:51,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 02:57:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:57:51,667 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:57:51,667 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 02:57:51,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:51 BoogieIcfgContainer [2018-11-23 02:57:51,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:57:51,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:57:51,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:57:51,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:57:51,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:57:50" (1/3) ... [2018-11-23 02:57:51,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1da652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:51, skipping insertion in model container [2018-11-23 02:57:51,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:51" (2/3) ... [2018-11-23 02:57:51,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1da652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:51, skipping insertion in model container [2018-11-23 02:57:51,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:51" (3/3) ... [2018-11-23 02:57:51,673 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052c_true-unreach-call.c [2018-11-23 02:57:51,679 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:57:51,684 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:57:51,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:57:51,709 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:57:51,710 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:57:51,710 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:57:51,710 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:57:51,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:57:51,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:57:51,710 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:57:51,710 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:57:51,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:57:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-23 02:57:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:57:51,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:51,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:51,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:51,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2053199230, now seen corresponding path program 1 times [2018-11-23 02:57:51,731 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:51,732 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:51,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:51,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:51,796 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 02:57:51,797 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:51,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:51,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:57:51,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:57:51,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:57:51,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:57:51,817 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-23 02:57:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:51,831 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-23 02:57:51,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:57:51,832 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 02:57:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:51,839 INFO L225 Difference]: With dead ends: 78 [2018-11-23 02:57:51,839 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:57:51,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:57:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:57:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 02:57:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 02:57:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 02:57:51,865 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2018-11-23 02:57:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:51,866 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 02:57:51,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:57:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 02:57:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:57:51,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:51,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:51,867 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:51,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2027240245, now seen corresponding path program 1 times [2018-11-23 02:57:51,868 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:51,868 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:51,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:51,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:52,057 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 02:57:52,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:52,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:52,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:57:52,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:57:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:57:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:57:52,070 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. [2018-11-23 02:57:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:53,032 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-23 02:57:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:57:53,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 02:57:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:53,035 INFO L225 Difference]: With dead ends: 60 [2018-11-23 02:57:53,035 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 02:57:53,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:57:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 02:57:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 02:57:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 02:57:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 02:57:53,041 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-11-23 02:57:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:53,042 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 02:57:53,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:57:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 02:57:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:57:53,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:53,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:53,043 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:53,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:53,043 INFO L82 PathProgramCache]: Analyzing trace with hash -568234905, now seen corresponding path program 1 times [2018-11-23 02:57:53,043 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:53,043 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:53,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:53,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:53,132 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 02:57:53,132 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:53,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:53,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:57:53,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:57:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:57:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:57:53,140 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-11-23 02:57:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:53,861 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-23 02:57:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:57:53,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 02:57:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:53,863 INFO L225 Difference]: With dead ends: 67 [2018-11-23 02:57:53,863 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:57:53,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:57:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:57:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-23 02:57:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:57:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 02:57:53,868 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2018-11-23 02:57:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:53,868 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 02:57:53,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:57:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 02:57:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:57:53,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:53,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:53,869 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:53,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:53,869 INFO L82 PathProgramCache]: Analyzing trace with hash 13684055, now seen corresponding path program 1 times [2018-11-23 02:57:53,869 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:53,870 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:53,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:53,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:54,992 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 02:57:54,996 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 02:57:54,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:55,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:55,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:57:55,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:57:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:57:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:57:55,005 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2018-11-23 02:57:55,967 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 02:57:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:56,218 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 02:57:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:57:56,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 02:57:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:56,222 INFO L225 Difference]: With dead ends: 52 [2018-11-23 02:57:56,222 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 02:57:56,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:57:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 02:57:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 02:57:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:57:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 02:57:56,225 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2018-11-23 02:57:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:56,225 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 02:57:56,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:57:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 02:57:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:57:56,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:56,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:56,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:56,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2137668883, now seen corresponding path program 1 times [2018-11-23 02:57:56,227 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:56,227 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:56,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:56,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:56,307 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 02:57:56,308 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:56,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:56,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:57:56,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:57:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:57:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:57:56,317 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 6 states. [2018-11-23 02:57:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:56,539 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 02:57:56,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:57:56,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 02:57:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:56,540 INFO L225 Difference]: With dead ends: 57 [2018-11-23 02:57:56,541 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:57:56,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:57:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:57:56,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-23 02:57:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:57:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-23 02:57:56,544 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 24 [2018-11-23 02:57:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:56,544 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-23 02:57:56,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:57:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 02:57:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:57:56,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:56,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:56,545 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:56,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:56,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1389654977, now seen corresponding path program 1 times [2018-11-23 02:57:56,545 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:56,545 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:56,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:56,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:56,662 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 02:57:56,662 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:56,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:56,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 02:57:56,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:57:56,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:57:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:57:56,670 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2018-11-23 02:57:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:56,944 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 02:57:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:57:56,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 02:57:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:56,945 INFO L225 Difference]: With dead ends: 52 [2018-11-23 02:57:56,945 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 02:57:56,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:57:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 02:57:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 02:57:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:57:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 02:57:56,948 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-11-23 02:57:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:56,949 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 02:57:56,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:57:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 02:57:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:57:56,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:56,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:56,949 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:56,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:56,950 INFO L82 PathProgramCache]: Analyzing trace with hash 996627967, now seen corresponding path program 1 times [2018-11-23 02:57:56,950 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:56,950 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:56,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:57,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:57,058 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 02:57:57,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:57,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:57,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:57:57,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:57:57,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:57:57,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:57:57,066 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 8 states. [2018-11-23 02:57:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:57,269 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2018-11-23 02:57:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:57:57,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 02:57:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:57,270 INFO L225 Difference]: With dead ends: 37 [2018-11-23 02:57:57,271 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 02:57:57,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:57:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 02:57:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 02:57:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:57:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2018-11-23 02:57:57,275 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 25 [2018-11-23 02:57:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:57,275 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2018-11-23 02:57:57,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:57:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2018-11-23 02:57:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 02:57:57,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:57:57,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:57:57,277 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:57:57,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:57:57,277 INFO L82 PathProgramCache]: Analyzing trace with hash 691655434, now seen corresponding path program 1 times [2018-11-23 02:57:57,277 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:57:57,277 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 02:57:57,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:57:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:57:57,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:57:57,477 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 02:57:57,477 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:57:57,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:57:57,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 02:57:57,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:57:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:57:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:57:57,485 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand 13 states. [2018-11-23 02:57:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:57:57,969 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2018-11-23 02:57:57,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:57:57,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 02:57:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:57:57,970 INFO L225 Difference]: With dead ends: 34 [2018-11-23 02:57:57,970 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:57:57,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:57:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:57:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:57:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:57:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:57:57,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-23 02:57:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:57:57,971 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:57:57,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:57:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:57:57,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:57:57,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:57:58,116 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 47) no Hoare annotation was computed. [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 52) no Hoare annotation was computed. [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 13 54) no Hoare annotation was computed. [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point L48-2(lines 48 52) no Hoare annotation was computed. [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-23 02:57:58,116 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 41) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 20) the Hoare annotation is: (or (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0)) (= |floor_float_#in~x| floor_float_~x)) [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 38) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point floor_floatEXIT(lines 13 54) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 35) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point floor_floatFINAL(lines 13 54) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L451 ceAbstractionStarter]: At program point floor_floatENTRY(lines 13 54) the Hoare annotation is: true [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 46) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:57:58,117 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0) [2018-11-23 02:57:58,117 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 68 85) the Hoare annotation is: true [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 68 85) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L444 ceAbstractionStarter]: At program point L79-1(line 79) the Hoare annotation is: (or (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and |main_#t~short8| (= main_~res~0 .cse0) (= main_~x~0 .cse0))) (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0))) [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point L79-2(line 79) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 68 85) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L444 ceAbstractionStarter]: At program point L76(line 76) the Hoare annotation is: (or (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0)) (= main_~x~0 (fp.neg (_ +zero 8 24)))) [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point L76-1(line 76) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point L79-4(lines 79 82) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 59 63) the Hoare annotation is: (or (= |__signbit_float_#in~x| __signbit_float_~x) (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_floor~0))) [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point L59-3(lines 59 63) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L448 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 56 66) no Hoare annotation was computed. [2018-11-23 02:57:58,118 INFO L451 ceAbstractionStarter]: At program point __signbit_floatENTRY(lines 56 66) the Hoare annotation is: true [2018-11-23 02:57:58,119 INFO L448 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 56 66) no Hoare annotation was computed. [2018-11-23 02:57:58,124 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,125 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:57:58 BoogieIcfgContainer [2018-11-23 02:57:58,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:57:58,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:57:58,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:57:58,130 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:57:58,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:51" (3/4) ... [2018-11-23 02:57:58,133 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:57:58,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:57:58,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure floor_float [2018-11-23 02:57:58,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:57:58,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-11-23 02:57:58,141 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-23 02:57:58,141 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 02:57:58,142 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 02:57:58,158 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) || \old(x) == x [2018-11-23 02:57:58,159 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) [2018-11-23 02:57:58,179 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0fa6b400-6747-4d51-9661-0ce9c286dc64/bin-2019/uautomizer/witness.graphml [2018-11-23 02:57:58,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:57:58,180 INFO L168 Benchmark]: Toolchain (without parser) took 7270.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 949.2 MB in the beginning and 1.2 GB in the end (delta: -206.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:57:58,180 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:57:58,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.17 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:58,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.22 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:57:58,181 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:57:58,182 INFO L168 Benchmark]: RCFGBuilder took 503.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:58,182 INFO L168 Benchmark]: TraceAbstraction took 6461.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.5 MB). Peak memory consumption was 308.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:58,182 INFO L168 Benchmark]: Witness Printer took 48.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:57:58,184 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 209.17 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 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 17.22 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 503.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -143.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6461.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.5 MB). Peak memory consumption was 308.7 MB. Max. memory is 11.5 GB. * Witness Printer took 48.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: 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: 59]: Loop Invariant [2018-11-23 02:57:58,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \old(x) == x || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) - InvariantResult [Line: 16]: Loop Invariant [2018-11-23 02:57:58,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,188 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 02:57:58,188 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_floor) || \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. SAFE Result, 6.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 279 SDslu, 775 SDs, 0 SdLazy, 444 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 22 PreInvPairs, 25 NumberOfFragments, 68 HoareAnnotationTreeSize, 22 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 179 ConstructedInterpolants, 26 QuantifiedInterpolants, 27208 SizeOfPredicates, 32 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...