java -ea -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/loops/lu.cmp_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:15:28,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:15:28,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:15:28,218 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:15:28,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:15:28,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:15:28,222 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:15:28,224 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:15:28,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:15:28,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:15:28,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:15:28,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:15:28,233 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:15:28,235 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:15:28,243 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:15:28,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:15:28,246 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:15:28,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:15:28,252 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:15:28,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:15:28,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:15:28,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:15:28,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:15:28,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:15:28,263 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:15:28,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:15:28,265 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:15:28,266 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:15:28,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:15:28,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:15:28,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:15:28,271 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:15:28,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:15:28,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:15:28,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:15:28,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:15:28,274 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-11-18 22:15:28,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:15:28,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:15:28,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:15:28,298 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:15:28,299 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:15:28,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:15:28,300 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:15:28,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:15:28,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:15:28,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:15:28,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:15:28,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:15:28,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:15:28,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:15:28,301 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:15:28,301 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:15:28,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:15:28,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:15:28,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:15:28,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:15:28,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:15:28,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:15:28,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:15:28,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:15:28,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:15:28,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:15:28,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:15:28,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:15:28,305 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:15:28,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:15:28,305 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:15:28,305 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:15:28,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:15:28,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:15:28,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:15:28,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:15:28,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:15:28,374 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:15:28,375 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/lu.cmp_true-unreach-call.i [2018-11-18 22:15:28,447 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e923f04db/760b99e978434ac2b5b9fdd6de06e9c9/FLAGace8d4bdf [2018-11-18 22:15:28,918 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:15:28,919 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp_true-unreach-call.i [2018-11-18 22:15:28,926 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e923f04db/760b99e978434ac2b5b9fdd6de06e9c9/FLAGace8d4bdf [2018-11-18 22:15:29,256 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e923f04db/760b99e978434ac2b5b9fdd6de06e9c9 [2018-11-18 22:15:29,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:15:29,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:15:29,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:15:29,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:15:29,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:15:29,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225cece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29, skipping insertion in model container [2018-11-18 22:15:29,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:15:29,328 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:15:29,680 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:15:29,690 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:15:29,758 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:15:29,804 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:15:29,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29 WrapperNode [2018-11-18 22:15:29,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:15:29,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:15:29,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:15:29,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:15:29,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (1/1) ... [2018-11-18 22:15:29,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:15:29,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:15:29,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:15:29,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:15:29,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (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-11-18 22:15:30,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:15:30,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:15:30,034 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:15:30,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2018-11-18 22:15:30,034 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:15:30,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2018-11-18 22:15:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:15:30,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:15:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2018-11-18 22:15:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2018-11-18 22:15:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:15:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-18 22:15:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-18 22:15:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:15:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:15:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:15:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:15:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-11-18 22:15:33,849 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:37,707 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:39,991 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:40,128 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:42,269 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:44,670 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:44,812 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:45,389 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:45,504 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-18 22:15:45,729 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:15:45,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:15:45 BoogieIcfgContainer [2018-11-18 22:15:45,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:15:45,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:15:45,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:15:45,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:15:45,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:15:29" (1/3) ... [2018-11-18 22:15:45,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d63bb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:15:45, skipping insertion in model container [2018-11-18 22:15:45,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:15:29" (2/3) ... [2018-11-18 22:15:45,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d63bb6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:15:45, skipping insertion in model container [2018-11-18 22:15:45,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:15:45" (3/3) ... [2018-11-18 22:15:45,743 INFO L112 eAbstractionObserver]: Analyzing ICFG lu.cmp_true-unreach-call.i [2018-11-18 22:15:45,754 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:15:45,764 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:15:45,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:15:45,826 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:15:45,827 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:15:45,827 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:15:45,827 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:15:45,827 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:15:45,828 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:15:45,828 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:15:45,828 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:15:45,828 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:15:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2018-11-18 22:15:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 22:15:45,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:15:45,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:15:45,858 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:15:45,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:15:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash 765892228, now seen corresponding path program 1 times [2018-11-18 22:15:45,868 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 22:15:45,869 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-11-18 22:15:45,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:15:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:15:45,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:15:46,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {78#true} call ULTIMATE.init(); {78#true} is VALID [2018-11-18 22:15:46,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {78#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {78#true} is VALID [2018-11-18 22:15:46,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {78#true} assume true; {78#true} is VALID [2018-11-18 22:15:46,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {78#true} {78#true} #219#return; {78#true} is VALID [2018-11-18 22:15:46,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {78#true} call #t~ret33 := main(); {78#true} is VALID [2018-11-18 22:15:46,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {78#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {78#true} is VALID [2018-11-18 22:15:46,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {78#true} assume true; {78#true} is VALID [2018-11-18 22:15:46,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {78#true} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {78#true} is VALID [2018-11-18 22:15:46,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {78#true} assume !true; {79#false} is VALID [2018-11-18 22:15:46,256 INFO L256 TraceCheckUtils]: 9: Hoare triple {79#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {79#false} is VALID [2018-11-18 22:15:46,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {79#false} ~cond := #in~cond; {79#false} is VALID [2018-11-18 22:15:46,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {79#false} assume 0bv32 == ~cond; {79#false} is VALID [2018-11-18 22:15:46,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {79#false} assume !false; {79#false} is VALID [2018-11-18 22:15:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:15:46,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:15:46,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:15:46,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:15:46,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-18 22:15:46,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:15:46,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:15:46,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:15:46,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:15:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:15:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:15:46,348 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 2 states. [2018-11-18 22:16:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:02,545 INFO L93 Difference]: Finished difference Result 144 states and 200 transitions. [2018-11-18 22:16:02,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:16:02,546 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-18 22:16:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:16:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2018-11-18 22:16:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:16:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2018-11-18 22:16:02,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 200 transitions. [2018-11-18 22:16:10,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:10,050 INFO L225 Difference]: With dead ends: 144 [2018-11-18 22:16:10,051 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 22:16:10,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:16:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 22:16:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 22:16:10,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:10,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 22:16:10,113 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:16:10,113 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:16:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:10,116 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 22:16:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:16:10,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:10,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:10,117 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 22:16:10,118 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 22:16:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:10,121 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 22:16:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:16:10,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:10,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:10,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:10,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:16:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-18 22:16:10,127 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2018-11-18 22:16:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:10,127 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 22:16:10,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:16:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 22:16:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:16:10,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:10,129 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:10,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:10,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:10,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1771472002, now seen corresponding path program 1 times [2018-11-18 22:16:10,130 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 22:16:10,131 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) [2018-11-18 22:16:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-18 22:16:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:10,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:10,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {374#true} call ULTIMATE.init(); {374#true} is VALID [2018-11-18 22:16:10,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {374#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {374#true} is VALID [2018-11-18 22:16:10,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {374#true} assume true; {374#true} is VALID [2018-11-18 22:16:10,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {374#true} {374#true} #219#return; {374#true} is VALID [2018-11-18 22:16:10,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {374#true} call #t~ret33 := main(); {374#true} is VALID [2018-11-18 22:16:10,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {394#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:10,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {394#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {394#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:10,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {394#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {401#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:10,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {401#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {401#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:10,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {401#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !~bvsle32(~j~0, ~n~0); {375#false} is VALID [2018-11-18 22:16:10,300 INFO L256 TraceCheckUtils]: 10: Hoare triple {375#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {375#false} is VALID [2018-11-18 22:16:10,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#false} ~cond := #in~cond; {375#false} is VALID [2018-11-18 22:16:10,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {375#false} assume 0bv32 == ~cond; {375#false} is VALID [2018-11-18 22:16:10,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {375#false} assume !false; {375#false} is VALID [2018-11-18 22:16:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:10,303 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:16:10,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:16:10,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:16:10,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 22:16:10,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:10,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:16:10,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:10,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:16:10,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:16:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:16:10,435 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2018-11-18 22:16:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:12,158 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 22:16:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:16:12,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 22:16:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:16:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-18 22:16:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:16:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2018-11-18 22:16:12,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2018-11-18 22:16:12,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:12,770 INFO L225 Difference]: With dead ends: 43 [2018-11-18 22:16:12,770 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 22:16:12,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:16:12,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 22:16:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-18 22:16:12,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:12,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 24 states. [2018-11-18 22:16:12,796 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 24 states. [2018-11-18 22:16:12,796 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 24 states. [2018-11-18 22:16:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:12,799 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-18 22:16:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 22:16:12,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:12,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:12,800 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 27 states. [2018-11-18 22:16:12,800 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 27 states. [2018-11-18 22:16:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:12,803 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-18 22:16:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 22:16:12,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:12,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:12,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:12,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:16:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-18 22:16:12,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-18 22:16:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:12,807 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-18 22:16:12,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:16:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-18 22:16:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:16:12,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:12,808 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:12,809 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:12,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:12,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1929070916, now seen corresponding path program 1 times [2018-11-18 22:16:12,810 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 22:16:12,810 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-11-18 22:16:12,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:16:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:13,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:13,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {562#true} is VALID [2018-11-18 22:16:13,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {562#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {562#true} is VALID [2018-11-18 22:16:13,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-18 22:16:13,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #219#return; {562#true} is VALID [2018-11-18 22:16:13,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret33 := main(); {562#true} is VALID [2018-11-18 22:16:13,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {562#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {582#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:13,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {582#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {582#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:13,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {582#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:13,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:13,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:13,169 INFO L273 TraceCheckUtils]: 10: Hoare triple {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:13,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:13,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {605#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:13,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {605#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {605#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:13,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {605#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~j~0, ~n~0); {563#false} is VALID [2018-11-18 22:16:13,175 INFO L256 TraceCheckUtils]: 15: Hoare triple {563#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {563#false} is VALID [2018-11-18 22:16:13,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {563#false} ~cond := #in~cond; {563#false} is VALID [2018-11-18 22:16:13,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {563#false} assume 0bv32 == ~cond; {563#false} is VALID [2018-11-18 22:16:13,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {563#false} assume !false; {563#false} is VALID [2018-11-18 22:16:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:13,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:13,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {563#false} assume !false; {563#false} is VALID [2018-11-18 22:16:13,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {563#false} assume 0bv32 == ~cond; {563#false} is VALID [2018-11-18 22:16:13,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {563#false} ~cond := #in~cond; {563#false} is VALID [2018-11-18 22:16:13,569 INFO L256 TraceCheckUtils]: 15: Hoare triple {563#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {563#false} is VALID [2018-11-18 22:16:13,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {636#(bvsle main_~j~0 main_~n~0)} assume !~bvsle32(~j~0, ~n~0); {563#false} is VALID [2018-11-18 22:16:13,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {636#(bvsle main_~j~0 main_~n~0)} assume true; {636#(bvsle main_~j~0 main_~n~0)} is VALID [2018-11-18 22:16:13,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {636#(bvsle main_~j~0 main_~n~0)} is VALID [2018-11-18 22:16:13,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:13,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:13,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:13,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume true; {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:13,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {659#(bvsle (_ bv1 32) main_~n~0)} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {643#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:13,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#(bvsle (_ bv1 32) main_~n~0)} assume true; {659#(bvsle (_ bv1 32) main_~n~0)} is VALID [2018-11-18 22:16:13,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {562#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {659#(bvsle (_ bv1 32) main_~n~0)} is VALID [2018-11-18 22:16:13,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret33 := main(); {562#true} is VALID [2018-11-18 22:16:13,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #219#return; {562#true} is VALID [2018-11-18 22:16:13,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2018-11-18 22:16:13,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {562#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {562#true} is VALID [2018-11-18 22:16:13,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {562#true} is VALID [2018-11-18 22:16:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:16:13,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:13,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 22:16:13,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-18 22:16:13,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:13,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:16:13,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:13,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:16:13,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:16:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:16:13,881 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-11-18 22:16:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:17,184 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-18 22:16:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:16:17,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-18 22:16:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:16:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-18 22:16:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:16:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-18 22:16:17,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2018-11-18 22:16:17,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:17,850 INFO L225 Difference]: With dead ends: 57 [2018-11-18 22:16:17,850 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 22:16:17,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:16:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 22:16:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 22:16:17,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:17,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:17,870 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:17,871 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:17,874 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 22:16:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 22:16:17,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:17,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:17,875 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:17,875 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-18 22:16:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:17,878 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 22:16:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 22:16:17,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:17,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:17,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:17,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 22:16:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 22:16:17,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 19 [2018-11-18 22:16:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:17,882 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 22:16:17,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:16:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 22:16:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:16:17,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:17,884 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:17,884 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:17,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:17,885 INFO L82 PathProgramCache]: Analyzing trace with hash 393927938, now seen corresponding path program 2 times [2018-11-18 22:16:17,886 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 22:16:17,886 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) [2018-11-18 22:16:17,901 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-18 22:16:17,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:16:17,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:16:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:17,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:18,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {890#true} call ULTIMATE.init(); {890#true} is VALID [2018-11-18 22:16:18,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {890#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {890#true} is VALID [2018-11-18 22:16:18,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-18 22:16:18,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {890#true} {890#true} #219#return; {890#true} is VALID [2018-11-18 22:16:18,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {890#true} call #t~ret33 := main(); {890#true} is VALID [2018-11-18 22:16:18,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {890#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume true; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume true; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {910#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {910#(= main_~i~0 (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume true; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,217 INFO L273 TraceCheckUtils]: 16: Hoare triple {910#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {910#(= main_~i~0 (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,218 INFO L273 TraceCheckUtils]: 18: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume true; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {910#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {910#(= main_~i~0 (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,222 INFO L273 TraceCheckUtils]: 23: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume true; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {910#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,224 INFO L273 TraceCheckUtils]: 27: Hoare triple {910#(= main_~i~0 (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume true; {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {910#(= main_~i~0 (_ bv0 32))} assume !~bvsle32(~j~0, ~n~0); {910#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:18,226 INFO L256 TraceCheckUtils]: 30: Hoare triple {910#(= main_~i~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {986#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:18,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {986#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {990#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:18,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {990#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {891#false} is VALID [2018-11-18 22:16:18,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {891#false} assume !false; {891#false} is VALID [2018-11-18 22:16:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 22:16:18,234 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:16:18,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:16:18,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 22:16:18,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 22:16:18,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:18,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:16:18,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:18,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:16:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:16:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:16:18,398 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 5 states. [2018-11-18 22:16:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:21,337 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-18 22:16:21,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:16:21,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-18 22:16:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:16:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-18 22:16:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:16:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-18 22:16:21,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2018-11-18 22:16:21,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:21,657 INFO L225 Difference]: With dead ends: 72 [2018-11-18 22:16:21,657 INFO L226 Difference]: Without dead ends: 70 [2018-11-18 22:16:21,658 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:16:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-18 22:16:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-18 22:16:21,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:21,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2018-11-18 22:16:21,694 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2018-11-18 22:16:21,694 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2018-11-18 22:16:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:21,699 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-18 22:16:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-18 22:16:21,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:21,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:21,700 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2018-11-18 22:16:21,701 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2018-11-18 22:16:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:21,705 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-18 22:16:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-18 22:16:21,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:21,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:21,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:21,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 22:16:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-11-18 22:16:21,710 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 34 [2018-11-18 22:16:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:21,711 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-18 22:16:21,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:16:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-11-18 22:16:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 22:16:21,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:21,713 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:21,714 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:21,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:21,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1581738216, now seen corresponding path program 1 times [2018-11-18 22:16:21,715 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 22:16:21,715 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-11-18 22:16:21,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:16:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:23,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:23,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {1318#true} call ULTIMATE.init(); {1318#true} is VALID [2018-11-18 22:16:23,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {1318#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {1318#true} is VALID [2018-11-18 22:16:23,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {1318#true} assume true; {1318#true} is VALID [2018-11-18 22:16:23,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1318#true} {1318#true} #219#return; {1318#true} is VALID [2018-11-18 22:16:23,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {1318#true} call #t~ret33 := main(); {1318#true} is VALID [2018-11-18 22:16:23,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {1318#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {1338#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:23,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {1338#(= main_~i~0 (_ bv0 32))} assume true; {1338#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 22:16:23,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {1338#(= main_~i~0 (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:23,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:23,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:23,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:23,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 22:16:23,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {1345#(and (= main_~j~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1361#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:23,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {1361#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1361#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:23,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {1361#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1361#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:23,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {1361#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,432 INFO L273 TraceCheckUtils]: 16: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,433 INFO L273 TraceCheckUtils]: 19: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,434 INFO L273 TraceCheckUtils]: 23: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,435 INFO L273 TraceCheckUtils]: 25: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,436 INFO L273 TraceCheckUtils]: 28: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {1319#false} assume !~bvsle32(~j~0, ~n~0); {1319#false} is VALID [2018-11-18 22:16:23,437 INFO L256 TraceCheckUtils]: 30: Hoare triple {1319#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {1319#false} is VALID [2018-11-18 22:16:23,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {1319#false} ~cond := #in~cond; {1319#false} is VALID [2018-11-18 22:16:23,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {1319#false} assume !(0bv32 == ~cond); {1319#false} is VALID [2018-11-18 22:16:23,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,438 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1319#false} {1319#false} #223#return; {1319#false} is VALID [2018-11-18 22:16:23,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {1319#false} call write~intFLOATTYPE8(~w~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(8bv32, ~i~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {1319#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1319#false} is VALID [2018-11-18 22:16:23,439 INFO L273 TraceCheckUtils]: 37: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,439 INFO L273 TraceCheckUtils]: 38: Hoare triple {1319#false} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {1319#false} is VALID [2018-11-18 22:16:23,440 INFO L273 TraceCheckUtils]: 39: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,442 INFO L273 TraceCheckUtils]: 46: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,442 INFO L273 TraceCheckUtils]: 47: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,442 INFO L273 TraceCheckUtils]: 48: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,443 INFO L273 TraceCheckUtils]: 49: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,443 INFO L273 TraceCheckUtils]: 50: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,443 INFO L273 TraceCheckUtils]: 51: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,444 INFO L273 TraceCheckUtils]: 52: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,444 INFO L273 TraceCheckUtils]: 53: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,444 INFO L273 TraceCheckUtils]: 54: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,444 INFO L273 TraceCheckUtils]: 55: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,445 INFO L273 TraceCheckUtils]: 56: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,445 INFO L273 TraceCheckUtils]: 57: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,445 INFO L273 TraceCheckUtils]: 58: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,446 INFO L273 TraceCheckUtils]: 59: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,446 INFO L273 TraceCheckUtils]: 60: Hoare triple {1319#false} assume !~bvsle32(~j~0, ~n~0); {1319#false} is VALID [2018-11-18 22:16:23,446 INFO L256 TraceCheckUtils]: 61: Hoare triple {1319#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {1319#false} is VALID [2018-11-18 22:16:23,446 INFO L273 TraceCheckUtils]: 62: Hoare triple {1319#false} ~cond := #in~cond; {1319#false} is VALID [2018-11-18 22:16:23,447 INFO L273 TraceCheckUtils]: 63: Hoare triple {1319#false} assume 0bv32 == ~cond; {1319#false} is VALID [2018-11-18 22:16:23,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {1319#false} assume !false; {1319#false} is VALID [2018-11-18 22:16:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-18 22:16:23,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:23,745 INFO L273 TraceCheckUtils]: 64: Hoare triple {1319#false} assume !false; {1319#false} is VALID [2018-11-18 22:16:23,745 INFO L273 TraceCheckUtils]: 63: Hoare triple {1319#false} assume 0bv32 == ~cond; {1319#false} is VALID [2018-11-18 22:16:23,746 INFO L273 TraceCheckUtils]: 62: Hoare triple {1319#false} ~cond := #in~cond; {1319#false} is VALID [2018-11-18 22:16:23,746 INFO L256 TraceCheckUtils]: 61: Hoare triple {1319#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {1319#false} is VALID [2018-11-18 22:16:23,746 INFO L273 TraceCheckUtils]: 60: Hoare triple {1319#false} assume !~bvsle32(~j~0, ~n~0); {1319#false} is VALID [2018-11-18 22:16:23,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,747 INFO L273 TraceCheckUtils]: 56: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,747 INFO L273 TraceCheckUtils]: 55: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,748 INFO L273 TraceCheckUtils]: 53: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,749 INFO L273 TraceCheckUtils]: 49: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,749 INFO L273 TraceCheckUtils]: 48: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,750 INFO L273 TraceCheckUtils]: 44: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,751 INFO L273 TraceCheckUtils]: 40: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,751 INFO L273 TraceCheckUtils]: 39: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {1319#false} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {1319#false} is VALID [2018-11-18 22:16:23,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {1319#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1319#false} is VALID [2018-11-18 22:16:23,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {1319#false} call write~intFLOATTYPE8(~w~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(8bv32, ~i~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,752 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1318#true} {1319#false} #223#return; {1319#false} is VALID [2018-11-18 22:16:23,753 INFO L273 TraceCheckUtils]: 33: Hoare triple {1318#true} assume true; {1318#true} is VALID [2018-11-18 22:16:23,753 INFO L273 TraceCheckUtils]: 32: Hoare triple {1318#true} assume !(0bv32 == ~cond); {1318#true} is VALID [2018-11-18 22:16:23,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {1318#true} ~cond := #in~cond; {1318#true} is VALID [2018-11-18 22:16:23,754 INFO L256 TraceCheckUtils]: 30: Hoare triple {1319#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {1318#true} is VALID [2018-11-18 22:16:23,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {1319#false} assume !~bvsle32(~j~0, ~n~0); {1319#false} is VALID [2018-11-18 22:16:23,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,754 INFO L273 TraceCheckUtils]: 27: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,755 INFO L273 TraceCheckUtils]: 23: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {1319#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {1319#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1319#false} is VALID [2018-11-18 22:16:23,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {1319#false} assume true; {1319#false} is VALID [2018-11-18 22:16:23,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {1319#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1319#false} is VALID [2018-11-18 22:16:23,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {1319#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1319#false} is VALID [2018-11-18 22:16:23,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {1665#(not (= main_~j~0 main_~i~0))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1319#false} is VALID [2018-11-18 22:16:23,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {1665#(not (= main_~j~0 main_~i~0))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1665#(not (= main_~j~0 main_~i~0))} is VALID [2018-11-18 22:16:23,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {1665#(not (= main_~j~0 main_~i~0))} assume true; {1665#(not (= main_~j~0 main_~i~0))} is VALID [2018-11-18 22:16:23,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1665#(not (= main_~j~0 main_~i~0))} is VALID [2018-11-18 22:16:23,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} is VALID [2018-11-18 22:16:23,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} is VALID [2018-11-18 22:16:23,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} is VALID [2018-11-18 22:16:23,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} assume true; {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} is VALID [2018-11-18 22:16:23,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {1691#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {1675#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) main_~j~0))} is VALID [2018-11-18 22:16:23,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {1691#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1691#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:23,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {1318#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {1691#(not (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:23,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {1318#true} call #t~ret33 := main(); {1318#true} is VALID [2018-11-18 22:16:23,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1318#true} {1318#true} #219#return; {1318#true} is VALID [2018-11-18 22:16:23,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {1318#true} assume true; {1318#true} is VALID [2018-11-18 22:16:23,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {1318#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {1318#true} is VALID [2018-11-18 22:16:23,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {1318#true} call ULTIMATE.init(); {1318#true} is VALID [2018-11-18 22:16:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 22:16:23,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:23,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 22:16:23,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-18 22:16:23,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:23,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:16:24,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:24,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:16:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:16:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:16:24,371 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 8 states. [2018-11-18 22:16:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:31,985 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2018-11-18 22:16:31,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:16:31,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-18 22:16:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:16:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2018-11-18 22:16:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:16:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2018-11-18 22:16:31,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2018-11-18 22:16:33,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:33,008 INFO L225 Difference]: With dead ends: 175 [2018-11-18 22:16:33,008 INFO L226 Difference]: Without dead ends: 118 [2018-11-18 22:16:33,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:16:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-18 22:16:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2018-11-18 22:16:33,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:33,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 102 states. [2018-11-18 22:16:33,145 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 102 states. [2018-11-18 22:16:33,145 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 102 states. [2018-11-18 22:16:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:33,152 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-11-18 22:16:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-11-18 22:16:33,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:33,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:33,154 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 118 states. [2018-11-18 22:16:33,154 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 118 states. [2018-11-18 22:16:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:33,160 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-11-18 22:16:33,160 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-11-18 22:16:33,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:33,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:33,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:33,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 22:16:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-11-18 22:16:33,166 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 65 [2018-11-18 22:16:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:33,166 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-11-18 22:16:33,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:16:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-11-18 22:16:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 22:16:33,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:33,169 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 8, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:33,169 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:33,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 744942490, now seen corresponding path program 1 times [2018-11-18 22:16:33,170 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 22:16:33,170 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-11-18 22:16:33,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-18 22:16:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:34,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:34,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2305#true} is VALID [2018-11-18 22:16:34,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {2305#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {2305#true} is VALID [2018-11-18 22:16:34,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-18 22:16:34,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #219#return; {2305#true} is VALID [2018-11-18 22:16:34,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret33 := main(); {2305#true} is VALID [2018-11-18 22:16:34,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {2305#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {2325#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:34,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {2325#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2325#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:34,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {2325#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,535 INFO L273 TraceCheckUtils]: 11: Hoare triple {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {2332#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~i~0 == ~j~0); {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {2348#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,541 INFO L273 TraceCheckUtils]: 18: Hoare triple {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !(~i~0 == ~j~0); {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {2364#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,554 INFO L273 TraceCheckUtils]: 25: Hoare triple {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~i~0 == ~j~0); {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {2380#(and (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2396#(and (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {2396#(and (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {2396#(and (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-18 22:16:34,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {2396#(and (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !~bvsle32(~j~0, ~n~0); {2306#false} is VALID [2018-11-18 22:16:34,562 INFO L256 TraceCheckUtils]: 30: Hoare triple {2306#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {2306#false} is VALID [2018-11-18 22:16:34,562 INFO L273 TraceCheckUtils]: 31: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-18 22:16:34,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {2306#false} assume !(0bv32 == ~cond); {2306#false} is VALID [2018-11-18 22:16:34,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:34,563 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2306#false} {2306#false} #223#return; {2306#false} is VALID [2018-11-18 22:16:34,563 INFO L273 TraceCheckUtils]: 35: Hoare triple {2306#false} call write~intFLOATTYPE8(~w~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(8bv32, ~i~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:34,563 INFO L273 TraceCheckUtils]: 36: Hoare triple {2306#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2306#false} is VALID [2018-11-18 22:16:34,564 INFO L273 TraceCheckUtils]: 37: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:34,564 INFO L273 TraceCheckUtils]: 38: Hoare triple {2306#false} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {2306#false} is VALID [2018-11-18 22:16:34,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:34,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:34,564 INFO L273 TraceCheckUtils]: 41: Hoare triple {2306#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {2306#false} is VALID [2018-11-18 22:16:34,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:34,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:34,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:34,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:34,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {2306#false} assume !(~i~0 == ~j~0); {2306#false} is VALID [2018-11-18 22:16:34,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:34,565 INFO L273 TraceCheckUtils]: 48: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:34,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:34,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:34,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {2306#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {2306#false} is VALID [2018-11-18 22:16:34,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:34,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:34,567 INFO L273 TraceCheckUtils]: 54: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:34,567 INFO L273 TraceCheckUtils]: 55: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:34,567 INFO L273 TraceCheckUtils]: 56: Hoare triple {2306#false} assume !(~i~0 == ~j~0); {2306#false} is VALID [2018-11-18 22:16:34,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:34,568 INFO L273 TraceCheckUtils]: 58: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:34,568 INFO L273 TraceCheckUtils]: 59: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:34,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {2306#false} assume !~bvsle32(~j~0, ~n~0); {2306#false} is VALID [2018-11-18 22:16:34,568 INFO L256 TraceCheckUtils]: 61: Hoare triple {2306#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {2306#false} is VALID [2018-11-18 22:16:34,568 INFO L273 TraceCheckUtils]: 62: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-18 22:16:34,569 INFO L273 TraceCheckUtils]: 63: Hoare triple {2306#false} assume 0bv32 == ~cond; {2306#false} is VALID [2018-11-18 22:16:34,569 INFO L273 TraceCheckUtils]: 64: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2018-11-18 22:16:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 100 proven. 38 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 22:16:34,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:35,337 INFO L273 TraceCheckUtils]: 64: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2018-11-18 22:16:35,337 INFO L273 TraceCheckUtils]: 63: Hoare triple {2306#false} assume 0bv32 == ~cond; {2306#false} is VALID [2018-11-18 22:16:35,338 INFO L273 TraceCheckUtils]: 62: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-18 22:16:35,338 INFO L256 TraceCheckUtils]: 61: Hoare triple {2306#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {2306#false} is VALID [2018-11-18 22:16:35,338 INFO L273 TraceCheckUtils]: 60: Hoare triple {2306#false} assume !~bvsle32(~j~0, ~n~0); {2306#false} is VALID [2018-11-18 22:16:35,338 INFO L273 TraceCheckUtils]: 59: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:35,339 INFO L273 TraceCheckUtils]: 58: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:35,339 INFO L273 TraceCheckUtils]: 57: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:35,339 INFO L273 TraceCheckUtils]: 56: Hoare triple {2306#false} assume !(~i~0 == ~j~0); {2306#false} is VALID [2018-11-18 22:16:35,339 INFO L273 TraceCheckUtils]: 55: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:35,340 INFO L273 TraceCheckUtils]: 54: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:35,340 INFO L273 TraceCheckUtils]: 53: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:35,340 INFO L273 TraceCheckUtils]: 52: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:35,340 INFO L273 TraceCheckUtils]: 51: Hoare triple {2306#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {2306#false} is VALID [2018-11-18 22:16:35,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:35,341 INFO L273 TraceCheckUtils]: 49: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:35,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:35,341 INFO L273 TraceCheckUtils]: 47: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:35,342 INFO L273 TraceCheckUtils]: 46: Hoare triple {2306#false} assume !(~i~0 == ~j~0); {2306#false} is VALID [2018-11-18 22:16:35,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:35,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:35,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {2306#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2306#false} is VALID [2018-11-18 22:16:35,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {2306#false} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2306#false} is VALID [2018-11-18 22:16:35,343 INFO L273 TraceCheckUtils]: 41: Hoare triple {2306#false} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {2306#false} is VALID [2018-11-18 22:16:35,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {2306#false} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:35,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:35,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {2306#false} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {2306#false} is VALID [2018-11-18 22:16:35,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {2306#false} assume true; {2306#false} is VALID [2018-11-18 22:16:35,343 INFO L273 TraceCheckUtils]: 36: Hoare triple {2306#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2306#false} is VALID [2018-11-18 22:16:35,343 INFO L273 TraceCheckUtils]: 35: Hoare triple {2306#false} call write~intFLOATTYPE8(~w~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(8bv32, ~i~0)), 8bv32); {2306#false} is VALID [2018-11-18 22:16:35,344 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2305#true} {2306#false} #223#return; {2306#false} is VALID [2018-11-18 22:16:35,344 INFO L273 TraceCheckUtils]: 33: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-18 22:16:35,344 INFO L273 TraceCheckUtils]: 32: Hoare triple {2305#true} assume !(0bv32 == ~cond); {2305#true} is VALID [2018-11-18 22:16:35,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {2305#true} ~cond := #in~cond; {2305#true} is VALID [2018-11-18 22:16:35,344 INFO L256 TraceCheckUtils]: 30: Hoare triple {2306#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {2305#true} is VALID [2018-11-18 22:16:35,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {2613#(bvsle main_~j~0 main_~n~0)} assume !~bvsle32(~j~0, ~n~0); {2306#false} is VALID [2018-11-18 22:16:35,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {2613#(bvsle main_~j~0 main_~n~0)} assume true; {2613#(bvsle main_~j~0 main_~n~0)} is VALID [2018-11-18 22:16:35,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2613#(bvsle main_~j~0 main_~n~0)} is VALID [2018-11-18 22:16:35,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !(~i~0 == ~j~0); {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume true; {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2620#(bvsle (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !(~i~0 == ~j~0); {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume true; {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2636#(bvsle (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !(~i~0 == ~j~0); {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume true; {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2652#(bvsle (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume true; {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {2684#(bvsle (_ bv4 32) main_~n~0)} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {2668#(bvsle (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-18 22:16:35,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {2684#(bvsle (_ bv4 32) main_~n~0)} assume true; {2684#(bvsle (_ bv4 32) main_~n~0)} is VALID [2018-11-18 22:16:35,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {2305#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {2684#(bvsle (_ bv4 32) main_~n~0)} is VALID [2018-11-18 22:16:35,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret33 := main(); {2305#true} is VALID [2018-11-18 22:16:35,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #219#return; {2305#true} is VALID [2018-11-18 22:16:35,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-18 22:16:35,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {2305#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {2305#true} is VALID [2018-11-18 22:16:35,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2305#true} is VALID [2018-11-18 22:16:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 22:16:35,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:35,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 22:16:35,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-18 22:16:35,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:35,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:16:36,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:36,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:16:36,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:16:36,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:16:36,386 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 14 states. [2018-11-18 22:16:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:55,257 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2018-11-18 22:16:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:16:55,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-18 22:16:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:16:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:16:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-18 22:16:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:16:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-18 22:16:55,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2018-11-18 22:16:56,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:56,163 INFO L225 Difference]: With dead ends: 193 [2018-11-18 22:16:56,164 INFO L226 Difference]: Without dead ends: 136 [2018-11-18 22:16:56,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:16:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-18 22:16:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-18 22:16:56,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:16:56,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 136 states. [2018-11-18 22:16:56,326 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-18 22:16:56,326 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-18 22:16:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:56,332 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-18 22:16:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-11-18 22:16:56,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:56,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:56,333 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-18 22:16:56,334 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-18 22:16:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:16:56,339 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-18 22:16:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-11-18 22:16:56,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:16:56,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:16:56,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:16:56,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:16:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 22:16:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2018-11-18 22:16:56,344 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 65 [2018-11-18 22:16:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:16:56,345 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2018-11-18 22:16:56,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:16:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-11-18 22:16:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 22:16:56,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:16:56,347 INFO L375 BasicCegarLoop]: trace histogram [14, 12, 12, 12, 7, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:16:56,348 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:16:56,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:16:56,348 INFO L82 PathProgramCache]: Analyzing trace with hash 236927578, now seen corresponding path program 2 times [2018-11-18 22:16:56,349 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 22:16:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-18 22:16:56,359 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:16:56,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:16:56,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:16:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:56,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:56,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {3393#true} call ULTIMATE.init(); {3393#true} is VALID [2018-11-18 22:16:56,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {3393#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {3393#true} is VALID [2018-11-18 22:16:56,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {3393#true} assume true; {3393#true} is VALID [2018-11-18 22:16:56,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3393#true} {3393#true} #219#return; {3393#true} is VALID [2018-11-18 22:16:56,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {3393#true} call #t~ret33 := main(); {3393#true} is VALID [2018-11-18 22:16:56,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {3393#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,862 INFO L273 TraceCheckUtils]: 24: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,870 INFO L273 TraceCheckUtils]: 25: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,872 INFO L273 TraceCheckUtils]: 27: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsle32(~j~0, ~n~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,877 INFO L256 TraceCheckUtils]: 40: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {3393#true} is VALID [2018-11-18 22:16:56,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {3393#true} ~cond := #in~cond; {3393#true} is VALID [2018-11-18 22:16:56,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {3393#true} assume !(0bv32 == ~cond); {3393#true} is VALID [2018-11-18 22:16:56,877 INFO L273 TraceCheckUtils]: 43: Hoare triple {3393#true} assume true; {3393#true} is VALID [2018-11-18 22:16:56,878 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3393#true} {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #223#return; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call write~intFLOATTYPE8(~w~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(8bv32, ~i~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,881 INFO L273 TraceCheckUtils]: 48: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,882 INFO L273 TraceCheckUtils]: 51: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,882 INFO L273 TraceCheckUtils]: 52: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,883 INFO L273 TraceCheckUtils]: 53: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,883 INFO L273 TraceCheckUtils]: 54: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,884 INFO L273 TraceCheckUtils]: 55: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,884 INFO L273 TraceCheckUtils]: 56: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !(~i~0 == ~j~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,885 INFO L273 TraceCheckUtils]: 57: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,885 INFO L273 TraceCheckUtils]: 58: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,886 INFO L273 TraceCheckUtils]: 59: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,887 INFO L273 TraceCheckUtils]: 60: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,887 INFO L273 TraceCheckUtils]: 61: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,888 INFO L273 TraceCheckUtils]: 63: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,889 INFO L273 TraceCheckUtils]: 64: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,889 INFO L273 TraceCheckUtils]: 65: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,890 INFO L273 TraceCheckUtils]: 66: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !(~i~0 == ~j~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,890 INFO L273 TraceCheckUtils]: 67: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,891 INFO L273 TraceCheckUtils]: 68: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,892 INFO L273 TraceCheckUtils]: 69: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,893 INFO L273 TraceCheckUtils]: 72: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,894 INFO L273 TraceCheckUtils]: 73: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,894 INFO L273 TraceCheckUtils]: 74: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,895 INFO L273 TraceCheckUtils]: 75: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,895 INFO L273 TraceCheckUtils]: 76: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !(~i~0 == ~j~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,896 INFO L273 TraceCheckUtils]: 77: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,897 INFO L273 TraceCheckUtils]: 78: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,897 INFO L273 TraceCheckUtils]: 79: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,898 INFO L273 TraceCheckUtils]: 80: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !~bvsle32(~j~0, ~n~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:56,900 INFO L256 TraceCheckUtils]: 81: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {3643#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,900 INFO L273 TraceCheckUtils]: 82: Hoare triple {3643#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3647#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:56,901 INFO L273 TraceCheckUtils]: 83: Hoare triple {3647#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3394#false} is VALID [2018-11-18 22:16:56,901 INFO L273 TraceCheckUtils]: 84: Hoare triple {3394#false} assume !false; {3394#false} is VALID [2018-11-18 22:16:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 2 proven. 207 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-18 22:16:56,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:57,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:16:57,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:16:57,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:16:57,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 22:16:57,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:16:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:16:57,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:16:57,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {3393#true} call ULTIMATE.init(); {3393#true} is VALID [2018-11-18 22:16:57,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {3393#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(20000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {3393#true} is VALID [2018-11-18 22:16:57,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {3393#true} assume true; {3393#true} is VALID [2018-11-18 22:16:57,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3393#true} {3393#true} #219#return; {3393#true} is VALID [2018-11-18 22:16:57,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {3393#true} call #t~ret33 := main(); {3393#true} is VALID [2018-11-18 22:16:57,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {3393#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50bv32;~n~0 := 5bv32;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := ~to_fp~DOUBLE(~roundNearestTiesToEven, 1.0E-6);~i~0 := 0bv32; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,393 INFO L273 TraceCheckUtils]: 16: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(~i~0 == ~j~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,403 INFO L273 TraceCheckUtils]: 36: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsle32(~j~0, ~n~0); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,405 INFO L256 TraceCheckUtils]: 40: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {3393#true} is VALID [2018-11-18 22:16:57,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {3393#true} ~cond := #in~cond; {3393#true} is VALID [2018-11-18 22:16:57,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {3393#true} assume !(0bv32 == ~cond); {3393#true} is VALID [2018-11-18 22:16:57,405 INFO L273 TraceCheckUtils]: 43: Hoare triple {3393#true} assume true; {3393#true} is VALID [2018-11-18 22:16:57,414 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3393#true} {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #223#return; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} call write~intFLOATTYPE8(~w~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(8bv32, ~i~0)), 8bv32); {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {3413#(= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~n~0);~w~0 := ~Pluszero~DOUBLE();~j~0 := 0bv32; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !(~i~0 == ~j~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,420 INFO L273 TraceCheckUtils]: 57: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,420 INFO L273 TraceCheckUtils]: 58: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,422 INFO L273 TraceCheckUtils]: 61: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,423 INFO L273 TraceCheckUtils]: 62: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,423 INFO L273 TraceCheckUtils]: 63: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !(~i~0 == ~j~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,442 INFO L273 TraceCheckUtils]: 68: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,443 INFO L273 TraceCheckUtils]: 69: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,443 INFO L273 TraceCheckUtils]: 70: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,443 INFO L273 TraceCheckUtils]: 71: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume ~i~0 == ~j~0;call #t~mem2 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(~roundNearestTiesToEven, #t~mem2, ~to_fp~DOUBLE(~roundNearestTiesToEven, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);havoc #t~mem2; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,444 INFO L273 TraceCheckUtils]: 72: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,444 INFO L273 TraceCheckUtils]: 73: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,444 INFO L273 TraceCheckUtils]: 74: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !!~bvsle32(~j~0, ~n~0);call write~intFLOATTYPE8(~convertINTToDOUBLE(~roundNearestTiesToEven, ~bvadd32(~bvadd32(1bv32, ~i~0), ~bvadd32(1bv32, ~j~0))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !(~i~0 == ~j~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,445 INFO L273 TraceCheckUtils]: 77: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call #t~mem3 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, ~i~0)), ~bvmul32(8bv32, ~j~0)), 8bv32);~w~0 := ~fp.add~DOUBLE(~roundNearestTiesToEven, ~w~0, #t~mem3);havoc #t~mem3; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,446 INFO L273 TraceCheckUtils]: 79: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume true; {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,446 INFO L273 TraceCheckUtils]: 80: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} assume !~bvsle32(~j~0, ~n~0); {3543#(bvsle main_~i~0 (_ bv5 32))} is VALID [2018-11-18 22:16:57,448 INFO L256 TraceCheckUtils]: 81: Hoare triple {3543#(bvsle main_~i~0 (_ bv5 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 50bv32) then 1bv32 else 0bv32)); {3643#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,449 INFO L273 TraceCheckUtils]: 82: Hoare triple {3643#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3647#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:16:57,450 INFO L273 TraceCheckUtils]: 83: Hoare triple {3647#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3394#false} is VALID [2018-11-18 22:16:57,450 INFO L273 TraceCheckUtils]: 84: Hoare triple {3394#false} assume !false; {3394#false} is VALID [2018-11-18 22:16:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 2 proven. 207 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-18 22:16:57,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:16:57,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:16:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 22:16:57,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-18 22:16:57,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:16:57,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:16:57,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:16:57,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:16:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:16:57,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:16:57,954 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand 6 states. [2018-11-18 22:17:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:17:00,401 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-18 22:17:00,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:17:00,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-18 22:17:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:17:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:17:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-18 22:17:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:17:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-18 22:17:00,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2018-11-18 22:17:00,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:17:00,594 INFO L225 Difference]: With dead ends: 136 [2018-11-18 22:17:00,595 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 22:17:00,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:17:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 22:17:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 22:17:00,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:17:00,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 22:17:00,596 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:17:00,597 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:17:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:17:00,599 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:17:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:17:00,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:17:00,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:17:00,599 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:17:00,600 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:17:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:17:00,600 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:17:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:17:00,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:17:00,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:17:00,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:17:00,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:17:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 22:17:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 22:17:00,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-11-18 22:17:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:17:00,601 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 22:17:00,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:17:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:17:00,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:17:00,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 22:17:00,892 INFO L425 ceAbstractionStarter]: For program point L44-1(lines 44 62) no Hoare annotation was computed. [2018-11-18 22:17:00,893 INFO L425 ceAbstractionStarter]: For program point L44-3(lines 44 62) no Hoare annotation was computed. [2018-11-18 22:17:00,893 INFO L428 ceAbstractionStarter]: At program point L44-4(lines 44 62) the Hoare annotation is: true [2018-11-18 22:17:00,893 INFO L425 ceAbstractionStarter]: For program point L44-5(lines 44 62) no Hoare annotation was computed. [2018-11-18 22:17:00,893 INFO L425 ceAbstractionStarter]: For program point ludcmpEXIT(lines 39 80) no Hoare annotation was computed. [2018-11-18 22:17:00,894 INFO L428 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: true [2018-11-18 22:17:00,894 INFO L425 ceAbstractionStarter]: For program point L46-1(line 46) no Hoare annotation was computed. [2018-11-18 22:17:00,894 INFO L428 ceAbstractionStarter]: At program point ludcmpENTRY(lines 39 80) the Hoare annotation is: true [2018-11-18 22:17:00,894 INFO L425 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2018-11-18 22:17:00,894 INFO L425 ceAbstractionStarter]: For program point L55-3(lines 55 61) no Hoare annotation was computed. [2018-11-18 22:17:00,894 INFO L428 ceAbstractionStarter]: At program point L55-4(lines 55 61) the Hoare annotation is: true [2018-11-18 22:17:00,894 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 54) no Hoare annotation was computed. [2018-11-18 22:17:00,894 INFO L425 ceAbstractionStarter]: For program point L47-3(lines 47 54) no Hoare annotation was computed. [2018-11-18 22:17:00,894 INFO L428 ceAbstractionStarter]: At program point L47-4(lines 47 54) the Hoare annotation is: true [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L47-5(lines 47 54) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point ludcmpFINAL(lines 39 80) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 72 78) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L72-3(lines 72 78) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L428 ceAbstractionStarter]: At program point L72-4(lines 72 78) the Hoare annotation is: true [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L72-5(lines 72 78) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 64 70) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L64-3(lines 64 70) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L428 ceAbstractionStarter]: At program point L64-4(lines 64 70) the Hoare annotation is: true [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L64-5(lines 64 70) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L58-1(lines 58 59) no Hoare annotation was computed. [2018-11-18 22:17:00,895 INFO L425 ceAbstractionStarter]: For program point L58-3(lines 58 59) no Hoare annotation was computed. [2018-11-18 22:17:00,896 INFO L428 ceAbstractionStarter]: At program point L58-4(lines 58 59) the Hoare annotation is: true [2018-11-18 22:17:00,896 INFO L425 ceAbstractionStarter]: For program point L58-5(lines 58 59) no Hoare annotation was computed. [2018-11-18 22:17:00,896 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-18 22:17:00,896 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 50 52) no Hoare annotation was computed. [2018-11-18 22:17:00,896 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 75 76) no Hoare annotation was computed. [2018-11-18 22:17:00,896 INFO L425 ceAbstractionStarter]: For program point L75-3(lines 75 76) no Hoare annotation was computed. [2018-11-18 22:17:00,896 INFO L428 ceAbstractionStarter]: At program point L75-4(lines 75 76) the Hoare annotation is: true [2018-11-18 22:17:00,896 INFO L425 ceAbstractionStarter]: For program point L75-5(lines 75 76) no Hoare annotation was computed. [2018-11-18 22:17:00,896 INFO L425 ceAbstractionStarter]: For program point L67-1(lines 67 68) no Hoare annotation was computed. [2018-11-18 22:17:00,897 INFO L425 ceAbstractionStarter]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2018-11-18 22:17:00,897 INFO L428 ceAbstractionStarter]: At program point L67-4(lines 67 68) the Hoare annotation is: true [2018-11-18 22:17:00,897 INFO L425 ceAbstractionStarter]: For program point L67-5(lines 67 68) no Hoare annotation was computed. [2018-11-18 22:17:00,897 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 51 52) no Hoare annotation was computed. [2018-11-18 22:17:00,897 INFO L425 ceAbstractionStarter]: For program point L51-3(lines 51 52) no Hoare annotation was computed. [2018-11-18 22:17:00,897 INFO L428 ceAbstractionStarter]: At program point L51-4(lines 51 52) the Hoare annotation is: true [2018-11-18 22:17:00,897 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-18 22:17:00,897 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 22:17:00,897 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 22:17:00,897 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:17:00,898 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 15) no Hoare annotation was computed. [2018-11-18 22:17:00,898 INFO L425 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2018-11-18 22:17:00,898 INFO L425 ceAbstractionStarter]: For program point fabsEXIT(lines 11 17) no Hoare annotation was computed. [2018-11-18 22:17:00,898 INFO L428 ceAbstractionStarter]: At program point fabsENTRY(lines 11 17) the Hoare annotation is: true [2018-11-18 22:17:00,898 INFO L425 ceAbstractionStarter]: For program point fabsFINAL(lines 11 17) no Hoare annotation was computed. [2018-11-18 22:17:00,898 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:17:00,898 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 22:17:00,898 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 22:17:00,898 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L425 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 18 38) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32)) [2018-11-18 22:17:00,899 INFO L428 ceAbstractionStarter]: At program point L23-5(lines 23 34) the Hoare annotation is: true [2018-11-18 22:17:00,899 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 18 38) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L425 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-11-18 22:17:00,899 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 18 38) the Hoare annotation is: true [2018-11-18 22:17:00,900 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2018-11-18 22:17:00,900 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 31) no Hoare annotation was computed. [2018-11-18 22:17:00,900 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 31) the Hoare annotation is: (and (bvsle main_~i~0 (_ bv5 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))) [2018-11-18 22:17:00,900 INFO L421 ceAbstractionStarter]: At program point L26-5(lines 26 31) the Hoare annotation is: (and (bvsle main_~i~0 (_ bv5 32)) (= (bvadd main_~n~0 (_ bv4294967291 32)) (_ bv0 32))) [2018-11-18 22:17:00,900 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-18 22:17:00,900 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 22:17:00,900 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 22:17:00,901 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:17:00,901 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 22:17:00,901 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 22:17:00,901 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:17:00,903 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-18 22:17:00,903 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 22:17:00,903 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:17:00,904 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2018-11-18 22:17:00,905 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-11-18 22:17:00,906 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2018-11-18 22:17:00,906 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2018-11-18 22:17:00,906 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2018-11-18 22:17:00,906 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: L64-5 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-18 22:17:00,909 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L64-5 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L47-5 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2018-11-18 22:17:00,910 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L72-5 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L47-5 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L72-5 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-18 22:17:00,911 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L64-3 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L75-5 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L75-5 has no Hoare annotation [2018-11-18 22:17:00,912 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L58-5 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L72-3 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L58-5 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L58-3 has no Hoare annotation [2018-11-18 22:17:00,913 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2018-11-18 22:17:00,913 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 22:17:00,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:17:00 BoogieIcfgContainer [2018-11-18 22:17:00,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:17:00,925 INFO L168 Benchmark]: Toolchain (without parser) took 91655.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 854.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -408.5 MB). Peak memory consumption was 446.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:17:00,927 INFO L168 Benchmark]: CDTParser took 0.21 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-11-18 22:17:00,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.16 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 22:17:00,928 INFO L168 Benchmark]: Boogie Preprocessor took 174.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:17:00,929 INFO L168 Benchmark]: RCFGBuilder took 15750.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2018-11-18 22:17:00,929 INFO L168 Benchmark]: TraceAbstraction took 75192.85 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 320.7 MB). Peak memory consumption was 440.3 MB. Max. memory is 7.1 GB. [2018-11-18 22:17:00,933 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 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 533.16 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 174.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 15750.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75192.85 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 320.7 MB). Peak memory consumption was 440.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 64]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ~bvsle32(i, 5bv32) && ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ~bvadd64(n, 4294967291bv32) == 0bv32 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 75 locations, 1 error locations. SAFE Result, 75.0s OverallTime, 7 OverallIterations, 14 TraceHistogramMax, 64.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 208 SDslu, 390 SDs, 0 SdLazy, 429 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=6, 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.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 41 PreInvPairs, 79 NumberOfFragments, 41 HoareAnnotationTreeSize, 41 FomulaSimplifications, 511 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 380 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 518 ConstructedInterpolants, 0 QuantifiedInterpolants, 101252 SizeOfPredicates, 16 NumberOfNonLiveVariables, 717 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 1028/1528 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...