java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0250a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 15:56:04,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 15:56:04,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 15:56:04,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 15:56:04,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 15:56:04,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 15:56:04,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 15:56:04,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 15:56:04,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 15:56:04,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 15:56:04,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 15:56:04,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 15:56:04,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 15:56:04,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 15:56:04,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 15:56:04,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 15:56:04,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 15:56:04,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 15:56:04,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 15:56:04,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 15:56:04,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 15:56:04,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 15:56:04,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 15:56:04,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 15:56:04,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 15:56:04,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 15:56:04,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 15:56:04,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 15:56:04,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 15:56:04,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 15:56:04,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 15:56:04,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 15:56:04,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 15:56:04,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 15:56:04,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 15:56:04,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 15:56:04,193 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 15:56:04,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 15:56:04,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 15:56:04,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 15:56:04,216 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 15:56:04,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 15:56:04,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 15:56:04,217 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 15:56:04,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 15:56:04,218 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 15:56:04,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 15:56:04,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 15:56:04,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 15:56:04,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 15:56:04,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 15:56:04,219 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 15:56:04,219 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 15:56:04,219 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 15:56:04,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 15:56:04,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 15:56:04,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 15:56:04,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 15:56:04,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 15:56:04,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 15:56:04,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 15:56:04,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 15:56:04,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 15:56:04,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 15:56:04,221 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 15:56:04,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 15:56:04,222 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 15:56:04,222 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 15:56:04,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 15:56:04,270 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 15:56:04,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 15:56:04,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 15:56:04,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 15:56:04,296 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 15:56:04,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0250a_true-unreach-call.c [2018-09-19 15:56:04,635 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f521cc1/19256111cc524717bc1687e428b83aed/FLAG028e54e7b [2018-09-19 15:56:04,866 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 15:56:04,868 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0250a_true-unreach-call.c [2018-09-19 15:56:04,881 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f521cc1/19256111cc524717bc1687e428b83aed/FLAG028e54e7b [2018-09-19 15:56:04,896 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22f521cc1/19256111cc524717bc1687e428b83aed [2018-09-19 15:56:04,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 15:56:04,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 15:56:04,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 15:56:04,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 15:56:04,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 15:56:04,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:56:04" (1/1) ... [2018-09-19 15:56:04,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc8c78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:04, skipping insertion in model container [2018-09-19 15:56:04,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 03:56:04" (1/1) ... [2018-09-19 15:56:04,937 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 15:56:05,264 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:56:05,285 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 15:56:05,351 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 15:56:05,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05 WrapperNode [2018-09-19 15:56:05,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 15:56:05,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 15:56:05,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 15:56:05,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 15:56:05,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... [2018-09-19 15:56:05,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... [2018-09-19 15:56:05,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... [2018-09-19 15:56:05,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... [2018-09-19 15:56:05,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... [2018-09-19 15:56:05,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... [2018-09-19 15:56:05,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... [2018-09-19 15:56:05,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 15:56:05,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 15:56:05,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 15:56:05,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 15:56:05,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-19 15:56:05,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 15:56:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 15:56:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 15:56:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-19 15:56:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-19 15:56:05,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_asin [2018-09-19 15:56:05,666 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 15:56:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 15:56:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 15:56:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-19 15:56:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 15:56:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 15:56:05,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 15:56:05,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 15:56:05,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 15:56:05,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 15:56:05,667 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-19 15:56:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_asin [2018-09-19 15:56:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 15:56:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 15:56:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 15:56:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 15:56:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 15:56:06,112 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:06,149 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:06,174 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:09,876 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:09,892 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:09,924 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:10,019 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:10,033 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:10,057 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:10,067 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:23,008 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 15:56:25,990 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 15:56:25,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:56:25 BoogieIcfgContainer [2018-09-19 15:56:25,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 15:56:25,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 15:56:25,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 15:56:25,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 15:56:25,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 03:56:04" (1/3) ... [2018-09-19 15:56:25,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3beaac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:56:25, skipping insertion in model container [2018-09-19 15:56:25,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 03:56:05" (2/3) ... [2018-09-19 15:56:25,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3beaac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 03:56:25, skipping insertion in model container [2018-09-19 15:56:25,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 03:56:25" (3/3) ... [2018-09-19 15:56:26,001 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0250a_true-unreach-call.c [2018-09-19 15:56:26,012 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 15:56:26,022 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 15:56:26,079 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 15:56:26,080 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 15:56:26,080 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 15:56:26,080 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 15:56:26,081 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 15:56:26,081 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 15:56:26,081 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 15:56:26,081 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 15:56:26,081 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 15:56:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2018-09-19 15:56:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-19 15:56:26,116 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:56:26,117 INFO L376 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] [2018-09-19 15:56:26,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:56:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1379795380, now seen corresponding path program 1 times [2018-09-19 15:56:26,132 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:56:26,133 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-19 15:56:26,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:56:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:56:26,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:56:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:56:26,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:56:26,885 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:56:26,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 15:56:26,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 15:56:26,904 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 15:56:26,905 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 15:56:26,908 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 2 states. [2018-09-19 15:56:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:56:26,957 INFO L93 Difference]: Finished difference Result 314 states and 406 transitions. [2018-09-19 15:56:26,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 15:56:26,959 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-09-19 15:56:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:56:26,974 INFO L225 Difference]: With dead ends: 314 [2018-09-19 15:56:26,975 INFO L226 Difference]: Without dead ends: 157 [2018-09-19 15:56:26,981 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-09-19 15:56:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-19 15:56:27,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-19 15:56:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-19 15:56:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2018-09-19 15:56:27,044 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 22 [2018-09-19 15:56:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:56:27,045 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2018-09-19 15:56:27,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 15:56:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2018-09-19 15:56:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-19 15:56:27,047 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:56:27,047 INFO L376 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] [2018-09-19 15:56:27,048 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:56:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1905554338, now seen corresponding path program 1 times [2018-09-19 15:56:27,049 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:56:27,049 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-19 15:56:27,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:56:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:56:31,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:56:31,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 15:56:31,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 15:56:31,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:56:31,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:56:31,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:56:31,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 15:56:31,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 15:56:31,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 15:56:31,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:56:31,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:56:32,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:56:32,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 15:56:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:56:32,541 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:56:32,637 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:56:32,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:56:32,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:56:32,641 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:56:32,641 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 15:56:32,641 INFO L87 Difference]: Start difference. First operand 157 states and 183 transitions. Second operand 9 states. [2018-09-19 15:56:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:56:50,029 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2018-09-19 15:56:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:56:50,031 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-09-19 15:56:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:56:50,036 INFO L225 Difference]: With dead ends: 172 [2018-09-19 15:56:50,036 INFO L226 Difference]: Without dead ends: 146 [2018-09-19 15:56:50,041 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 15:56:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-19 15:56:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-09-19 15:56:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-19 15:56:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2018-09-19 15:56:50,061 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 31 [2018-09-19 15:56:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:56:50,062 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2018-09-19 15:56:50,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:56:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-09-19 15:56:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-19 15:56:50,064 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:56:50,064 INFO L376 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:56:50,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:56:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash 368156201, now seen corresponding path program 1 times [2018-09-19 15:56:50,065 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:56:50,066 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-19 15:56:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:56:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:56:50,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:56:50,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 15:56:50,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 15:56:50,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:56:50,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:56:50,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:56:50,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 15:56:50,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 15:56:51,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 15:56:51,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:56:51,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:56:51,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:56:51,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 15:56:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:56:51,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:56:51,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:56:51,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:56:51,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:56:51,390 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:56:51,390 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 15:56:51,390 INFO L87 Difference]: Start difference. First operand 144 states and 167 transitions. Second operand 9 states. [2018-09-19 15:57:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:57:03,770 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2018-09-19 15:57:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 15:57:03,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-09-19 15:57:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:57:03,776 INFO L225 Difference]: With dead ends: 156 [2018-09-19 15:57:03,776 INFO L226 Difference]: Without dead ends: 146 [2018-09-19 15:57:03,777 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-19 15:57:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-19 15:57:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-09-19 15:57:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-19 15:57:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 166 transitions. [2018-09-19 15:57:03,795 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 166 transitions. Word has length 40 [2018-09-19 15:57:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:57:03,795 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 166 transitions. [2018-09-19 15:57:03,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:57:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 166 transitions. [2018-09-19 15:57:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-19 15:57:03,797 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:57:03,797 INFO L376 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:57:03,798 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:57:03,798 INFO L82 PathProgramCache]: Analyzing trace with hash 171642696, now seen corresponding path program 1 times [2018-09-19 15:57:03,799 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:57:03,799 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-19 15:57:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:57:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:57:04,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:57:07,188 WARN L797 $PredicateComparison]: unable to prove that (= (let ((.cse0 (fp.sub RNE |c___ieee754_asin_#in~x| |c___ieee754_asin_#in~x|))) (fp.div RNE .cse0 .cse0)) |c___ieee754_asin_#res|) is different from false [2018-09-19 15:57:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:57:09,140 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:57:09,158 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:57:09,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:57:09,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:57:09,159 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:57:09,160 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2018-09-19 15:57:09,160 INFO L87 Difference]: Start difference. First operand 144 states and 166 transitions. Second operand 9 states. [2018-09-19 15:57:36,029 WARN L178 SmtUtils]: Spent 9.40 s on a formula simplification that was a NOOP. DAG size: 9 [2018-09-19 15:57:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:57:40,733 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2018-09-19 15:57:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 15:57:40,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-09-19 15:57:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:57:40,736 INFO L225 Difference]: With dead ends: 151 [2018-09-19 15:57:40,736 INFO L226 Difference]: Without dead ends: 133 [2018-09-19 15:57:40,737 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=32, Invalid=101, Unknown=3, NotChecked=20, Total=156 [2018-09-19 15:57:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-19 15:57:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-19 15:57:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-19 15:57:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2018-09-19 15:57:40,755 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 40 [2018-09-19 15:57:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:57:40,756 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-09-19 15:57:40,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:57:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2018-09-19 15:57:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-19 15:57:40,759 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 15:57:40,759 INFO L376 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 15:57:40,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 15:57:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash -698539822, now seen corresponding path program 1 times [2018-09-19 15:57:40,760 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 15:57:40,761 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-19 15:57:40,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 15:57:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 15:57:45,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 15:57:45,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 15:57:45,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 15:57:45,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:57:45,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:57:45,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:57:45,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 15:57:45,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 15:57:45,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 15:57:45,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 15:57:45,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 15:57:45,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 15:57:45,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 15:57:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 15:57:46,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 15:57:46,497 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 15:57:46,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 15:57:46,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 15:57:46,499 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 15:57:46,499 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 15:57:46,499 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 9 states. [2018-09-19 15:57:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 15:57:52,336 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-09-19 15:57:52,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 15:57:52,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-09-19 15:57:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 15:57:52,342 INFO L225 Difference]: With dead ends: 133 [2018-09-19 15:57:52,342 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 15:57:52,343 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 15:57:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 15:57:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 15:57:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 15:57:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 15:57:52,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-09-19 15:57:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 15:57:52,345 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 15:57:52,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 15:57:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 15:57:52,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 15:57:52,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 15:57:52,628 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-09-19 15:57:52,944 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2018-09-19 15:57:53,036 INFO L429 ceAbstractionStarter]: At program point __ieee754_sqrtENTRY(lines 21 129) the Hoare annotation is: true [2018-09-19 15:57:53,036 INFO L426 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-09-19 15:57:53,036 INFO L426 ceAbstractionStarter]: For program point L126-1(line 126) no Hoare annotation was computed. [2018-09-19 15:57:53,037 INFO L426 ceAbstractionStarter]: For program point L60(lines 60 63) no Hoare annotation was computed. [2018-09-19 15:57:53,037 INFO L426 ceAbstractionStarter]: For program point L126-2(line 126) no Hoare annotation was computed. [2018-09-19 15:57:53,037 INFO L426 ceAbstractionStarter]: For program point L126-3(line 126) no Hoare annotation was computed. [2018-09-19 15:57:53,037 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 27 32) no Hoare annotation was computed. [2018-09-19 15:57:53,037 INFO L426 ceAbstractionStarter]: For program point L60-2(lines 60 63) no Hoare annotation was computed. [2018-09-19 15:57:53,037 INFO L429 ceAbstractionStarter]: At program point L27-3(lines 27 32) the Hoare annotation is: true [2018-09-19 15:57:53,038 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtFINAL(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:57:53,038 INFO L426 ceAbstractionStarter]: For program point L27-4(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:57:53,038 INFO L426 ceAbstractionStarter]: For program point L52-1(lines 52 53) no Hoare annotation was computed. [2018-09-19 15:57:53,038 INFO L426 ceAbstractionStarter]: For program point L52-3(lines 52 53) no Hoare annotation was computed. [2018-09-19 15:57:53,038 INFO L429 ceAbstractionStarter]: At program point L52-4(lines 52 53) the Hoare annotation is: true [2018-09-19 15:57:53,044 INFO L426 ceAbstractionStarter]: For program point L52-5(lines 52 53) no Hoare annotation was computed. [2018-09-19 15:57:53,044 INFO L426 ceAbstractionStarter]: For program point L110(lines 110 111) no Hoare annotation was computed. [2018-09-19 15:57:53,044 INFO L426 ceAbstractionStarter]: For program point L110-2(lines 110 111) no Hoare annotation was computed. [2018-09-19 15:57:53,044 INFO L426 ceAbstractionStarter]: For program point L102(lines 102 116) no Hoare annotation was computed. [2018-09-19 15:57:53,044 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-19 15:57:53,045 INFO L426 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-09-19 15:57:53,045 INFO L426 ceAbstractionStarter]: For program point L28-2(line 28) no Hoare annotation was computed. [2018-09-19 15:57:53,045 INFO L426 ceAbstractionStarter]: For program point L28-3(line 28) no Hoare annotation was computed. [2018-09-19 15:57:53,045 INFO L426 ceAbstractionStarter]: For program point L119(lines 119 120) no Hoare annotation was computed. [2018-09-19 15:57:53,045 INFO L426 ceAbstractionStarter]: For program point L119-2(lines 119 120) no Hoare annotation was computed. [2018-09-19 15:57:53,045 INFO L426 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-09-19 15:57:53,045 INFO L426 ceAbstractionStarter]: For program point L87(lines 87 96) no Hoare annotation was computed. [2018-09-19 15:57:53,046 INFO L426 ceAbstractionStarter]: For program point L87-2(lines 87 96) no Hoare annotation was computed. [2018-09-19 15:57:53,046 INFO L426 ceAbstractionStarter]: For program point L46(lines 46 57) no Hoare annotation was computed. [2018-09-19 15:57:53,046 INFO L426 ceAbstractionStarter]: For program point L46-2(lines 46 57) no Hoare annotation was computed. [2018-09-19 15:57:53,046 INFO L426 ceAbstractionStarter]: For program point L104(lines 104 115) no Hoare annotation was computed. [2018-09-19 15:57:53,046 INFO L426 ceAbstractionStarter]: For program point L38(lines 38 43) no Hoare annotation was computed. [2018-09-19 15:57:53,046 INFO L426 ceAbstractionStarter]: For program point L71-1(lines 71 81) no Hoare annotation was computed. [2018-09-19 15:57:53,047 INFO L426 ceAbstractionStarter]: For program point L38-2(lines 38 43) no Hoare annotation was computed. [2018-09-19 15:57:53,047 INFO L429 ceAbstractionStarter]: At program point L71-3(lines 71 81) the Hoare annotation is: true [2018-09-19 15:57:53,047 INFO L426 ceAbstractionStarter]: For program point L71-4(lines 71 81) no Hoare annotation was computed. [2018-09-19 15:57:53,047 INFO L426 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-09-19 15:57:53,047 INFO L426 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-09-19 15:57:53,047 INFO L426 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. [2018-09-19 15:57:53,048 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 47 51) no Hoare annotation was computed. [2018-09-19 15:57:53,048 INFO L429 ceAbstractionStarter]: At program point L47-3(lines 47 51) the Hoare annotation is: true [2018-09-19 15:57:53,048 INFO L426 ceAbstractionStarter]: For program point L47-4(lines 47 51) no Hoare annotation was computed. [2018-09-19 15:57:53,048 INFO L426 ceAbstractionStarter]: For program point L39(lines 39 42) no Hoare annotation was computed. [2018-09-19 15:57:53,048 INFO L426 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-09-19 15:57:53,048 INFO L426 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2018-09-19 15:57:53,048 INFO L426 ceAbstractionStarter]: For program point L31-2(line 31) no Hoare annotation was computed. [2018-09-19 15:57:53,048 INFO L426 ceAbstractionStarter]: For program point L31-3(line 31) no Hoare annotation was computed. [2018-09-19 15:57:53,051 INFO L426 ceAbstractionStarter]: For program point L89(lines 89 90) no Hoare annotation was computed. [2018-09-19 15:57:53,051 INFO L426 ceAbstractionStarter]: For program point L122-1(lines 122 127) no Hoare annotation was computed. [2018-09-19 15:57:53,051 INFO L426 ceAbstractionStarter]: For program point L89-2(lines 89 90) no Hoare annotation was computed. [2018-09-19 15:57:53,051 INFO L429 ceAbstractionStarter]: At program point L122-3(lines 122 127) the Hoare annotation is: true [2018-09-19 15:57:53,051 INFO L426 ceAbstractionStarter]: For program point L122-4(lines 122 127) no Hoare annotation was computed. [2018-09-19 15:57:53,051 INFO L426 ceAbstractionStarter]: For program point L106(lines 106 114) no Hoare annotation was computed. [2018-09-19 15:57:53,052 INFO L426 ceAbstractionStarter]: For program point L73(lines 73 77) no Hoare annotation was computed. [2018-09-19 15:57:53,052 INFO L426 ceAbstractionStarter]: For program point L73-2(lines 73 77) no Hoare annotation was computed. [2018-09-19 15:57:53,052 INFO L426 ceAbstractionStarter]: For program point __ieee754_sqrtEXIT(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:57:53,052 INFO L426 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-09-19 15:57:53,052 INFO L426 ceAbstractionStarter]: For program point L123-1(line 123) no Hoare annotation was computed. [2018-09-19 15:57:53,052 INFO L426 ceAbstractionStarter]: For program point L123-2(line 123) no Hoare annotation was computed. [2018-09-19 15:57:53,053 INFO L426 ceAbstractionStarter]: For program point L123-3(line 123) no Hoare annotation was computed. [2018-09-19 15:57:53,053 INFO L426 ceAbstractionStarter]: For program point L41(lines 41 42) no Hoare annotation was computed. [2018-09-19 15:57:53,053 INFO L426 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-09-19 15:57:53,053 INFO L426 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-09-19 15:57:53,053 INFO L426 ceAbstractionStarter]: For program point L92(lines 92 93) no Hoare annotation was computed. [2018-09-19 15:57:53,056 INFO L426 ceAbstractionStarter]: For program point L92-2(lines 92 93) no Hoare annotation was computed. [2018-09-19 15:57:53,056 INFO L426 ceAbstractionStarter]: For program point L84-1(lines 84 100) no Hoare annotation was computed. [2018-09-19 15:57:53,056 INFO L429 ceAbstractionStarter]: At program point L84-3(lines 84 100) the Hoare annotation is: true [2018-09-19 15:57:53,056 INFO L426 ceAbstractionStarter]: For program point L84-4(lines 21 129) no Hoare annotation was computed. [2018-09-19 15:57:53,057 INFO L426 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-09-19 15:57:53,057 INFO L429 ceAbstractionStarter]: At program point L132-3(lines 132 136) the Hoare annotation is: true [2018-09-19 15:57:53,057 INFO L426 ceAbstractionStarter]: For program point fabs_doubleEXIT(lines 130 144) no Hoare annotation was computed. [2018-09-19 15:57:53,057 INFO L426 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-09-19 15:57:53,057 INFO L426 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-09-19 15:57:53,057 INFO L426 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-09-19 15:57:53,057 INFO L426 ceAbstractionStarter]: For program point L141-2(line 141) no Hoare annotation was computed. [2018-09-19 15:57:53,058 INFO L426 ceAbstractionStarter]: For program point L141-3(line 141) no Hoare annotation was computed. [2018-09-19 15:57:53,058 INFO L426 ceAbstractionStarter]: For program point L137(lines 137 142) no Hoare annotation was computed. [2018-09-19 15:57:53,058 INFO L426 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-09-19 15:57:53,058 INFO L426 ceAbstractionStarter]: For program point L137-2(lines 130 144) no Hoare annotation was computed. [2018-09-19 15:57:53,058 INFO L426 ceAbstractionStarter]: For program point L135-1(line 135) no Hoare annotation was computed. [2018-09-19 15:57:53,058 INFO L426 ceAbstractionStarter]: For program point L137-3(lines 137 142) no Hoare annotation was computed. [2018-09-19 15:57:53,058 INFO L426 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-09-19 15:57:53,059 INFO L426 ceAbstractionStarter]: For program point L135-2(line 135) no Hoare annotation was computed. [2018-09-19 15:57:53,059 INFO L426 ceAbstractionStarter]: For program point L133-1(line 133) no Hoare annotation was computed. [2018-09-19 15:57:53,059 INFO L426 ceAbstractionStarter]: For program point L133-2(line 133) no Hoare annotation was computed. [2018-09-19 15:57:53,059 INFO L426 ceAbstractionStarter]: For program point L133-3(line 133) no Hoare annotation was computed. [2018-09-19 15:57:53,059 INFO L429 ceAbstractionStarter]: At program point fabs_doubleENTRY(lines 130 144) the Hoare annotation is: true [2018-09-19 15:57:53,060 INFO L426 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-09-19 15:57:53,060 INFO L426 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-09-19 15:57:53,060 INFO L426 ceAbstractionStarter]: For program point L138-1(line 138) no Hoare annotation was computed. [2018-09-19 15:57:53,060 INFO L426 ceAbstractionStarter]: For program point L138-2(line 138) no Hoare annotation was computed. [2018-09-19 15:57:53,060 INFO L426 ceAbstractionStarter]: For program point L138-3(line 138) no Hoare annotation was computed. [2018-09-19 15:57:53,060 INFO L426 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-09-19 15:57:53,061 INFO L426 ceAbstractionStarter]: For program point fabs_doubleFINAL(lines 130 144) no Hoare annotation was computed. [2018-09-19 15:57:53,061 INFO L426 ceAbstractionStarter]: For program point L132-1(lines 132 136) no Hoare annotation was computed. [2018-09-19 15:57:53,061 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 17) the Hoare annotation is: true [2018-09-19 15:57:53,062 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 17) no Hoare annotation was computed. [2018-09-19 15:57:53,062 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 17) no Hoare annotation was computed. [2018-09-19 15:57:53,062 INFO L426 ceAbstractionStarter]: For program point L217(line 217) no Hoare annotation was computed. [2018-09-19 15:57:53,062 INFO L426 ceAbstractionStarter]: For program point L184(lines 184 185) no Hoare annotation was computed. [2018-09-19 15:57:53,062 INFO L426 ceAbstractionStarter]: For program point L217-1(line 217) no Hoare annotation was computed. [2018-09-19 15:57:53,062 INFO L426 ceAbstractionStarter]: For program point L217-2(line 217) no Hoare annotation was computed. [2018-09-19 15:57:53,062 INFO L426 ceAbstractionStarter]: For program point L217-3(line 217) no Hoare annotation was computed. [2018-09-19 15:57:53,063 INFO L426 ceAbstractionStarter]: For program point L213-1(lines 213 218) no Hoare annotation was computed. [2018-09-19 15:57:53,063 INFO L422 ceAbstractionStarter]: At program point L213-3(lines 213 218) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= (bvand ((_ extract 63 32) |v_q#valueAsBitvector_12|) (_ bv2147483647 32)) __ieee754_asin_~ix~0) (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|))))) (= |__ieee754_asin_#in~x| __ieee754_asin_~x) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_12|) __ieee754_asin_~hx~0))) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_12|) (_ bv2147483647 32)) (_ bv1072693248 32))) (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|)))))) [2018-09-19 15:57:53,063 INFO L426 ceAbstractionStarter]: For program point L213-4(lines 213 218) no Hoare annotation was computed. [2018-09-19 15:57:53,063 INFO L426 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-09-19 15:57:53,063 INFO L426 ceAbstractionStarter]: For program point L176-1(line 176) no Hoare annotation was computed. [2018-09-19 15:57:53,064 INFO L426 ceAbstractionStarter]: For program point L176-2(line 176) no Hoare annotation was computed. [2018-09-19 15:57:53,064 INFO L426 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-09-19 15:57:53,064 INFO L426 ceAbstractionStarter]: For program point L168-1(line 168) no Hoare annotation was computed. [2018-09-19 15:57:53,064 INFO L426 ceAbstractionStarter]: For program point L168-2(line 168) no Hoare annotation was computed. [2018-09-19 15:57:53,064 INFO L426 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-09-19 15:57:53,065 INFO L426 ceAbstractionStarter]: For program point L214-1(line 214) no Hoare annotation was computed. [2018-09-19 15:57:53,065 INFO L426 ceAbstractionStarter]: For program point L214-2(line 214) no Hoare annotation was computed. [2018-09-19 15:57:53,065 INFO L426 ceAbstractionStarter]: For program point L214-3(line 214) no Hoare annotation was computed. [2018-09-19 15:57:53,065 INFO L426 ceAbstractionStarter]: For program point L173-1(lines 173 177) no Hoare annotation was computed. [2018-09-19 15:57:53,065 INFO L422 ceAbstractionStarter]: At program point L173-3(lines 173 177) the Hoare annotation is: (and (= |__ieee754_asin_#in~x| __ieee754_asin_~x) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_12|) __ieee754_asin_~hx~0))) (exists ((|v_q#valueAsBitvector_13| (_ BitVec 64))) (and (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_13|) ((_ extract 62 52) |v_q#valueAsBitvector_13|) ((_ extract 51 0) |v_q#valueAsBitvector_13|))) (= __ieee754_asin_~ix~0 (bvand ((_ extract 63 32) |v_q#valueAsBitvector_13|) (_ bv2147483647 32)))))) [2018-09-19 15:57:53,066 INFO L426 ceAbstractionStarter]: For program point L173-4(lines 171 182) no Hoare annotation was computed. [2018-09-19 15:57:53,066 INFO L426 ceAbstractionStarter]: For program point L165-1(lines 165 169) no Hoare annotation was computed. [2018-09-19 15:57:53,067 INFO L422 ceAbstractionStarter]: At program point L165-3(lines 165 169) the Hoare annotation is: (= |__ieee754_asin_#in~x| __ieee754_asin_~x) [2018-09-19 15:57:53,067 INFO L426 ceAbstractionStarter]: For program point L165-4(lines 165 169) no Hoare annotation was computed. [2018-09-19 15:57:53,067 INFO L426 ceAbstractionStarter]: For program point __ieee754_asinEXIT(lines 162 229) no Hoare annotation was computed. [2018-09-19 15:57:53,067 INFO L426 ceAbstractionStarter]: For program point L215(line 215) no Hoare annotation was computed. [2018-09-19 15:57:53,067 INFO L426 ceAbstractionStarter]: For program point L182(lines 182 197) no Hoare annotation was computed. [2018-09-19 15:57:53,068 INFO L422 ceAbstractionStarter]: At program point L182-1(lines 182 197) the Hoare annotation is: (and (= |__ieee754_asin_#in~x| __ieee754_asin_~x) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_12|) __ieee754_asin_~hx~0))) (exists ((|v_q#valueAsBitvector_13| (_ BitVec 64))) (and (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_13|) ((_ extract 62 52) |v_q#valueAsBitvector_13|) ((_ extract 51 0) |v_q#valueAsBitvector_13|))) (= __ieee754_asin_~ix~0 (bvand ((_ extract 63 32) |v_q#valueAsBitvector_13|) (_ bv2147483647 32))))) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_12|) (_ bv2147483647 32)) (_ bv1072693248 32))) (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|)))))) [2018-09-19 15:57:53,068 INFO L422 ceAbstractionStarter]: At program point L207(line 207) the Hoare annotation is: (and (= |__ieee754_asin_#in~x| __ieee754_asin_~x) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|))) (= ((_ extract 63 32) |v_q#valueAsBitvector_12|) __ieee754_asin_~hx~0))) (exists ((|v_q#valueAsBitvector_13| (_ BitVec 64))) (and (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_13|) ((_ extract 62 52) |v_q#valueAsBitvector_13|) ((_ extract 51 0) |v_q#valueAsBitvector_13|))) (= __ieee754_asin_~ix~0 (bvand ((_ extract 63 32) |v_q#valueAsBitvector_13|) (_ bv2147483647 32))))) (exists ((|v_q#valueAsBitvector_12| (_ BitVec 64))) (and (not (bvsge (bvand ((_ extract 63 32) |v_q#valueAsBitvector_12|) (_ bv2147483647 32)) (_ bv1072693248 32))) (= |__ieee754_asin_#in~x| (fp ((_ extract 63 63) |v_q#valueAsBitvector_12|) ((_ extract 62 52) |v_q#valueAsBitvector_12|) ((_ extract 51 0) |v_q#valueAsBitvector_12|)))))) [2018-09-19 15:57:53,068 INFO L426 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-09-19 15:57:53,068 INFO L426 ceAbstractionStarter]: For program point L207-1(line 207) no Hoare annotation was computed. [2018-09-19 15:57:53,068 INFO L426 ceAbstractionStarter]: For program point L174-1(line 174) no Hoare annotation was computed. [2018-09-19 15:57:53,069 INFO L426 ceAbstractionStarter]: For program point L174-2(line 174) no Hoare annotation was computed. [2018-09-19 15:57:53,069 INFO L426 ceAbstractionStarter]: For program point L174-3(line 174) no Hoare annotation was computed. [2018-09-19 15:57:53,069 INFO L426 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-09-19 15:57:53,069 INFO L426 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-09-19 15:57:53,069 INFO L426 ceAbstractionStarter]: For program point L166-1(line 166) no Hoare annotation was computed. [2018-09-19 15:57:53,069 INFO L426 ceAbstractionStarter]: For program point L166-2(line 166) no Hoare annotation was computed. [2018-09-19 15:57:53,069 INFO L426 ceAbstractionStarter]: For program point L166-3(line 166) no Hoare annotation was computed. [2018-09-19 15:57:53,070 INFO L429 ceAbstractionStarter]: At program point __ieee754_asinENTRY(lines 162 229) the Hoare annotation is: true [2018-09-19 15:57:53,070 INFO L426 ceAbstractionStarter]: For program point __ieee754_asinFINAL(lines 162 229) no Hoare annotation was computed. [2018-09-19 15:57:53,070 INFO L426 ceAbstractionStarter]: For program point L216(line 216) no Hoare annotation was computed. [2018-09-19 15:57:53,070 INFO L426 ceAbstractionStarter]: For program point L183(lines 183 196) no Hoare annotation was computed. [2018-09-19 15:57:53,070 INFO L426 ceAbstractionStarter]: For program point L208(lines 208 224) no Hoare annotation was computed. [2018-09-19 15:57:53,070 INFO L426 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-09-19 15:57:53,070 INFO L426 ceAbstractionStarter]: For program point L208-2(lines 162 229) no Hoare annotation was computed. [2018-09-19 15:57:53,071 INFO L426 ceAbstractionStarter]: For program point L171(lines 171 197) no Hoare annotation was computed. [2018-09-19 15:57:53,071 INFO L426 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-09-19 15:57:53,071 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 15:57:53,071 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 15:57:53,071 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:57:53,075 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 15:57:53,075 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 15:57:53,075 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 15:57:53,075 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 15:57:53,075 INFO L426 ceAbstractionStarter]: For program point L242-1(lines 242 245) no Hoare annotation was computed. [2018-09-19 15:57:53,075 INFO L422 ceAbstractionStarter]: At program point L239(line 239) the Hoare annotation is: (= (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (_ +zero 11 53)) main_~x~0) [2018-09-19 15:57:53,076 INFO L426 ceAbstractionStarter]: For program point L239-1(line 239) no Hoare annotation was computed. [2018-09-19 15:57:53,076 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 231 248) the Hoare annotation is: true [2018-09-19 15:57:53,076 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 231 248) no Hoare annotation was computed. [2018-09-19 15:57:53,076 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 231 248) no Hoare annotation was computed. [2018-09-19 15:57:53,076 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2018-09-19 15:57:53,076 INFO L426 ceAbstractionStarter]: For program point L243(line 243) no Hoare annotation was computed. [2018-09-19 15:57:53,077 INFO L422 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (let ((.cse0 (fp.div RNE ((_ to_fp 11 53) RNE 1.0) (_ +zero 11 53)))) (and (= .cse0 main_~x~0) (= (let ((.cse1 (fp.sub RNE .cse0 .cse0))) (fp.div RNE .cse1 .cse1)) main_~res~0))) [2018-09-19 15:57:53,093 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,094 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,095 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,105 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,106 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,107 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,110 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,113 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,114 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,115 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,117 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,119 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,120 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,121 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,124 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 03:57:53 BoogieIcfgContainer [2018-09-19 15:57:53,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 15:57:53,128 INFO L168 Benchmark]: Toolchain (without parser) took 108221.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -367.8 MB). Peak memory consumption was 379.3 MB. Max. memory is 7.1 GB. [2018-09-19 15:57:53,129 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:57:53,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 15:57:53,131 INFO L168 Benchmark]: Boogie Preprocessor took 83.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 15:57:53,131 INFO L168 Benchmark]: RCFGBuilder took 20487.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2018-09-19 15:57:53,133 INFO L168 Benchmark]: TraceAbstraction took 87135.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 370.6 MB). Peak memory consumption was 370.6 MB. Max. memory is 7.1 GB. [2018-09-19 15:57:53,139 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 509.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 20487.51 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87135.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 370.6 MB). Peak memory consumption was 370.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 243]: 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: 52]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 173]: Loop Invariant [2018-09-19 15:57:53,160 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,161 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,162 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,163 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] [2018-09-19 15:57:53,164 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_13,QUANTIFIED] Derived loop invariant: (\old(x) == x && (\exists v_q#valueAsBitvector_12 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_12[63:63], v_q#valueAsBitvector_12[62:52], v_q#valueAsBitvector_12[51:0]) && v_q#valueAsBitvector_12[63:32] == hx)) && (\exists v_q#valueAsBitvector_13 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_13[63:63], v_q#valueAsBitvector_13[62:52], v_q#valueAsBitvector_13[51:0]) && ix == ~bvand32(v_q#valueAsBitvector_13[63:32], 2147483647bv32)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 213]: Loop Invariant [2018-09-19 15:57:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,166 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,167 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,168 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,169 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,170 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] [2018-09-19 15:57:53,171 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_12,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_12 : bv64 :: ~bvand32(v_q#valueAsBitvector_12[63:32], 2147483647bv32) == ix && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_12[63:63], v_q#valueAsBitvector_12[62:52], v_q#valueAsBitvector_12[51:0])) && \old(x) == x) && (\exists v_q#valueAsBitvector_12 : bv64 :: \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_12[63:63], v_q#valueAsBitvector_12[62:52], v_q#valueAsBitvector_12[51:0]) && v_q#valueAsBitvector_12[63:32] == hx)) && (\exists v_q#valueAsBitvector_12 : bv64 :: !~bvsge32(~bvand32(v_q#valueAsBitvector_12[63:32], 2147483647bv32), 1072693248bv32) && \old(x) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_12[63:63], v_q#valueAsBitvector_12[62:52], v_q#valueAsBitvector_12[51:0])) - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 161 locations, 1 error locations. SAFE Result, 87.0s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 67.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 796 SDtfs, 274 SDslu, 3857 SDs, 0 SdLazy, 387 SolverSat, 32 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 33.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 35 PreInvPairs, 48 NumberOfFragments, 265 HoareAnnotationTreeSize, 35 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 196 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 10.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 208 ConstructedInterpolants, 53 QuantifiedInterpolants, 61678 SizeOfPredicates, 29 NumberOfNonLiveVariables, 693 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...