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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/avg10_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:14:08,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:14:08,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:14:08,768 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:14:08,769 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:14:08,770 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:14:08,771 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:14:08,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:14:08,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:14:08,777 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:14:08,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:14:08,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:14:08,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:14:08,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:14:08,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:14:08,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:14:08,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:14:08,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:14:08,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:14:08,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:14:08,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:14:08,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:14:08,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:14:08,807 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:14:08,807 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:14:08,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:14:08,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:14:08,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:14:08,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:14:08,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:14:08,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:14:08,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:14:08,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:14:08,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:14:08,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:14:08,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:14:08,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:14:08,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:14:08,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:14:08,831 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:14:08,831 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:14:08,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:14:08,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:14:08,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:14:08,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:14:08,832 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:14:08,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:14:08,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:14:08,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:14:08,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:14:08,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:14:08,834 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:14:08,834 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:14:08,834 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:14:08,834 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:14:08,834 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:14:08,835 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:14:08,835 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:14:08,835 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:14:08,835 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:14:08,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:14:08,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:14:08,836 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:14:08,836 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:14:08,836 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:14:08,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:14:08,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:14:08,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:14:08,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:14:08,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:14:08,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:14:08,902 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:14:08,902 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:14:08,903 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg10_true-unreach-call_true-termination.i [2018-11-23 12:14:08,967 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50675320/c14096d2b9ae4557a2cfbb771e4951b0/FLAG4f7d68c65 [2018-11-23 12:14:09,412 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:14:09,413 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg10_true-unreach-call_true-termination.i [2018-11-23 12:14:09,420 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50675320/c14096d2b9ae4557a2cfbb771e4951b0/FLAG4f7d68c65 [2018-11-23 12:14:09,765 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a50675320/c14096d2b9ae4557a2cfbb771e4951b0 [2018-11-23 12:14:09,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:14:09,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:14:09,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:14:09,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:14:09,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:14:09,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:14:09" (1/1) ... [2018-11-23 12:14:09,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7352567a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:09, skipping insertion in model container [2018-11-23 12:14:09,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:14:09" (1/1) ... [2018-11-23 12:14:09,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:14:09,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:14:10,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:14:10,118 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:14:10,148 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:14:10,166 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:14:10,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10 WrapperNode [2018-11-23 12:14:10,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:14:10,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:14:10,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:14:10,168 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:14:10,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:14:10,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:14:10,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:14:10,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:14:10,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (1/1) ... [2018-11-23 12:14:10,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:14:10,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:14:10,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:14:10,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:14:10,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (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-23 12:14:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:14:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:14:10,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:14:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2018-11-23 12:14:10,365 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2018-11-23 12:14:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:14:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:14:10,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:14:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:14:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:14:10,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:14:10,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:14:11,041 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:14:11,042 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:14:11,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:11 BoogieIcfgContainer [2018-11-23 12:14:11,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:14:11,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:14:11,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:14:11,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:14:11,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:14:09" (1/3) ... [2018-11-23 12:14:11,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfebe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:14:11, skipping insertion in model container [2018-11-23 12:14:11,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:14:10" (2/3) ... [2018-11-23 12:14:11,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfebe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:14:11, skipping insertion in model container [2018-11-23 12:14:11,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:14:11" (3/3) ... [2018-11-23 12:14:11,054 INFO L112 eAbstractionObserver]: Analyzing ICFG avg10_true-unreach-call_true-termination.i [2018-11-23 12:14:11,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:14:11,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:14:11,092 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:14:11,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:14:11,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:14:11,126 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:14:11,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:14:11,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:14:11,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:14:11,127 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:14:11,127 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:14:11,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:14:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:14:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:14:11,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:11,157 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:11,159 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:11,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 12:14:11,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:11,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:11,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:11,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:11,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:11,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:14:11,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-23 12:14:11,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:14:11,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:14:11,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:14:11,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:14:11,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:14:11,359 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:14:11,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:14:11,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 10); {34#true} is VALID [2018-11-23 12:14:11,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:14:11,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:14:11,361 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:14:11,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:14:11,363 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:14:11,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:14:11,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 10); {34#true} is VALID [2018-11-23 12:14:11,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:14:11,364 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:14:11,365 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:14:11,365 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {35#false} is VALID [2018-11-23 12:14:11,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:14:11,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:14:11,366 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:14:11,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {34#true} is VALID [2018-11-23 12:14:11,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 10); {34#true} is VALID [2018-11-23 12:14:11,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:14:11,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:14:11,367 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:14:11,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 12:14:11,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 12:14:11,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:14:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:14:11,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:11,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:14:11,383 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:14:11,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:11,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:14:11,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:11,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:14:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:14:11,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:14:11,640 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:14:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:11,755 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:14:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:14:11,755 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:14:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:14:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:14:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:14:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:14:11,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:14:12,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:12,040 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:14:12,040 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:14:12,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:14:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:14:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:14:12,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:12,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:14:12,091 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:14:12,091 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:14:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:12,097 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:14:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:14:12,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:12,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:12,100 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:14:12,100 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:14:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:12,107 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:14:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:14:12,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:12,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:12,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:12,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:14:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:14:12,118 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:14:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:12,118 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:14:12,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:14:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:14:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:14:12,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:12,121 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:12,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:12,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 12:14:12,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:12,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:12,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:12,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:12,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:12,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:14:12,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {198#true} is VALID [2018-11-23 12:14:12,423 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:14:12,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:14:12,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret12 := main(); {198#true} is VALID [2018-11-23 12:14:12,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:14:12,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 10); {199#false} is VALID [2018-11-23 12:14:12,440 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:14:12,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {198#true} is VALID [2018-11-23 12:14:12,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 10); {198#true} is VALID [2018-11-23 12:14:12,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:14:12,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:14:12,441 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:14:12,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {199#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:14:12,442 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:14:12,442 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {198#true} is VALID [2018-11-23 12:14:12,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 10); {198#true} is VALID [2018-11-23 12:14:12,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:14:12,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:14:12,443 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:14:12,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {199#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {199#false} is VALID [2018-11-23 12:14:12,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 9); {199#false} is VALID [2018-11-23 12:14:12,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:14:12,444 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:14:12,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {198#true} is VALID [2018-11-23 12:14:12,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 10); {198#true} is VALID [2018-11-23 12:14:12,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:14:12,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:14:12,446 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:14:12,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {199#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {199#false} is VALID [2018-11-23 12:14:12,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {199#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {199#false} is VALID [2018-11-23 12:14:12,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:14:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:14:12,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:12,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:14:12,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:14:12,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:12,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:14:12,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:12,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:14:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:14:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:14:12,536 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:14:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:13,053 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:14:13,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:14:13,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:14:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:14:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:14:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:14:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:14:13,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:14:13,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:13,246 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:14:13,246 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:14:13,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:14:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:14:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:14:13,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:13,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:14:13,262 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:14:13,263 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:14:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:13,267 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:14:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:14:13,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:13,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:13,268 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:14:13,268 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:14:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:13,272 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:14:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:14:13,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:13,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:13,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:13,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:14:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:14:13,276 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:14:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:13,276 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:14:13,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:14:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:14:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:14:13,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:13,278 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:13,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:13,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:13,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 12:14:13,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:13,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:13,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:13,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:13,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:13,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:14:13,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:14:13,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:14:13,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:14:13,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:14:13,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:14:13,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:14:13,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {362#true} is VALID [2018-11-23 12:14:13,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10); {362#true} is VALID [2018-11-23 12:14:13,458 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:14:13,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {364#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:13,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= avg_~i~0 0)} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:14:13,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:14:13,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:14:13,460 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:14:13,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:14:13,461 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:14:13,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {362#true} is VALID [2018-11-23 12:14:13,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 10); {362#true} is VALID [2018-11-23 12:14:13,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:14:13,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:14:13,462 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:14:13,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {363#false} is VALID [2018-11-23 12:14:13,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9); {363#false} is VALID [2018-11-23 12:14:13,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:14:13,464 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:14:13,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {362#true} is VALID [2018-11-23 12:14:13,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 10); {362#true} is VALID [2018-11-23 12:14:13,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:14:13,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:14:13,465 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:14:13,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {363#false} is VALID [2018-11-23 12:14:13,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {363#false} is VALID [2018-11-23 12:14:13,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:14:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:14:13,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:13,469 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:13,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:13,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:13,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:14:13,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:14:13,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:14:13,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:14:13,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:14:13,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:14:13,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {362#true} is VALID [2018-11-23 12:14:13,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {362#true} is VALID [2018-11-23 12:14:13,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10); {362#true} is VALID [2018-11-23 12:14:13,684 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:14:13,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {398#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:13,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= avg_~i~0 0)} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:14:13,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:14:13,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:14:13,691 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:14:13,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:14:13,692 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:14:13,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {363#false} is VALID [2018-11-23 12:14:13,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:14:13,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:14:13,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:14:13,693 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:14:13,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {363#false} is VALID [2018-11-23 12:14:13,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9); {363#false} is VALID [2018-11-23 12:14:13,694 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:14:13,694 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:14:13,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {363#false} is VALID [2018-11-23 12:14:13,695 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:14:13,695 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:14:13,696 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:14:13,696 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:14:13,696 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {363#false} is VALID [2018-11-23 12:14:13,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {363#false} is VALID [2018-11-23 12:14:13,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:14:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:14:13,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:14:13,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:14:13,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:14:13,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:13,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:14:13,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:13,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:14:13,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:14:13,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:14:13,851 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:14:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:14,147 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:14:14,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:14:14,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:14:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:14:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:14:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:14:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:14:14,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:14:14,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:14,300 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:14:14,301 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:14:14,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-23 12:14:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:14:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:14:14,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:14,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:14:14,316 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:14:14,316 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:14:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:14,320 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:14:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:14:14,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:14,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:14,321 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:14:14,321 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:14:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:14,324 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:14:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:14:14,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:14,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:14,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:14,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:14:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:14:14,328 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:14:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:14,328 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:14:14,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:14:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:14:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:14:14,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:14,330 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:14,331 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:14,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2018-11-23 12:14:14,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:14,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:14,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:14,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:14:14,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {630#true} is VALID [2018-11-23 12:14:14,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:14:14,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:14:14,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret12 := main(); {630#true} is VALID [2018-11-23 12:14:14,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:14:14,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {630#true} is VALID [2018-11-23 12:14:14,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {630#true} is VALID [2018-11-23 12:14:14,435 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 10); {630#true} is VALID [2018-11-23 12:14:14,436 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:14:14,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {630#true} is VALID [2018-11-23 12:14:14,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:14:14,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {630#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#true} is VALID [2018-11-23 12:14:14,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 10); {630#true} is VALID [2018-11-23 12:14:14,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:14:14,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:14:14,437 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:14:14,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {630#true} is VALID [2018-11-23 12:14:14,438 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:14:14,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {630#true} is VALID [2018-11-23 12:14:14,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:14:14,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {630#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#true} is VALID [2018-11-23 12:14:14,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 10); {630#true} is VALID [2018-11-23 12:14:14,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:14:14,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:14:14,440 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:14:14,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {630#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {632#(= main_~i~2 0)} is VALID [2018-11-23 12:14:14,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 9); {631#false} is VALID [2018-11-23 12:14:14,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:14:14,447 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:14:14,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {630#true} is VALID [2018-11-23 12:14:14,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {630#true} is VALID [2018-11-23 12:14:14,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {630#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#true} is VALID [2018-11-23 12:14:14,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 10); {630#true} is VALID [2018-11-23 12:14:14,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:14:14,448 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:14:14,449 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:14:14,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {631#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {631#false} is VALID [2018-11-23 12:14:14,449 INFO L273 TraceCheckUtils]: 38: Hoare triple {631#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {631#false} is VALID [2018-11-23 12:14:14,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:14:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:14:14,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:14:14,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:14:14,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:14:14,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:14,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:14:14,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:14,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:14:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:14:14,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:14:14,526 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:14:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:14,625 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:14:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:14:14,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:14:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:14:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:14:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:14:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:14:14,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:14:14,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:14,726 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:14:14,726 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:14:14,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:14:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:14:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:14:14,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:14,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:14:14,747 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:14:14,747 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:14:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:14,749 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:14:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:14:14,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:14,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:14,751 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:14:14,751 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:14:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:14,753 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:14:14,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:14:14,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:14,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:14,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:14,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:14:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:14:14,757 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:14:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:14,757 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:14:14,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:14:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:14:14,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:14:14,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:14,759 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:14,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:14,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:14,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2018-11-23 12:14:14,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:14,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:14,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:14,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:14,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:14,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:14:14,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:14:14,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:14:14,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:14:14,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:14:14,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:14:14,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:14:14,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:14,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10); {800#false} is VALID [2018-11-23 12:14:14,956 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:14:14,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {799#true} is VALID [2018-11-23 12:14:14,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:14:14,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {799#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {799#true} is VALID [2018-11-23 12:14:14,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 10); {799#true} is VALID [2018-11-23 12:14:14,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:14:14,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:14:14,958 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:14:14,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:14:14,959 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:14:14,959 INFO L273 TraceCheckUtils]: 19: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {799#true} is VALID [2018-11-23 12:14:14,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:14:14,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {799#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {799#true} is VALID [2018-11-23 12:14:14,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 10); {799#true} is VALID [2018-11-23 12:14:14,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:14:14,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:14:14,960 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:14:14,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {800#false} is VALID [2018-11-23 12:14:14,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:14:14,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {800#false} is VALID [2018-11-23 12:14:14,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9); {800#false} is VALID [2018-11-23 12:14:14,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:14:14,962 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:14:14,962 INFO L273 TraceCheckUtils]: 32: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {799#true} is VALID [2018-11-23 12:14:14,963 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {799#true} is VALID [2018-11-23 12:14:14,963 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {799#true} is VALID [2018-11-23 12:14:14,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 10); {799#true} is VALID [2018-11-23 12:14:14,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:14:14,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:14:14,964 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:14:14,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {800#false} is VALID [2018-11-23 12:14:14,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {800#false} is VALID [2018-11-23 12:14:14,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:14:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:14:14,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:14,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:14,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:15,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:15,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:14:15,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:14:15,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:14:15,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:14:15,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:14:15,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:15,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:15,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:15,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10); {800#false} is VALID [2018-11-23 12:14:15,373 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:14:15,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {800#false} is VALID [2018-11-23 12:14:15,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:14:15,374 INFO L273 TraceCheckUtils]: 12: Hoare triple {800#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {800#false} is VALID [2018-11-23 12:14:15,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 10); {800#false} is VALID [2018-11-23 12:14:15,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:14:15,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:14:15,375 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:14:15,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:14:15,376 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:14:15,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {800#false} is VALID [2018-11-23 12:14:15,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:14:15,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {800#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {800#false} is VALID [2018-11-23 12:14:15,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 10); {800#false} is VALID [2018-11-23 12:14:15,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:14:15,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:14:15,378 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:14:15,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {800#false} is VALID [2018-11-23 12:14:15,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {800#false} is VALID [2018-11-23 12:14:15,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {800#false} is VALID [2018-11-23 12:14:15,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9); {800#false} is VALID [2018-11-23 12:14:15,379 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:14:15,380 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:14:15,380 INFO L273 TraceCheckUtils]: 32: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {800#false} is VALID [2018-11-23 12:14:15,380 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {800#false} is VALID [2018-11-23 12:14:15,380 INFO L273 TraceCheckUtils]: 34: Hoare triple {800#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {800#false} is VALID [2018-11-23 12:14:15,380 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 10); {800#false} is VALID [2018-11-23 12:14:15,381 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:14:15,381 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:14:15,381 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:14:15,381 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {800#false} is VALID [2018-11-23 12:14:15,382 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {800#false} is VALID [2018-11-23 12:14:15,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:14:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:14:15,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:14:15,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:14:15,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:15,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:14:15,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:14:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:14:15,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:14:15,474 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:14:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:15,809 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:14:15,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:14:15,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:14:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:14:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:14:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:14:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:14:15,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:14:15,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:15,936 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:14:15,936 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:14:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:14:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:14:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:14:16,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:16,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:14:16,018 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:14:16,018 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:14:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:16,020 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:14:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:14:16,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:16,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:16,021 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:14:16,022 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:14:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:16,024 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:14:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:14:16,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:16,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:16,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:16,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:14:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:14:16,028 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:14:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:16,028 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:14:16,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:14:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:14:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:14:16,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:16,030 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:16,030 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:16,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:16,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2018-11-23 12:14:16,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:16,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:16,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:16,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:16,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:16,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:14:16,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:14:16,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:14:16,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:14:16,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:14:16,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:14:16,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:14:16,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:16,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:16,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:16,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10); {1115#false} is VALID [2018-11-23 12:14:16,195 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:14:16,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1114#true} is VALID [2018-11-23 12:14:16,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:14:16,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1114#true} is VALID [2018-11-23 12:14:16,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 10); {1114#true} is VALID [2018-11-23 12:14:16,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:14:16,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:14:16,198 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:14:16,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:14:16,199 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:14:16,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1114#true} is VALID [2018-11-23 12:14:16,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:14:16,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1114#true} is VALID [2018-11-23 12:14:16,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 10); {1114#true} is VALID [2018-11-23 12:14:16,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:14:16,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:14:16,201 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:14:16,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:14:16,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:14:16,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1115#false} is VALID [2018-11-23 12:14:16,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9); {1115#false} is VALID [2018-11-23 12:14:16,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:14:16,203 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:14:16,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1114#true} is VALID [2018-11-23 12:14:16,203 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1114#true} is VALID [2018-11-23 12:14:16,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {1114#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1114#true} is VALID [2018-11-23 12:14:16,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 10); {1114#true} is VALID [2018-11-23 12:14:16,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:14:16,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:14:16,204 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:14:16,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1115#false} is VALID [2018-11-23 12:14:16,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:14:16,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:14:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:14:16,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:16,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:16,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:14:16,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:14:16,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:16,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:16,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:14:16,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:14:16,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:14:16,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:14:16,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:14:16,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:16,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:16,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {1137#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:16,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:16,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:16,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10); {1115#false} is VALID [2018-11-23 12:14:16,394 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:14:16,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1115#false} is VALID [2018-11-23 12:14:16,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:14:16,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {1115#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1115#false} is VALID [2018-11-23 12:14:16,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 10); {1115#false} is VALID [2018-11-23 12:14:16,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:14:16,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:14:16,395 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:14:16,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:14:16,396 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:14:16,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1115#false} is VALID [2018-11-23 12:14:16,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:14:16,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {1115#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1115#false} is VALID [2018-11-23 12:14:16,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 10); {1115#false} is VALID [2018-11-23 12:14:16,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:14:16,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:14:16,397 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:14:16,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:14:16,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1115#false} is VALID [2018-11-23 12:14:16,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1115#false} is VALID [2018-11-23 12:14:16,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9); {1115#false} is VALID [2018-11-23 12:14:16,398 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:14:16,398 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:14:16,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1115#false} is VALID [2018-11-23 12:14:16,399 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1115#false} is VALID [2018-11-23 12:14:16,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {1115#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1115#false} is VALID [2018-11-23 12:14:16,399 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 10); {1115#false} is VALID [2018-11-23 12:14:16,399 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:14:16,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:14:16,400 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:14:16,400 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1115#false} is VALID [2018-11-23 12:14:16,400 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:14:16,400 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:14:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:14:16,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:16,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:14:16,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:14:16,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:16,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:14:16,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:16,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:14:16,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:14:16,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:14:16,475 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:14:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:16,650 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:14:16,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:14:16,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:14:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:14:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:14:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:14:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:14:16,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:14:16,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:16,844 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:14:16,844 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:14:16,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:14:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:14:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:14:16,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:16,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:14:16,863 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:14:16,863 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:14:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:16,867 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:14:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:14:16,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:16,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:16,868 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:14:16,868 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:14:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:16,870 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:14:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:14:16,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:16,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:16,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:16,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:14:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:14:16,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:14:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:16,874 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:14:16,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:14:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:14:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:14:16,875 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:16,875 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:16,876 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:16,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:16,876 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2018-11-23 12:14:16,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:16,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:16,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:16,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:16,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:17,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:14:17,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:14:17,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:14:17,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:14:17,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:14:17,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:14:17,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:14:17,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {1448#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:17,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:17,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:17,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:17,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1451#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:17,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 10); {1447#false} is VALID [2018-11-23 12:14:17,161 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:14:17,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:14:17,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:14:17,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:14:17,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:14:17,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:14:17,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:14:17,163 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:14:17,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {1447#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:14:17,164 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:14:17,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:14:17,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:14:17,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:14:17,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:14:17,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:14:17,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:14:17,166 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:14:17,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {1447#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1447#false} is VALID [2018-11-23 12:14:17,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1447#false} is VALID [2018-11-23 12:14:17,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {1447#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1447#false} is VALID [2018-11-23 12:14:17,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 9); {1447#false} is VALID [2018-11-23 12:14:17,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:14:17,167 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:14:17,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:14:17,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:14:17,168 INFO L273 TraceCheckUtils]: 38: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:14:17,168 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:14:17,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:14:17,169 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:14:17,169 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:14:17,169 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1447#false} is VALID [2018-11-23 12:14:17,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:14:17,170 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:14:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:14:17,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:17,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:17,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:14:17,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:14:17,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:17,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:17,872 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:14:17,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:14:17,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:14:17,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:14:17,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:14:17,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:14:17,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:14:17,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1446#true} is VALID [2018-11-23 12:14:17,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:14:17,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {1446#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1446#true} is VALID [2018-11-23 12:14:17,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1446#true} is VALID [2018-11-23 12:14:17,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {1446#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1446#true} is VALID [2018-11-23 12:14:17,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 10); {1446#true} is VALID [2018-11-23 12:14:17,876 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:14:17,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:14:17,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:14:17,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:14:17,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:14:17,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:14:17,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:14:17,877 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:14:17,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {1446#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:14:17,878 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:14:17,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1446#true} is VALID [2018-11-23 12:14:17,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1446#true} is VALID [2018-11-23 12:14:17,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1446#true} is VALID [2018-11-23 12:14:17,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:14:17,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:14:17,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:14:17,879 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:14:17,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {1446#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1446#true} is VALID [2018-11-23 12:14:17,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1446#true} is VALID [2018-11-23 12:14:17,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {1446#true} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1446#true} is VALID [2018-11-23 12:14:17,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 9); {1446#true} is VALID [2018-11-23 12:14:17,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:14:17,881 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:14:17,882 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1563#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:17,882 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1563#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:17,883 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:17,883 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= avg_~i~0 1)} assume !(~i~0 < 10); {1447#false} is VALID [2018-11-23 12:14:17,884 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:14:17,884 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:14:17,884 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:14:17,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1447#false} is VALID [2018-11-23 12:14:17,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:14:17,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:14:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:14:17,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:17,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:14:17,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:14:17,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:17,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:14:18,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:18,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:14:18,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:14:18,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:18,023 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:14:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,435 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:14:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:14:18,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:14:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:14:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:14:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:14:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:14:18,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:14:18,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:18,633 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:14:18,633 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:14:18,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:14:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:14:18,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:18,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:14:18,652 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:14:18,652 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:14:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,655 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:14:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:14:18,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:18,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:18,656 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:14:18,656 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:14:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:18,658 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:14:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:14:18,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:18,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:18,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:18,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:14:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:14:18,661 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:14:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:18,661 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:14:18,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:14:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:14:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:14:18,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:18,663 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:18,663 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:18,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:18,663 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2018-11-23 12:14:18,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:18,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:18,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:14:18,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:14:18,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:14:18,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:14:18,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:14:18,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:14:18,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:14:18,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {1811#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:18,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:18,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:18,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:18,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:18,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:18,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:18,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10); {1810#false} is VALID [2018-11-23 12:14:18,998 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:14:18,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1809#true} is VALID [2018-11-23 12:14:18,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:14:18,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:14:18,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:14:19,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:14:19,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 10); {1809#true} is VALID [2018-11-23 12:14:19,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:14:19,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:14:19,001 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:14:19,001 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:14:19,001 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:14:19,001 INFO L273 TraceCheckUtils]: 27: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1809#true} is VALID [2018-11-23 12:14:19,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:14:19,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:14:19,002 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:14:19,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:14:19,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 10); {1809#true} is VALID [2018-11-23 12:14:19,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:14:19,002 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:14:19,003 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:14:19,003 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:14:19,003 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:14:19,003 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1810#false} is VALID [2018-11-23 12:14:19,003 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9); {1810#false} is VALID [2018-11-23 12:14:19,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:14:19,004 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:14:19,004 INFO L273 TraceCheckUtils]: 42: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1809#true} is VALID [2018-11-23 12:14:19,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:14:19,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:14:19,004 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1809#true} is VALID [2018-11-23 12:14:19,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {1809#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1809#true} is VALID [2018-11-23 12:14:19,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 10); {1809#true} is VALID [2018-11-23 12:14:19,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:14:19,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:14:19,005 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:14:19,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1810#false} is VALID [2018-11-23 12:14:19,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:14:19,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:14:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:14:19,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:19,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:19,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:14:19,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:14:19,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:19,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:19,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:14:19,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:14:19,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:14:19,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:14:19,194 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:14:19,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1809#true} is VALID [2018-11-23 12:14:19,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {1809#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 12:14:19,194 INFO L273 TraceCheckUtils]: 7: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1809#true} is VALID [2018-11-23 12:14:19,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {1809#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 12:14:19,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1809#true} is VALID [2018-11-23 12:14:19,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {1809#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 12:14:19,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1809#true} is VALID [2018-11-23 12:14:19,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {1809#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {1809#true} is VALID [2018-11-23 12:14:19,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {1809#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1809#true} is VALID [2018-11-23 12:14:19,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {1809#true} assume !(~i~1 < 10); {1809#true} is VALID [2018-11-23 12:14:19,196 INFO L256 TraceCheckUtils]: 15: Hoare triple {1809#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:14:19,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1867#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:19,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {1867#(<= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1867#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:19,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {1867#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1874#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:19,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {1874#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1874#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:19,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {1874#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1881#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:19,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {1881#(<= avg_~i~0 2)} assume !(~i~0 < 10); {1810#false} is VALID [2018-11-23 12:14:19,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:14:19,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:14:19,201 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1809#true} #70#return; {1810#false} is VALID [2018-11-23 12:14:19,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:14:19,202 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:14:19,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1810#false} is VALID [2018-11-23 12:14:19,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:14:19,202 INFO L273 TraceCheckUtils]: 29: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:14:19,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:14:19,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:14:19,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 10); {1810#false} is VALID [2018-11-23 12:14:19,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:14:19,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:14:19,204 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:14:19,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:14:19,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {1810#false} is VALID [2018-11-23 12:14:19,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {1810#false} is VALID [2018-11-23 12:14:19,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9); {1810#false} is VALID [2018-11-23 12:14:19,205 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:14:19,205 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:14:19,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1810#false} is VALID [2018-11-23 12:14:19,206 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:14:19,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:14:19,206 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {1810#false} is VALID [2018-11-23 12:14:19,206 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1810#false} is VALID [2018-11-23 12:14:19,206 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 10); {1810#false} is VALID [2018-11-23 12:14:19,206 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:14:19,207 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:14:19,207 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:14:19,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {1810#false} is VALID [2018-11-23 12:14:19,207 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:14:19,207 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:14:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-23 12:14:19,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:19,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-23 12:14:19,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-23 12:14:19,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:19,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:14:19,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:19,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:14:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:14:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:19,334 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 10 states. [2018-11-23 12:14:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:19,963 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-23 12:14:19,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:14:19,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-23 12:14:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:14:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:14:19,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2018-11-23 12:14:20,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:20,118 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:14:20,118 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:14:20,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:14:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 12:14:20,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:20,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 12:14:20,154 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 12:14:20,154 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 12:14:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:20,157 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-23 12:14:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:14:20,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:20,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:20,158 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 12:14:20,158 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 12:14:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:20,160 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-23 12:14:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:14:20,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:20,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:20,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:20,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:14:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 12:14:20,162 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 54 [2018-11-23 12:14:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:20,163 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 12:14:20,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:14:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:14:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:14:20,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:20,164 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:20,164 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:20,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1668458771, now seen corresponding path program 5 times [2018-11-23 12:14:20,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:20,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:20,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:20,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:20,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {2221#true} call ULTIMATE.init(); {2221#true} is VALID [2018-11-23 12:14:20,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {2221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2221#true} is VALID [2018-11-23 12:14:20,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:14:20,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2221#true} {2221#true} #66#return; {2221#true} is VALID [2018-11-23 12:14:20,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {2221#true} call #t~ret12 := main(); {2221#true} is VALID [2018-11-23 12:14:20,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {2221#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2223#(= main_~i~1 0)} is VALID [2018-11-23 12:14:20,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {2223#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2223#(= main_~i~1 0)} is VALID [2018-11-23 12:14:20,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {2223#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2224#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:20,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {2224#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2224#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:20,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {2224#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2225#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:20,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {2225#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2225#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:20,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {2225#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2226#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:20,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {2226#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2226#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:20,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {2226#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2227#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:20,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {2227#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2227#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:20,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {2227#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2228#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:20,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {2228#(<= main_~i~1 5)} assume !(~i~1 < 10); {2222#false} is VALID [2018-11-23 12:14:20,357 INFO L256 TraceCheckUtils]: 17: Hoare triple {2222#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:14:20,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {2221#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2221#true} is VALID [2018-11-23 12:14:20,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {2221#true} assume !(~i~0 < 10); {2221#true} is VALID [2018-11-23 12:14:20,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {2221#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2221#true} is VALID [2018-11-23 12:14:20,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:14:20,360 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2221#true} {2222#false} #70#return; {2222#false} is VALID [2018-11-23 12:14:20,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {2222#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2222#false} is VALID [2018-11-23 12:14:20,360 INFO L256 TraceCheckUtils]: 30: Hoare triple {2222#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:14:20,361 INFO L273 TraceCheckUtils]: 31: Hoare triple {2221#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2221#true} is VALID [2018-11-23 12:14:20,361 INFO L273 TraceCheckUtils]: 32: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,362 INFO L273 TraceCheckUtils]: 35: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,362 INFO L273 TraceCheckUtils]: 36: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {2221#true} assume !(~i~0 < 10); {2221#true} is VALID [2018-11-23 12:14:20,362 INFO L273 TraceCheckUtils]: 39: Hoare triple {2221#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2221#true} is VALID [2018-11-23 12:14:20,362 INFO L273 TraceCheckUtils]: 40: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:14:20,362 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2221#true} {2222#false} #72#return; {2222#false} is VALID [2018-11-23 12:14:20,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {2222#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2222#false} is VALID [2018-11-23 12:14:20,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {2222#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2222#false} is VALID [2018-11-23 12:14:20,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {2222#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2222#false} is VALID [2018-11-23 12:14:20,363 INFO L273 TraceCheckUtils]: 45: Hoare triple {2222#false} assume !(~i~2 < 9); {2222#false} is VALID [2018-11-23 12:14:20,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {2222#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2222#false} is VALID [2018-11-23 12:14:20,363 INFO L256 TraceCheckUtils]: 47: Hoare triple {2222#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:14:20,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {2221#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2221#true} is VALID [2018-11-23 12:14:20,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,364 INFO L273 TraceCheckUtils]: 51: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {2221#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2221#true} is VALID [2018-11-23 12:14:20,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {2221#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2221#true} is VALID [2018-11-23 12:14:20,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {2221#true} assume !(~i~0 < 10); {2221#true} is VALID [2018-11-23 12:14:20,365 INFO L273 TraceCheckUtils]: 56: Hoare triple {2221#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2221#true} is VALID [2018-11-23 12:14:20,365 INFO L273 TraceCheckUtils]: 57: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:14:20,365 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2221#true} {2222#false} #74#return; {2222#false} is VALID [2018-11-23 12:14:20,366 INFO L273 TraceCheckUtils]: 59: Hoare triple {2222#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2222#false} is VALID [2018-11-23 12:14:20,366 INFO L273 TraceCheckUtils]: 60: Hoare triple {2222#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2222#false} is VALID [2018-11-23 12:14:20,366 INFO L273 TraceCheckUtils]: 61: Hoare triple {2222#false} assume !false; {2222#false} is VALID [2018-11-23 12:14:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 12:14:20,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:20,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:20,386 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:14:20,464 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 12:14:20,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:20,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:20,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {2221#true} call ULTIMATE.init(); {2221#true} is VALID [2018-11-23 12:14:20,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {2221#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2221#true} is VALID [2018-11-23 12:14:20,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:14:20,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2221#true} {2221#true} #66#return; {2221#true} is VALID [2018-11-23 12:14:20,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {2221#true} call #t~ret12 := main(); {2221#true} is VALID [2018-11-23 12:14:20,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {2221#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2221#true} is VALID [2018-11-23 12:14:20,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {2221#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2221#true} is VALID [2018-11-23 12:14:20,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {2221#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2221#true} is VALID [2018-11-23 12:14:20,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {2221#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2221#true} is VALID [2018-11-23 12:14:20,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {2221#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2221#true} is VALID [2018-11-23 12:14:20,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {2221#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2221#true} is VALID [2018-11-23 12:14:20,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {2221#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2221#true} is VALID [2018-11-23 12:14:20,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {2221#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2221#true} is VALID [2018-11-23 12:14:20,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {2221#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2221#true} is VALID [2018-11-23 12:14:20,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {2221#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2221#true} is VALID [2018-11-23 12:14:20,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {2221#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2221#true} is VALID [2018-11-23 12:14:20,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {2221#true} assume !(~i~1 < 10); {2221#true} is VALID [2018-11-23 12:14:20,712 INFO L256 TraceCheckUtils]: 17: Hoare triple {2221#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:14:20,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {2221#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2286#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:20,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {2286#(<= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2286#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:20,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {2286#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2293#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:20,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {2293#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2293#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:20,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {2293#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2300#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:20,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {2300#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2300#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:20,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {2300#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:20,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {2307#(<= avg_~i~0 3)} assume !(~i~0 < 10); {2222#false} is VALID [2018-11-23 12:14:20,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {2222#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2222#false} is VALID [2018-11-23 12:14:20,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {2222#false} assume true; {2222#false} is VALID [2018-11-23 12:14:20,716 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2222#false} {2221#true} #70#return; {2222#false} is VALID [2018-11-23 12:14:20,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {2222#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2222#false} is VALID [2018-11-23 12:14:20,716 INFO L256 TraceCheckUtils]: 30: Hoare triple {2222#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2222#false} is VALID [2018-11-23 12:14:20,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {2222#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2222#false} is VALID [2018-11-23 12:14:20,717 INFO L273 TraceCheckUtils]: 32: Hoare triple {2222#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2222#false} is VALID [2018-11-23 12:14:20,717 INFO L273 TraceCheckUtils]: 33: Hoare triple {2222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#false} is VALID [2018-11-23 12:14:20,717 INFO L273 TraceCheckUtils]: 34: Hoare triple {2222#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2222#false} is VALID [2018-11-23 12:14:20,718 INFO L273 TraceCheckUtils]: 35: Hoare triple {2222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#false} is VALID [2018-11-23 12:14:20,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {2222#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2222#false} is VALID [2018-11-23 12:14:20,718 INFO L273 TraceCheckUtils]: 37: Hoare triple {2222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#false} is VALID [2018-11-23 12:14:20,719 INFO L273 TraceCheckUtils]: 38: Hoare triple {2222#false} assume !(~i~0 < 10); {2222#false} is VALID [2018-11-23 12:14:20,719 INFO L273 TraceCheckUtils]: 39: Hoare triple {2222#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2222#false} is VALID [2018-11-23 12:14:20,719 INFO L273 TraceCheckUtils]: 40: Hoare triple {2222#false} assume true; {2222#false} is VALID [2018-11-23 12:14:20,719 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2222#false} {2222#false} #72#return; {2222#false} is VALID [2018-11-23 12:14:20,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {2222#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2222#false} is VALID [2018-11-23 12:14:20,720 INFO L273 TraceCheckUtils]: 43: Hoare triple {2222#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2222#false} is VALID [2018-11-23 12:14:20,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {2222#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2222#false} is VALID [2018-11-23 12:14:20,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {2222#false} assume !(~i~2 < 9); {2222#false} is VALID [2018-11-23 12:14:20,720 INFO L273 TraceCheckUtils]: 46: Hoare triple {2222#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2222#false} is VALID [2018-11-23 12:14:20,720 INFO L256 TraceCheckUtils]: 47: Hoare triple {2222#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2222#false} is VALID [2018-11-23 12:14:20,720 INFO L273 TraceCheckUtils]: 48: Hoare triple {2222#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2222#false} is VALID [2018-11-23 12:14:20,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {2222#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2222#false} is VALID [2018-11-23 12:14:20,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {2222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#false} is VALID [2018-11-23 12:14:20,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {2222#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2222#false} is VALID [2018-11-23 12:14:20,721 INFO L273 TraceCheckUtils]: 52: Hoare triple {2222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#false} is VALID [2018-11-23 12:14:20,721 INFO L273 TraceCheckUtils]: 53: Hoare triple {2222#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2222#false} is VALID [2018-11-23 12:14:20,722 INFO L273 TraceCheckUtils]: 54: Hoare triple {2222#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2222#false} is VALID [2018-11-23 12:14:20,722 INFO L273 TraceCheckUtils]: 55: Hoare triple {2222#false} assume !(~i~0 < 10); {2222#false} is VALID [2018-11-23 12:14:20,722 INFO L273 TraceCheckUtils]: 56: Hoare triple {2222#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2222#false} is VALID [2018-11-23 12:14:20,722 INFO L273 TraceCheckUtils]: 57: Hoare triple {2222#false} assume true; {2222#false} is VALID [2018-11-23 12:14:20,722 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2222#false} {2222#false} #74#return; {2222#false} is VALID [2018-11-23 12:14:20,722 INFO L273 TraceCheckUtils]: 59: Hoare triple {2222#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2222#false} is VALID [2018-11-23 12:14:20,723 INFO L273 TraceCheckUtils]: 60: Hoare triple {2222#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2222#false} is VALID [2018-11-23 12:14:20,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {2222#false} assume !false; {2222#false} is VALID [2018-11-23 12:14:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 52 proven. 9 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:14:20,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:20,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 12:14:20,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-23 12:14:20,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:20,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:14:20,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:20,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:14:20,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:14:20,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:20,834 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2018-11-23 12:14:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,403 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2018-11-23 12:14:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:14:21,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-23 12:14:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 12:14:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 12:14:21,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2018-11-23 12:14:21,526 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-23 12:14:21,527 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:14:21,527 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:14:21,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:14:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 12:14:21,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:21,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 12:14:21,550 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 12:14:21,550 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 12:14:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,553 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 12:14:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:14:21,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:21,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:21,554 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 12:14:21,558 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 12:14:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:21,560 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 12:14:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:14:21,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:21,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:21,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:21,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:14:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 12:14:21,567 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 62 [2018-11-23 12:14:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:21,567 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 12:14:21,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:14:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:14:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:14:21,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:21,568 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:21,569 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:21,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash 390318925, now seen corresponding path program 6 times [2018-11-23 12:14:21,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:21,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:21,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:21,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 12:14:21,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {2682#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2682#true} is VALID [2018-11-23 12:14:21,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:14:21,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #66#return; {2682#true} is VALID [2018-11-23 12:14:21,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret12 := main(); {2682#true} is VALID [2018-11-23 12:14:21,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {2682#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2684#(= main_~i~1 0)} is VALID [2018-11-23 12:14:21,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {2684#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2684#(= main_~i~1 0)} is VALID [2018-11-23 12:14:21,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {2684#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2685#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:21,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {2685#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2685#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:21,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {2685#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2686#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:21,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {2686#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2686#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:21,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {2686#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2687#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:21,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {2687#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2687#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:21,773 INFO L273 TraceCheckUtils]: 13: Hoare triple {2687#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2688#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:21,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {2688#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2688#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:21,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {2688#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2689#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:21,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {2689#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2689#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:21,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {2689#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2690#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:21,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {2690#(<= main_~i~1 6)} assume !(~i~1 < 10); {2683#false} is VALID [2018-11-23 12:14:21,776 INFO L256 TraceCheckUtils]: 19: Hoare triple {2683#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:14:21,777 INFO L273 TraceCheckUtils]: 20: Hoare triple {2682#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2682#true} is VALID [2018-11-23 12:14:21,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,777 INFO L273 TraceCheckUtils]: 22: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,777 INFO L273 TraceCheckUtils]: 23: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:14:21,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {2682#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:14:21,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:14:21,779 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2682#true} {2683#false} #70#return; {2683#false} is VALID [2018-11-23 12:14:21,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {2683#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2683#false} is VALID [2018-11-23 12:14:21,779 INFO L256 TraceCheckUtils]: 34: Hoare triple {2683#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:14:21,779 INFO L273 TraceCheckUtils]: 35: Hoare triple {2682#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 37: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 38: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 39: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 40: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 41: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 42: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:14:21,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {2682#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:14:21,781 INFO L273 TraceCheckUtils]: 46: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:14:21,781 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2682#true} {2683#false} #72#return; {2683#false} is VALID [2018-11-23 12:14:21,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {2683#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2683#false} is VALID [2018-11-23 12:14:21,781 INFO L273 TraceCheckUtils]: 49: Hoare triple {2683#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2683#false} is VALID [2018-11-23 12:14:21,781 INFO L273 TraceCheckUtils]: 50: Hoare triple {2683#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2683#false} is VALID [2018-11-23 12:14:21,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {2683#false} assume !(~i~2 < 9); {2683#false} is VALID [2018-11-23 12:14:21,781 INFO L273 TraceCheckUtils]: 52: Hoare triple {2683#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2683#false} is VALID [2018-11-23 12:14:21,782 INFO L256 TraceCheckUtils]: 53: Hoare triple {2683#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:14:21,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {2682#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2682#true} is VALID [2018-11-23 12:14:21,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,782 INFO L273 TraceCheckUtils]: 56: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,782 INFO L273 TraceCheckUtils]: 59: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,782 INFO L273 TraceCheckUtils]: 60: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,783 INFO L273 TraceCheckUtils]: 61: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:21,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:21,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:14:21,783 INFO L273 TraceCheckUtils]: 64: Hoare triple {2682#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:14:21,783 INFO L273 TraceCheckUtils]: 65: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:14:21,783 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2682#true} {2683#false} #74#return; {2683#false} is VALID [2018-11-23 12:14:21,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {2683#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2683#false} is VALID [2018-11-23 12:14:21,784 INFO L273 TraceCheckUtils]: 68: Hoare triple {2683#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2683#false} is VALID [2018-11-23 12:14:21,784 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 12:14:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-23 12:14:21,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:21,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:14:21,861 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:14:21,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:21,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:22,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 12:14:22,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {2682#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2682#true} is VALID [2018-11-23 12:14:22,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:14:22,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #66#return; {2682#true} is VALID [2018-11-23 12:14:22,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret12 := main(); {2682#true} is VALID [2018-11-23 12:14:22,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {2682#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2682#true} is VALID [2018-11-23 12:14:22,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {2682#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {2682#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {2682#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {2682#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {2682#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {2682#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 12: Hoare triple {2682#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {2682#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2682#true} is VALID [2018-11-23 12:14:22,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {2682#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {2682#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {2682#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {2682#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L273 TraceCheckUtils]: 18: Hoare triple {2682#true} assume !(~i~1 < 10); {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L256 TraceCheckUtils]: 19: Hoare triple {2682#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {2682#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L273 TraceCheckUtils]: 21: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 25: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 28: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:14:22,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {2682#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:14:22,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:14:22,033 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2682#true} {2682#true} #70#return; {2682#true} is VALID [2018-11-23 12:14:22,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {2682#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2682#true} is VALID [2018-11-23 12:14:22,033 INFO L256 TraceCheckUtils]: 34: Hoare triple {2682#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:14:22,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {2682#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2682#true} is VALID [2018-11-23 12:14:22,033 INFO L273 TraceCheckUtils]: 36: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,033 INFO L273 TraceCheckUtils]: 37: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,034 INFO L273 TraceCheckUtils]: 38: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,034 INFO L273 TraceCheckUtils]: 39: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,034 INFO L273 TraceCheckUtils]: 40: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,034 INFO L273 TraceCheckUtils]: 42: Hoare triple {2682#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2682#true} is VALID [2018-11-23 12:14:22,035 INFO L273 TraceCheckUtils]: 43: Hoare triple {2682#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2682#true} is VALID [2018-11-23 12:14:22,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:14:22,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {2682#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:14:22,035 INFO L273 TraceCheckUtils]: 46: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:14:22,035 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2682#true} {2682#true} #72#return; {2682#true} is VALID [2018-11-23 12:14:22,051 INFO L273 TraceCheckUtils]: 48: Hoare triple {2682#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {2838#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:22,059 INFO L273 TraceCheckUtils]: 49: Hoare triple {2838#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {2838#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:22,073 INFO L273 TraceCheckUtils]: 50: Hoare triple {2838#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {2845#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:22,082 INFO L273 TraceCheckUtils]: 51: Hoare triple {2845#(<= main_~i~2 1)} assume !(~i~2 < 9); {2683#false} is VALID [2018-11-23 12:14:22,082 INFO L273 TraceCheckUtils]: 52: Hoare triple {2683#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2683#false} is VALID [2018-11-23 12:14:22,082 INFO L256 TraceCheckUtils]: 53: Hoare triple {2683#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2683#false} is VALID [2018-11-23 12:14:22,082 INFO L273 TraceCheckUtils]: 54: Hoare triple {2683#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2683#false} is VALID [2018-11-23 12:14:22,082 INFO L273 TraceCheckUtils]: 55: Hoare triple {2683#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2683#false} is VALID [2018-11-23 12:14:22,083 INFO L273 TraceCheckUtils]: 56: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2683#false} is VALID [2018-11-23 12:14:22,083 INFO L273 TraceCheckUtils]: 57: Hoare triple {2683#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2683#false} is VALID [2018-11-23 12:14:22,083 INFO L273 TraceCheckUtils]: 58: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2683#false} is VALID [2018-11-23 12:14:22,083 INFO L273 TraceCheckUtils]: 59: Hoare triple {2683#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2683#false} is VALID [2018-11-23 12:14:22,083 INFO L273 TraceCheckUtils]: 60: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2683#false} is VALID [2018-11-23 12:14:22,084 INFO L273 TraceCheckUtils]: 61: Hoare triple {2683#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {2683#false} is VALID [2018-11-23 12:14:22,084 INFO L273 TraceCheckUtils]: 62: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2683#false} is VALID [2018-11-23 12:14:22,084 INFO L273 TraceCheckUtils]: 63: Hoare triple {2683#false} assume !(~i~0 < 10); {2683#false} is VALID [2018-11-23 12:14:22,084 INFO L273 TraceCheckUtils]: 64: Hoare triple {2683#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {2683#false} is VALID [2018-11-23 12:14:22,084 INFO L273 TraceCheckUtils]: 65: Hoare triple {2683#false} assume true; {2683#false} is VALID [2018-11-23 12:14:22,084 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2683#false} {2683#false} #74#return; {2683#false} is VALID [2018-11-23 12:14:22,085 INFO L273 TraceCheckUtils]: 67: Hoare triple {2683#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {2683#false} is VALID [2018-11-23 12:14:22,085 INFO L273 TraceCheckUtils]: 68: Hoare triple {2683#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2683#false} is VALID [2018-11-23 12:14:22,085 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 12:14:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-23 12:14:22,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:22,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:14:22,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-23 12:14:22,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:22,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:14:22,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:22,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:14:22,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:14:22,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:22,211 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 11 states. [2018-11-23 12:14:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,630 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-23 12:14:22,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:14:22,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-23 12:14:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:14:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:14:22,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:14:22,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:22,757 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:14:22,757 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:14:22,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:14:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 12:14:22,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:22,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-23 12:14:22,778 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-23 12:14:22,779 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-23 12:14:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,781 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 12:14:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:14:22,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:22,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:22,782 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-23 12:14:22,782 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-23 12:14:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:22,784 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 12:14:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:14:22,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:22,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:22,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:22,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:14:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:14:22,787 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 70 [2018-11-23 12:14:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:22,787 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:14:22,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:14:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:14:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:14:22,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:22,788 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:22,788 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:22,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -133387091, now seen corresponding path program 7 times [2018-11-23 12:14:22,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:22,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:23,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 12:14:23,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3189#true} is VALID [2018-11-23 12:14:23,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:14:23,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #66#return; {3189#true} is VALID [2018-11-23 12:14:23,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret12 := main(); {3189#true} is VALID [2018-11-23 12:14:23,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3191#(= main_~i~1 0)} is VALID [2018-11-23 12:14:23,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {3191#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3191#(= main_~i~1 0)} is VALID [2018-11-23 12:14:23,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {3191#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3192#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:23,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {3192#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3192#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:23,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {3192#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3193#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:23,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {3193#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3193#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:23,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {3193#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3194#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:23,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3194#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:23,126 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3195#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:23,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {3195#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3195#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:23,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {3195#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3196#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:23,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {3196#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3196#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:23,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {3196#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3197#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:23,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {3197#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3197#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:23,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3198#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:23,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~i~1 7)} assume !(~i~1 < 10); {3190#false} is VALID [2018-11-23 12:14:23,131 INFO L256 TraceCheckUtils]: 21: Hoare triple {3190#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3189#true} is VALID [2018-11-23 12:14:23,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {3189#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3189#true} is VALID [2018-11-23 12:14:23,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {3189#true} assume !(~i~0 < 10); {3189#true} is VALID [2018-11-23 12:14:23,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {3189#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3189#true} is VALID [2018-11-23 12:14:23,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:14:23,133 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3189#true} {3190#false} #70#return; {3190#false} is VALID [2018-11-23 12:14:23,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {3190#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3190#false} is VALID [2018-11-23 12:14:23,134 INFO L256 TraceCheckUtils]: 36: Hoare triple {3190#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3189#true} is VALID [2018-11-23 12:14:23,134 INFO L273 TraceCheckUtils]: 37: Hoare triple {3189#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3189#true} is VALID [2018-11-23 12:14:23,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 44: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 46: Hoare triple {3189#true} assume !(~i~0 < 10); {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {3189#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3189#true} is VALID [2018-11-23 12:14:23,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:14:23,136 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3189#true} {3190#false} #72#return; {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {3190#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {3190#false} assume !(~i~2 < 9); {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {3190#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3190#false} is VALID [2018-11-23 12:14:23,136 INFO L256 TraceCheckUtils]: 57: Hoare triple {3190#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 58: Hoare triple {3189#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 59: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 60: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 61: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 63: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 64: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,137 INFO L273 TraceCheckUtils]: 65: Hoare triple {3189#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3189#true} is VALID [2018-11-23 12:14:23,138 INFO L273 TraceCheckUtils]: 66: Hoare triple {3189#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#true} is VALID [2018-11-23 12:14:23,138 INFO L273 TraceCheckUtils]: 67: Hoare triple {3189#true} assume !(~i~0 < 10); {3189#true} is VALID [2018-11-23 12:14:23,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {3189#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3189#true} is VALID [2018-11-23 12:14:23,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:14:23,138 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3189#true} {3190#false} #74#return; {3190#false} is VALID [2018-11-23 12:14:23,138 INFO L273 TraceCheckUtils]: 71: Hoare triple {3190#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3190#false} is VALID [2018-11-23 12:14:23,138 INFO L273 TraceCheckUtils]: 72: Hoare triple {3190#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3190#false} is VALID [2018-11-23 12:14:23,138 INFO L273 TraceCheckUtils]: 73: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 12:14:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:14:23,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:23,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 12:14:23,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:23,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:23,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 12:14:23,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3189#true} is VALID [2018-11-23 12:14:23,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:14:23,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #66#return; {3189#true} is VALID [2018-11-23 12:14:23,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret12 := main(); {3189#true} is VALID [2018-11-23 12:14:23,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3217#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:23,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {3217#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3217#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:23,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {3217#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3192#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:23,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {3192#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3192#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:23,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {3192#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3193#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:23,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {3193#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3193#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:23,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {3193#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3194#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:23,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3194#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:23,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3195#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:23,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {3195#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3195#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:23,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {3195#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3196#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:23,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {3196#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3196#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:23,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {3196#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3197#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:23,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {3197#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3197#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:23,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {3197#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3198#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:23,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~i~1 7)} assume !(~i~1 < 10); {3190#false} is VALID [2018-11-23 12:14:23,324 INFO L256 TraceCheckUtils]: 21: Hoare triple {3190#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3190#false} is VALID [2018-11-23 12:14:23,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {3190#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3190#false} is VALID [2018-11-23 12:14:23,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,325 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,325 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#false} assume !(~i~0 < 10); {3190#false} is VALID [2018-11-23 12:14:23,326 INFO L273 TraceCheckUtils]: 32: Hoare triple {3190#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3190#false} is VALID [2018-11-23 12:14:23,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {3190#false} assume true; {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3190#false} {3190#false} #70#return; {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {3190#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L256 TraceCheckUtils]: 36: Hoare triple {3190#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L273 TraceCheckUtils]: 37: Hoare triple {3190#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L273 TraceCheckUtils]: 38: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 44: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 45: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#false} assume !(~i~0 < 10); {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#false} assume true; {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3190#false} {3190#false} #72#return; {3190#false} is VALID [2018-11-23 12:14:23,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {3190#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L273 TraceCheckUtils]: 51: Hoare triple {3190#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L273 TraceCheckUtils]: 52: Hoare triple {3190#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L273 TraceCheckUtils]: 53: Hoare triple {3190#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L273 TraceCheckUtils]: 54: Hoare triple {3190#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {3190#false} assume !(~i~2 < 9); {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L273 TraceCheckUtils]: 56: Hoare triple {3190#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L256 TraceCheckUtils]: 57: Hoare triple {3190#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3190#false} is VALID [2018-11-23 12:14:23,329 INFO L273 TraceCheckUtils]: 58: Hoare triple {3190#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 59: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 60: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 61: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 62: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 63: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 64: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 65: Hoare triple {3190#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 66: Hoare triple {3190#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#false} is VALID [2018-11-23 12:14:23,330 INFO L273 TraceCheckUtils]: 67: Hoare triple {3190#false} assume !(~i~0 < 10); {3190#false} is VALID [2018-11-23 12:14:23,331 INFO L273 TraceCheckUtils]: 68: Hoare triple {3190#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3190#false} is VALID [2018-11-23 12:14:23,331 INFO L273 TraceCheckUtils]: 69: Hoare triple {3190#false} assume true; {3190#false} is VALID [2018-11-23 12:14:23,331 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3190#false} {3190#false} #74#return; {3190#false} is VALID [2018-11-23 12:14:23,331 INFO L273 TraceCheckUtils]: 71: Hoare triple {3190#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3190#false} is VALID [2018-11-23 12:14:23,331 INFO L273 TraceCheckUtils]: 72: Hoare triple {3190#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3190#false} is VALID [2018-11-23 12:14:23,331 INFO L273 TraceCheckUtils]: 73: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 12:14:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:14:23,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:23,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:14:23,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 12:14:23,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:23,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:14:23,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:23,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:14:23,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:14:23,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:23,420 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2018-11-23 12:14:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:23,905 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 12:14:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:14:23,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 12:14:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:14:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:14:23,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:14:23,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:23,980 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:14:23,980 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:14:23,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:14:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:14:24,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:24,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:14:24,007 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:14:24,007 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:14:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:24,008 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:14:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:14:24,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:24,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:24,009 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:14:24,009 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:14:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:24,010 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:14:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:14:24,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:24,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:24,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:24,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:14:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:14:24,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 74 [2018-11-23 12:14:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:24,013 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:14:24,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:14:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:14:24,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:14:24,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:24,014 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:24,014 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:24,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash -430428529, now seen corresponding path program 8 times [2018-11-23 12:14:24,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:24,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:24,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:24,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:24,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 12:14:24,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {3718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3718#true} is VALID [2018-11-23 12:14:24,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:14:24,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3718#true} {3718#true} #66#return; {3718#true} is VALID [2018-11-23 12:14:24,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {3718#true} call #t~ret12 := main(); {3718#true} is VALID [2018-11-23 12:14:24,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {3718#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3720#(= main_~i~1 0)} is VALID [2018-11-23 12:14:24,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {3720#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3720#(= main_~i~1 0)} is VALID [2018-11-23 12:14:24,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {3720#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3721#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:24,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {3721#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3721#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:24,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {3721#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3722#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:24,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {3722#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3722#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:24,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {3722#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3723#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:24,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {3723#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3723#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:24,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {3723#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3724#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:24,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {3724#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3724#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:24,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {3724#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3725#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:24,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {3725#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3725#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:24,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {3725#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3726#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:24,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {3726#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3726#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:24,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {3726#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3727#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:24,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {3727#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3727#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:24,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {3727#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3728#(<= main_~i~1 8)} is VALID [2018-11-23 12:14:24,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#(<= main_~i~1 8)} assume !(~i~1 < 10); {3719#false} is VALID [2018-11-23 12:14:24,992 INFO L256 TraceCheckUtils]: 23: Hoare triple {3719#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3718#true} is VALID [2018-11-23 12:14:24,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {3718#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3718#true} is VALID [2018-11-23 12:14:24,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {3718#true} assume !(~i~0 < 10); {3718#true} is VALID [2018-11-23 12:14:24,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {3718#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3718#true} is VALID [2018-11-23 12:14:24,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:14:24,995 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3718#true} {3719#false} #70#return; {3719#false} is VALID [2018-11-23 12:14:24,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {3719#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3719#false} is VALID [2018-11-23 12:14:24,995 INFO L256 TraceCheckUtils]: 38: Hoare triple {3719#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3718#true} is VALID [2018-11-23 12:14:24,995 INFO L273 TraceCheckUtils]: 39: Hoare triple {3718#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3718#true} is VALID [2018-11-23 12:14:24,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 42: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 43: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 44: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 45: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 46: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {3718#true} assume !(~i~0 < 10); {3718#true} is VALID [2018-11-23 12:14:24,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {3718#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3718#true} is VALID [2018-11-23 12:14:24,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:14:24,997 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3718#true} {3719#false} #72#return; {3719#false} is VALID [2018-11-23 12:14:24,997 INFO L273 TraceCheckUtils]: 52: Hoare triple {3719#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3719#false} is VALID [2018-11-23 12:14:24,997 INFO L273 TraceCheckUtils]: 53: Hoare triple {3719#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3719#false} is VALID [2018-11-23 12:14:24,997 INFO L273 TraceCheckUtils]: 54: Hoare triple {3719#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3719#false} is VALID [2018-11-23 12:14:24,997 INFO L273 TraceCheckUtils]: 55: Hoare triple {3719#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3719#false} is VALID [2018-11-23 12:14:24,997 INFO L273 TraceCheckUtils]: 56: Hoare triple {3719#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3719#false} is VALID [2018-11-23 12:14:24,998 INFO L273 TraceCheckUtils]: 57: Hoare triple {3719#false} assume !(~i~2 < 9); {3719#false} is VALID [2018-11-23 12:14:24,998 INFO L273 TraceCheckUtils]: 58: Hoare triple {3719#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3719#false} is VALID [2018-11-23 12:14:24,998 INFO L256 TraceCheckUtils]: 59: Hoare triple {3719#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3718#true} is VALID [2018-11-23 12:14:24,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {3718#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3718#true} is VALID [2018-11-23 12:14:24,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,998 INFO L273 TraceCheckUtils]: 62: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,998 INFO L273 TraceCheckUtils]: 63: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,998 INFO L273 TraceCheckUtils]: 64: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 65: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 67: Hoare triple {3718#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {3718#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 69: Hoare triple {3718#true} assume !(~i~0 < 10); {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 70: Hoare triple {3718#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 71: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:14:24,999 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {3718#true} {3719#false} #74#return; {3719#false} is VALID [2018-11-23 12:14:24,999 INFO L273 TraceCheckUtils]: 73: Hoare triple {3719#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3719#false} is VALID [2018-11-23 12:14:25,000 INFO L273 TraceCheckUtils]: 74: Hoare triple {3719#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3719#false} is VALID [2018-11-23 12:14:25,000 INFO L273 TraceCheckUtils]: 75: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 12:14:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:14:25,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:25,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:25,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:14:25,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:14:25,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:25,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:25,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 12:14:25,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {3718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3718#true} is VALID [2018-11-23 12:14:25,204 INFO L273 TraceCheckUtils]: 2: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:14:25,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3718#true} {3718#true} #66#return; {3718#true} is VALID [2018-11-23 12:14:25,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {3718#true} call #t~ret12 := main(); {3718#true} is VALID [2018-11-23 12:14:25,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {3718#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3747#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:25,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {3747#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3747#(<= main_~i~1 0)} is VALID [2018-11-23 12:14:25,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {3747#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3721#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:25,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {3721#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3721#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:25,207 INFO L273 TraceCheckUtils]: 9: Hoare triple {3721#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3722#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:25,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {3722#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3722#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:25,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {3722#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3723#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:25,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {3723#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3723#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:25,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {3723#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3724#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:25,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {3724#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3724#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:25,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {3724#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3725#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:25,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {3725#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3725#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:25,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {3725#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3726#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:25,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {3726#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3726#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:25,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {3726#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3727#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:25,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {3727#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {3727#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:25,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {3727#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3728#(<= main_~i~1 8)} is VALID [2018-11-23 12:14:25,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#(<= main_~i~1 8)} assume !(~i~1 < 10); {3719#false} is VALID [2018-11-23 12:14:25,215 INFO L256 TraceCheckUtils]: 23: Hoare triple {3719#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3719#false} is VALID [2018-11-23 12:14:25,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {3719#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3719#false} is VALID [2018-11-23 12:14:25,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,216 INFO L273 TraceCheckUtils]: 26: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,216 INFO L273 TraceCheckUtils]: 27: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,216 INFO L273 TraceCheckUtils]: 30: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {3719#false} assume !(~i~0 < 10); {3719#false} is VALID [2018-11-23 12:14:25,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {3719#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3719#false} is VALID [2018-11-23 12:14:25,217 INFO L273 TraceCheckUtils]: 35: Hoare triple {3719#false} assume true; {3719#false} is VALID [2018-11-23 12:14:25,218 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3719#false} {3719#false} #70#return; {3719#false} is VALID [2018-11-23 12:14:25,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {3719#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3719#false} is VALID [2018-11-23 12:14:25,218 INFO L256 TraceCheckUtils]: 38: Hoare triple {3719#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3719#false} is VALID [2018-11-23 12:14:25,218 INFO L273 TraceCheckUtils]: 39: Hoare triple {3719#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3719#false} is VALID [2018-11-23 12:14:25,218 INFO L273 TraceCheckUtils]: 40: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,219 INFO L273 TraceCheckUtils]: 41: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,219 INFO L273 TraceCheckUtils]: 42: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,219 INFO L273 TraceCheckUtils]: 43: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,219 INFO L273 TraceCheckUtils]: 44: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,219 INFO L273 TraceCheckUtils]: 45: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,219 INFO L273 TraceCheckUtils]: 46: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L273 TraceCheckUtils]: 47: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L273 TraceCheckUtils]: 48: Hoare triple {3719#false} assume !(~i~0 < 10); {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L273 TraceCheckUtils]: 49: Hoare triple {3719#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L273 TraceCheckUtils]: 50: Hoare triple {3719#false} assume true; {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3719#false} {3719#false} #72#return; {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L273 TraceCheckUtils]: 52: Hoare triple {3719#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L273 TraceCheckUtils]: 53: Hoare triple {3719#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3719#false} is VALID [2018-11-23 12:14:25,220 INFO L273 TraceCheckUtils]: 54: Hoare triple {3719#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 55: Hoare triple {3719#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 56: Hoare triple {3719#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 57: Hoare triple {3719#false} assume !(~i~2 < 9); {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 58: Hoare triple {3719#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L256 TraceCheckUtils]: 59: Hoare triple {3719#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 60: Hoare triple {3719#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 61: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 62: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,221 INFO L273 TraceCheckUtils]: 63: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 64: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 65: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 66: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 67: Hoare triple {3719#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 68: Hoare triple {3719#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 69: Hoare triple {3719#false} assume !(~i~0 < 10); {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 70: Hoare triple {3719#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {3719#false} is VALID [2018-11-23 12:14:25,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {3719#false} assume true; {3719#false} is VALID [2018-11-23 12:14:25,223 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {3719#false} {3719#false} #74#return; {3719#false} is VALID [2018-11-23 12:14:25,223 INFO L273 TraceCheckUtils]: 73: Hoare triple {3719#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {3719#false} is VALID [2018-11-23 12:14:25,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {3719#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3719#false} is VALID [2018-11-23 12:14:25,223 INFO L273 TraceCheckUtils]: 75: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 12:14:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:14:25,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:25,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:14:25,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-23 12:14:25,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:25,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:14:25,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:25,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:14:25,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:14:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:25,309 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 12 states. [2018-11-23 12:14:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:25,475 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-23 12:14:25,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:14:25,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-23 12:14:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:14:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:14:25,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:14:25,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:25,579 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:14:25,579 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:14:25,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:14:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 12:14:25,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:25,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 12:14:25,599 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 12:14:25,599 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 12:14:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:25,602 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 12:14:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 12:14:25,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:25,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:25,602 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 12:14:25,602 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 12:14:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:25,604 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 12:14:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 12:14:25,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:25,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:25,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:25,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:14:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-23 12:14:25,607 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 76 [2018-11-23 12:14:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:25,607 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-23 12:14:25,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:14:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 12:14:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:14:25,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:25,608 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:25,608 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:25,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1875558385, now seen corresponding path program 9 times [2018-11-23 12:14:25,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:25,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:25,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:25,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:25,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:25,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {4264#true} call ULTIMATE.init(); {4264#true} is VALID [2018-11-23 12:14:25,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {4264#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4264#true} is VALID [2018-11-23 12:14:25,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:14:25,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4264#true} {4264#true} #66#return; {4264#true} is VALID [2018-11-23 12:14:25,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {4264#true} call #t~ret12 := main(); {4264#true} is VALID [2018-11-23 12:14:25,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {4264#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4266#(= main_~i~1 0)} is VALID [2018-11-23 12:14:25,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {4266#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4266#(= main_~i~1 0)} is VALID [2018-11-23 12:14:25,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {4266#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4267#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:25,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {4267#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4267#(<= main_~i~1 1)} is VALID [2018-11-23 12:14:25,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {4267#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4268#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:25,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {4268#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4268#(<= main_~i~1 2)} is VALID [2018-11-23 12:14:25,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {4268#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4269#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:25,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {4269#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4269#(<= main_~i~1 3)} is VALID [2018-11-23 12:14:25,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {4269#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4270#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:25,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {4270#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4270#(<= main_~i~1 4)} is VALID [2018-11-23 12:14:25,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {4270#(<= main_~i~1 4)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4271#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:25,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {4271#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4271#(<= main_~i~1 5)} is VALID [2018-11-23 12:14:25,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {4271#(<= main_~i~1 5)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4272#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:25,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {4272#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4272#(<= main_~i~1 6)} is VALID [2018-11-23 12:14:25,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {4272#(<= main_~i~1 6)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4273#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:25,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {4273#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4273#(<= main_~i~1 7)} is VALID [2018-11-23 12:14:25,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {4273#(<= main_~i~1 7)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4274#(<= main_~i~1 8)} is VALID [2018-11-23 12:14:25,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {4274#(<= main_~i~1 8)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4274#(<= main_~i~1 8)} is VALID [2018-11-23 12:14:25,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {4274#(<= main_~i~1 8)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4275#(<= main_~i~1 9)} is VALID [2018-11-23 12:14:25,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {4275#(<= main_~i~1 9)} assume !(~i~1 < 10); {4265#false} is VALID [2018-11-23 12:14:25,910 INFO L256 TraceCheckUtils]: 25: Hoare triple {4265#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:14:25,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {4264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4264#true} is VALID [2018-11-23 12:14:25,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,911 INFO L273 TraceCheckUtils]: 30: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,912 INFO L273 TraceCheckUtils]: 31: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,912 INFO L273 TraceCheckUtils]: 33: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,912 INFO L273 TraceCheckUtils]: 34: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:14:25,913 INFO L273 TraceCheckUtils]: 36: Hoare triple {4264#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:14:25,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:14:25,913 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4264#true} {4265#false} #70#return; {4265#false} is VALID [2018-11-23 12:14:25,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {4265#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4265#false} is VALID [2018-11-23 12:14:25,914 INFO L256 TraceCheckUtils]: 40: Hoare triple {4265#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:14:25,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {4264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4264#true} is VALID [2018-11-23 12:14:25,914 INFO L273 TraceCheckUtils]: 42: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,914 INFO L273 TraceCheckUtils]: 43: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,914 INFO L273 TraceCheckUtils]: 45: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,915 INFO L273 TraceCheckUtils]: 47: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,915 INFO L273 TraceCheckUtils]: 48: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,915 INFO L273 TraceCheckUtils]: 49: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,915 INFO L273 TraceCheckUtils]: 50: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:14:25,915 INFO L273 TraceCheckUtils]: 51: Hoare triple {4264#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:14:25,915 INFO L273 TraceCheckUtils]: 52: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:14:25,916 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {4264#true} {4265#false} #72#return; {4265#false} is VALID [2018-11-23 12:14:25,916 INFO L273 TraceCheckUtils]: 54: Hoare triple {4265#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4265#false} is VALID [2018-11-23 12:14:25,916 INFO L273 TraceCheckUtils]: 55: Hoare triple {4265#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4265#false} is VALID [2018-11-23 12:14:25,916 INFO L273 TraceCheckUtils]: 56: Hoare triple {4265#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4265#false} is VALID [2018-11-23 12:14:25,916 INFO L273 TraceCheckUtils]: 57: Hoare triple {4265#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4265#false} is VALID [2018-11-23 12:14:25,916 INFO L273 TraceCheckUtils]: 58: Hoare triple {4265#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4265#false} is VALID [2018-11-23 12:14:25,917 INFO L273 TraceCheckUtils]: 59: Hoare triple {4265#false} assume !(~i~2 < 9); {4265#false} is VALID [2018-11-23 12:14:25,917 INFO L273 TraceCheckUtils]: 60: Hoare triple {4265#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4265#false} is VALID [2018-11-23 12:14:25,917 INFO L256 TraceCheckUtils]: 61: Hoare triple {4265#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:14:25,917 INFO L273 TraceCheckUtils]: 62: Hoare triple {4264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4264#true} is VALID [2018-11-23 12:14:25,917 INFO L273 TraceCheckUtils]: 63: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,917 INFO L273 TraceCheckUtils]: 64: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,917 INFO L273 TraceCheckUtils]: 65: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,918 INFO L273 TraceCheckUtils]: 66: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,918 INFO L273 TraceCheckUtils]: 67: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,918 INFO L273 TraceCheckUtils]: 68: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,918 INFO L273 TraceCheckUtils]: 69: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:25,918 INFO L273 TraceCheckUtils]: 70: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:25,918 INFO L273 TraceCheckUtils]: 71: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:14:25,918 INFO L273 TraceCheckUtils]: 72: Hoare triple {4264#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:14:25,919 INFO L273 TraceCheckUtils]: 73: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:14:25,919 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4264#true} {4265#false} #74#return; {4265#false} is VALID [2018-11-23 12:14:25,919 INFO L273 TraceCheckUtils]: 75: Hoare triple {4265#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4265#false} is VALID [2018-11-23 12:14:25,919 INFO L273 TraceCheckUtils]: 76: Hoare triple {4265#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4265#false} is VALID [2018-11-23 12:14:25,919 INFO L273 TraceCheckUtils]: 77: Hoare triple {4265#false} assume !false; {4265#false} is VALID [2018-11-23 12:14:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:14:25,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:25,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:25,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:14:25,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:14:25,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:25,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:26,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {4264#true} call ULTIMATE.init(); {4264#true} is VALID [2018-11-23 12:14:26,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {4264#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4264#true} is VALID [2018-11-23 12:14:26,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:14:26,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4264#true} {4264#true} #66#return; {4264#true} is VALID [2018-11-23 12:14:26,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {4264#true} call #t~ret12 := main(); {4264#true} is VALID [2018-11-23 12:14:26,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {4264#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4264#true} is VALID [2018-11-23 12:14:26,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,112 INFO L273 TraceCheckUtils]: 11: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,113 INFO L273 TraceCheckUtils]: 12: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {4264#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4264#true} is VALID [2018-11-23 12:14:26,114 INFO L273 TraceCheckUtils]: 23: Hoare triple {4264#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4264#true} is VALID [2018-11-23 12:14:26,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {4264#true} assume !(~i~1 < 10); {4264#true} is VALID [2018-11-23 12:14:26,114 INFO L256 TraceCheckUtils]: 25: Hoare triple {4264#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:14:26,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {4264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4264#true} is VALID [2018-11-23 12:14:26,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:14:26,116 INFO L273 TraceCheckUtils]: 36: Hoare triple {4264#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:14:26,116 INFO L273 TraceCheckUtils]: 37: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:14:26,116 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4264#true} {4264#true} #70#return; {4264#true} is VALID [2018-11-23 12:14:26,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {4264#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4264#true} is VALID [2018-11-23 12:14:26,117 INFO L256 TraceCheckUtils]: 40: Hoare triple {4264#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:14:26,117 INFO L273 TraceCheckUtils]: 41: Hoare triple {4264#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4264#true} is VALID [2018-11-23 12:14:26,117 INFO L273 TraceCheckUtils]: 42: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,117 INFO L273 TraceCheckUtils]: 43: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,117 INFO L273 TraceCheckUtils]: 44: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {4264#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4264#true} is VALID [2018-11-23 12:14:26,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {4264#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4264#true} is VALID [2018-11-23 12:14:26,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:14:26,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {4264#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:14:26,119 INFO L273 TraceCheckUtils]: 52: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:14:26,119 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {4264#true} {4264#true} #72#return; {4264#true} is VALID [2018-11-23 12:14:26,119 INFO L273 TraceCheckUtils]: 54: Hoare triple {4264#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4441#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:26,120 INFO L273 TraceCheckUtils]: 55: Hoare triple {4441#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4441#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:26,120 INFO L273 TraceCheckUtils]: 56: Hoare triple {4441#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4448#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:26,121 INFO L273 TraceCheckUtils]: 57: Hoare triple {4448#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4448#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:26,121 INFO L273 TraceCheckUtils]: 58: Hoare triple {4448#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4455#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:26,122 INFO L273 TraceCheckUtils]: 59: Hoare triple {4455#(<= main_~i~2 2)} assume !(~i~2 < 9); {4265#false} is VALID [2018-11-23 12:14:26,122 INFO L273 TraceCheckUtils]: 60: Hoare triple {4265#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4265#false} is VALID [2018-11-23 12:14:26,122 INFO L256 TraceCheckUtils]: 61: Hoare triple {4265#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {4265#false} is VALID [2018-11-23 12:14:26,122 INFO L273 TraceCheckUtils]: 62: Hoare triple {4265#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4265#false} is VALID [2018-11-23 12:14:26,122 INFO L273 TraceCheckUtils]: 63: Hoare triple {4265#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4265#false} is VALID [2018-11-23 12:14:26,122 INFO L273 TraceCheckUtils]: 64: Hoare triple {4265#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4265#false} is VALID [2018-11-23 12:14:26,123 INFO L273 TraceCheckUtils]: 65: Hoare triple {4265#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4265#false} is VALID [2018-11-23 12:14:26,123 INFO L273 TraceCheckUtils]: 66: Hoare triple {4265#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4265#false} is VALID [2018-11-23 12:14:26,123 INFO L273 TraceCheckUtils]: 67: Hoare triple {4265#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4265#false} is VALID [2018-11-23 12:14:26,123 INFO L273 TraceCheckUtils]: 68: Hoare triple {4265#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4265#false} is VALID [2018-11-23 12:14:26,123 INFO L273 TraceCheckUtils]: 69: Hoare triple {4265#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4265#false} is VALID [2018-11-23 12:14:26,124 INFO L273 TraceCheckUtils]: 70: Hoare triple {4265#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4265#false} is VALID [2018-11-23 12:14:26,124 INFO L273 TraceCheckUtils]: 71: Hoare triple {4265#false} assume !(~i~0 < 10); {4265#false} is VALID [2018-11-23 12:14:26,124 INFO L273 TraceCheckUtils]: 72: Hoare triple {4265#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4265#false} is VALID [2018-11-23 12:14:26,125 INFO L273 TraceCheckUtils]: 73: Hoare triple {4265#false} assume true; {4265#false} is VALID [2018-11-23 12:14:26,125 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4265#false} {4265#false} #74#return; {4265#false} is VALID [2018-11-23 12:14:26,125 INFO L273 TraceCheckUtils]: 75: Hoare triple {4265#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4265#false} is VALID [2018-11-23 12:14:26,125 INFO L273 TraceCheckUtils]: 76: Hoare triple {4265#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4265#false} is VALID [2018-11-23 12:14:26,126 INFO L273 TraceCheckUtils]: 77: Hoare triple {4265#false} assume !false; {4265#false} is VALID [2018-11-23 12:14:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-11-23 12:14:26,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:26,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:14:26,150 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-11-23 12:14:26,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:26,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:14:26,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:26,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:14:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:14:26,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:14:26,233 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 15 states. [2018-11-23 12:14:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:26,720 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-23 12:14:26,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:14:26,720 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-11-23 12:14:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:14:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2018-11-23 12:14:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:14:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2018-11-23 12:14:26,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 78 transitions. [2018-11-23 12:14:26,911 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-23 12:14:26,912 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:14:26,912 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:14:26,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:14:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:14:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 12:14:26,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:26,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 12:14:26,943 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 12:14:26,943 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 12:14:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:26,946 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-23 12:14:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-23 12:14:26,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:26,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:26,947 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 12:14:26,947 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 12:14:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:26,949 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-23 12:14:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-23 12:14:26,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:26,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:26,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:26,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:14:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-23 12:14:26,969 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 78 [2018-11-23 12:14:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:26,970 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-23 12:14:26,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:14:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:14:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:14:26,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:26,973 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:26,973 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:26,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash 237602385, now seen corresponding path program 10 times [2018-11-23 12:14:26,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:26,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:26,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:27,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {4839#true} call ULTIMATE.init(); {4839#true} is VALID [2018-11-23 12:14:27,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {4839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4839#true} is VALID [2018-11-23 12:14:27,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:14:27,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4839#true} {4839#true} #66#return; {4839#true} is VALID [2018-11-23 12:14:27,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {4839#true} call #t~ret12 := main(); {4839#true} is VALID [2018-11-23 12:14:27,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {4839#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4839#true} is VALID [2018-11-23 12:14:27,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,372 INFO L273 TraceCheckUtils]: 23: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,372 INFO L273 TraceCheckUtils]: 25: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {4839#true} assume !(~i~1 < 10); {4839#true} is VALID [2018-11-23 12:14:27,373 INFO L256 TraceCheckUtils]: 27: Hoare triple {4839#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:14:27,373 INFO L273 TraceCheckUtils]: 28: Hoare triple {4839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4841#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:27,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {4841#(= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4841#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:27,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {4841#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4842#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:27,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {4842#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4842#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:27,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {4842#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4843#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:27,375 INFO L273 TraceCheckUtils]: 33: Hoare triple {4843#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4843#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:27,376 INFO L273 TraceCheckUtils]: 34: Hoare triple {4843#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4844#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:27,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {4844#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4844#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:27,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {4844#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4845#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:27,378 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= avg_~i~0 4)} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:14:27,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {4840#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:14:27,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:14:27,378 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4840#false} {4839#true} #70#return; {4840#false} is VALID [2018-11-23 12:14:27,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {4840#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4840#false} is VALID [2018-11-23 12:14:27,379 INFO L256 TraceCheckUtils]: 42: Hoare triple {4840#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:14:27,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {4839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4839#true} is VALID [2018-11-23 12:14:27,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,379 INFO L273 TraceCheckUtils]: 46: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,380 INFO L273 TraceCheckUtils]: 49: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,380 INFO L273 TraceCheckUtils]: 50: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,381 INFO L273 TraceCheckUtils]: 51: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,381 INFO L273 TraceCheckUtils]: 52: Hoare triple {4839#true} assume !(~i~0 < 10); {4839#true} is VALID [2018-11-23 12:14:27,381 INFO L273 TraceCheckUtils]: 53: Hoare triple {4839#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4839#true} is VALID [2018-11-23 12:14:27,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:14:27,381 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4839#true} {4840#false} #72#return; {4840#false} is VALID [2018-11-23 12:14:27,382 INFO L273 TraceCheckUtils]: 56: Hoare triple {4840#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4840#false} is VALID [2018-11-23 12:14:27,382 INFO L273 TraceCheckUtils]: 57: Hoare triple {4840#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4840#false} is VALID [2018-11-23 12:14:27,382 INFO L273 TraceCheckUtils]: 58: Hoare triple {4840#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4840#false} is VALID [2018-11-23 12:14:27,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {4840#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4840#false} is VALID [2018-11-23 12:14:27,382 INFO L273 TraceCheckUtils]: 60: Hoare triple {4840#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4840#false} is VALID [2018-11-23 12:14:27,382 INFO L273 TraceCheckUtils]: 61: Hoare triple {4840#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4840#false} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 62: Hoare triple {4840#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4840#false} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 63: Hoare triple {4840#false} assume !(~i~2 < 9); {4840#false} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 64: Hoare triple {4840#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4840#false} is VALID [2018-11-23 12:14:27,383 INFO L256 TraceCheckUtils]: 65: Hoare triple {4840#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 66: Hoare triple {4839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4839#true} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 67: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 68: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 69: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,383 INFO L273 TraceCheckUtils]: 70: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L273 TraceCheckUtils]: 71: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L273 TraceCheckUtils]: 72: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L273 TraceCheckUtils]: 73: Hoare triple {4839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L273 TraceCheckUtils]: 74: Hoare triple {4839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L273 TraceCheckUtils]: 75: Hoare triple {4839#true} assume !(~i~0 < 10); {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L273 TraceCheckUtils]: 76: Hoare triple {4839#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L273 TraceCheckUtils]: 77: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:14:27,384 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {4839#true} {4840#false} #74#return; {4840#false} is VALID [2018-11-23 12:14:27,385 INFO L273 TraceCheckUtils]: 79: Hoare triple {4840#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4840#false} is VALID [2018-11-23 12:14:27,385 INFO L273 TraceCheckUtils]: 80: Hoare triple {4840#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4840#false} is VALID [2018-11-23 12:14:27,385 INFO L273 TraceCheckUtils]: 81: Hoare triple {4840#false} assume !false; {4840#false} is VALID [2018-11-23 12:14:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-23 12:14:27,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:27,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:27,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:14:27,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:14:27,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:27,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:27,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {4839#true} call ULTIMATE.init(); {4839#true} is VALID [2018-11-23 12:14:27,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {4839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4839#true} is VALID [2018-11-23 12:14:27,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:14:27,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4839#true} {4839#true} #66#return; {4839#true} is VALID [2018-11-23 12:14:27,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {4839#true} call #t~ret12 := main(); {4839#true} is VALID [2018-11-23 12:14:27,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {4839#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4839#true} is VALID [2018-11-23 12:14:27,559 INFO L273 TraceCheckUtils]: 6: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 22: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {4839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {4839#true} is VALID [2018-11-23 12:14:27,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {4839#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4839#true} is VALID [2018-11-23 12:14:27,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {4839#true} assume !(~i~1 < 10); {4839#true} is VALID [2018-11-23 12:14:27,562 INFO L256 TraceCheckUtils]: 27: Hoare triple {4839#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:14:27,562 INFO L273 TraceCheckUtils]: 28: Hoare triple {4839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4933#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:27,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {4933#(<= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4933#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:27,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {4933#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4842#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:27,565 INFO L273 TraceCheckUtils]: 31: Hoare triple {4842#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4842#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:27,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {4842#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4843#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:27,566 INFO L273 TraceCheckUtils]: 33: Hoare triple {4843#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4843#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:27,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {4843#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4844#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:27,567 INFO L273 TraceCheckUtils]: 35: Hoare triple {4844#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4844#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:27,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {4844#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4845#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:27,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= avg_~i~0 4)} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:14:27,568 INFO L273 TraceCheckUtils]: 38: Hoare triple {4840#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:14:27,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:14:27,568 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4840#false} {4839#true} #70#return; {4840#false} is VALID [2018-11-23 12:14:27,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {4840#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4840#false} is VALID [2018-11-23 12:14:27,568 INFO L256 TraceCheckUtils]: 42: Hoare triple {4840#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {4840#false} is VALID [2018-11-23 12:14:27,568 INFO L273 TraceCheckUtils]: 43: Hoare triple {4840#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4840#false} is VALID [2018-11-23 12:14:27,568 INFO L273 TraceCheckUtils]: 44: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,569 INFO L273 TraceCheckUtils]: 45: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,569 INFO L273 TraceCheckUtils]: 46: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,569 INFO L273 TraceCheckUtils]: 47: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,569 INFO L273 TraceCheckUtils]: 48: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,569 INFO L273 TraceCheckUtils]: 49: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,570 INFO L273 TraceCheckUtils]: 50: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,570 INFO L273 TraceCheckUtils]: 51: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,570 INFO L273 TraceCheckUtils]: 52: Hoare triple {4840#false} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:14:27,570 INFO L273 TraceCheckUtils]: 53: Hoare triple {4840#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:14:27,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:14:27,571 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4840#false} {4840#false} #72#return; {4840#false} is VALID [2018-11-23 12:14:27,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {4840#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {4840#false} is VALID [2018-11-23 12:14:27,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {4840#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4840#false} is VALID [2018-11-23 12:14:27,571 INFO L273 TraceCheckUtils]: 58: Hoare triple {4840#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4840#false} is VALID [2018-11-23 12:14:27,571 INFO L273 TraceCheckUtils]: 59: Hoare triple {4840#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4840#false} is VALID [2018-11-23 12:14:27,571 INFO L273 TraceCheckUtils]: 60: Hoare triple {4840#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4840#false} is VALID [2018-11-23 12:14:27,571 INFO L273 TraceCheckUtils]: 61: Hoare triple {4840#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {4840#false} is VALID [2018-11-23 12:14:27,572 INFO L273 TraceCheckUtils]: 62: Hoare triple {4840#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {4840#false} is VALID [2018-11-23 12:14:27,572 INFO L273 TraceCheckUtils]: 63: Hoare triple {4840#false} assume !(~i~2 < 9); {4840#false} is VALID [2018-11-23 12:14:27,572 INFO L273 TraceCheckUtils]: 64: Hoare triple {4840#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4840#false} is VALID [2018-11-23 12:14:27,572 INFO L256 TraceCheckUtils]: 65: Hoare triple {4840#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {4840#false} is VALID [2018-11-23 12:14:27,572 INFO L273 TraceCheckUtils]: 66: Hoare triple {4840#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4840#false} is VALID [2018-11-23 12:14:27,572 INFO L273 TraceCheckUtils]: 67: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,573 INFO L273 TraceCheckUtils]: 68: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,573 INFO L273 TraceCheckUtils]: 69: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,573 INFO L273 TraceCheckUtils]: 70: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,573 INFO L273 TraceCheckUtils]: 71: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,573 INFO L273 TraceCheckUtils]: 72: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,573 INFO L273 TraceCheckUtils]: 73: Hoare triple {4840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {4840#false} is VALID [2018-11-23 12:14:27,574 INFO L273 TraceCheckUtils]: 74: Hoare triple {4840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4840#false} is VALID [2018-11-23 12:14:27,574 INFO L273 TraceCheckUtils]: 75: Hoare triple {4840#false} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:14:27,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {4840#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:14:27,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:14:27,574 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {4840#false} {4840#false} #74#return; {4840#false} is VALID [2018-11-23 12:14:27,574 INFO L273 TraceCheckUtils]: 79: Hoare triple {4840#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {4840#false} is VALID [2018-11-23 12:14:27,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {4840#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4840#false} is VALID [2018-11-23 12:14:27,575 INFO L273 TraceCheckUtils]: 81: Hoare triple {4840#false} assume !false; {4840#false} is VALID [2018-11-23 12:14:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:14:27,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:27,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:14:27,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-11-23 12:14:27,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:27,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:14:27,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:27,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:14:27,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:14:27,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:27,654 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 8 states. [2018-11-23 12:14:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:27,830 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:14:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:14:27,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-11-23 12:14:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:14:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 12:14:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:14:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 12:14:27,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-23 12:14:27,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:27,901 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:14:27,901 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:14:27,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:14:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:14:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 12:14:27,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:27,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 12:14:27,945 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 12:14:27,945 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 12:14:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:27,946 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 12:14:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 12:14:27,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:27,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:27,947 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 12:14:27,947 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 12:14:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:27,949 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 12:14:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 12:14:27,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:27,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:27,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:27,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:14:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:14:27,952 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 82 [2018-11-23 12:14:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:27,952 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:14:27,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:14:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:14:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 12:14:27,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:27,953 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:27,954 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:27,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1396536753, now seen corresponding path program 11 times [2018-11-23 12:14:27,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:27,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:27,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:27,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:29,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2018-11-23 12:14:29,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {5430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5430#true} is VALID [2018-11-23 12:14:29,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:14:29,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #66#return; {5430#true} is VALID [2018-11-23 12:14:29,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret12 := main(); {5430#true} is VALID [2018-11-23 12:14:29,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {5430#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5430#true} is VALID [2018-11-23 12:14:29,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,249 INFO L273 TraceCheckUtils]: 25: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,249 INFO L273 TraceCheckUtils]: 26: Hoare triple {5430#true} assume !(~i~1 < 10); {5430#true} is VALID [2018-11-23 12:14:29,249 INFO L256 TraceCheckUtils]: 27: Hoare triple {5430#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:14:29,262 INFO L273 TraceCheckUtils]: 28: Hoare triple {5430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5432#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:29,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {5432#(= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5432#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:29,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {5432#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:29,304 INFO L273 TraceCheckUtils]: 31: Hoare triple {5433#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:29,316 INFO L273 TraceCheckUtils]: 32: Hoare triple {5433#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:29,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {5434#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:29,342 INFO L273 TraceCheckUtils]: 34: Hoare triple {5434#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:29,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {5435#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:29,368 INFO L273 TraceCheckUtils]: 36: Hoare triple {5435#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:29,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:29,393 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:29,406 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= avg_~i~0 5)} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:14:29,406 INFO L273 TraceCheckUtils]: 40: Hoare triple {5431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:14:29,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:14:29,407 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5431#false} {5430#true} #70#return; {5431#false} is VALID [2018-11-23 12:14:29,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {5431#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5431#false} is VALID [2018-11-23 12:14:29,407 INFO L256 TraceCheckUtils]: 44: Hoare triple {5431#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:14:29,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {5430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5430#true} is VALID [2018-11-23 12:14:29,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,407 INFO L273 TraceCheckUtils]: 47: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,408 INFO L273 TraceCheckUtils]: 48: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,408 INFO L273 TraceCheckUtils]: 49: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,408 INFO L273 TraceCheckUtils]: 50: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,408 INFO L273 TraceCheckUtils]: 52: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,408 INFO L273 TraceCheckUtils]: 53: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,409 INFO L273 TraceCheckUtils]: 54: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,409 INFO L273 TraceCheckUtils]: 55: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,409 INFO L273 TraceCheckUtils]: 56: Hoare triple {5430#true} assume !(~i~0 < 10); {5430#true} is VALID [2018-11-23 12:14:29,409 INFO L273 TraceCheckUtils]: 57: Hoare triple {5430#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {5430#true} is VALID [2018-11-23 12:14:29,409 INFO L273 TraceCheckUtils]: 58: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:14:29,409 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {5430#true} {5431#false} #72#return; {5431#false} is VALID [2018-11-23 12:14:29,410 INFO L273 TraceCheckUtils]: 60: Hoare triple {5431#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5431#false} is VALID [2018-11-23 12:14:29,410 INFO L273 TraceCheckUtils]: 61: Hoare triple {5431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5431#false} is VALID [2018-11-23 12:14:29,410 INFO L273 TraceCheckUtils]: 62: Hoare triple {5431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5431#false} is VALID [2018-11-23 12:14:29,410 INFO L273 TraceCheckUtils]: 63: Hoare triple {5431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5431#false} is VALID [2018-11-23 12:14:29,410 INFO L273 TraceCheckUtils]: 64: Hoare triple {5431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5431#false} is VALID [2018-11-23 12:14:29,411 INFO L273 TraceCheckUtils]: 65: Hoare triple {5431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5431#false} is VALID [2018-11-23 12:14:29,411 INFO L273 TraceCheckUtils]: 66: Hoare triple {5431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5431#false} is VALID [2018-11-23 12:14:29,411 INFO L273 TraceCheckUtils]: 67: Hoare triple {5431#false} assume !(~i~2 < 9); {5431#false} is VALID [2018-11-23 12:14:29,411 INFO L273 TraceCheckUtils]: 68: Hoare triple {5431#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5431#false} is VALID [2018-11-23 12:14:29,411 INFO L256 TraceCheckUtils]: 69: Hoare triple {5431#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:14:29,411 INFO L273 TraceCheckUtils]: 70: Hoare triple {5430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5430#true} is VALID [2018-11-23 12:14:29,411 INFO L273 TraceCheckUtils]: 71: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,412 INFO L273 TraceCheckUtils]: 72: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,412 INFO L273 TraceCheckUtils]: 73: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,412 INFO L273 TraceCheckUtils]: 74: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,412 INFO L273 TraceCheckUtils]: 75: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,412 INFO L273 TraceCheckUtils]: 76: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,412 INFO L273 TraceCheckUtils]: 77: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,413 INFO L273 TraceCheckUtils]: 78: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,413 INFO L273 TraceCheckUtils]: 79: Hoare triple {5430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5430#true} is VALID [2018-11-23 12:14:29,413 INFO L273 TraceCheckUtils]: 80: Hoare triple {5430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5430#true} is VALID [2018-11-23 12:14:29,413 INFO L273 TraceCheckUtils]: 81: Hoare triple {5430#true} assume !(~i~0 < 10); {5430#true} is VALID [2018-11-23 12:14:29,413 INFO L273 TraceCheckUtils]: 82: Hoare triple {5430#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {5430#true} is VALID [2018-11-23 12:14:29,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:14:29,414 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {5430#true} {5431#false} #74#return; {5431#false} is VALID [2018-11-23 12:14:29,414 INFO L273 TraceCheckUtils]: 85: Hoare triple {5431#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5431#false} is VALID [2018-11-23 12:14:29,414 INFO L273 TraceCheckUtils]: 86: Hoare triple {5431#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5431#false} is VALID [2018-11-23 12:14:29,414 INFO L273 TraceCheckUtils]: 87: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2018-11-23 12:14:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-23 12:14:29,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:29,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:14:29,670 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:14:29,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:29,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:29,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2018-11-23 12:14:29,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {5430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5430#true} is VALID [2018-11-23 12:14:29,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:14:29,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #66#return; {5430#true} is VALID [2018-11-23 12:14:29,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret12 := main(); {5430#true} is VALID [2018-11-23 12:14:29,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {5430#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5430#true} is VALID [2018-11-23 12:14:29,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {5430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {5430#true} is VALID [2018-11-23 12:14:29,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {5430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5430#true} is VALID [2018-11-23 12:14:29,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {5430#true} assume !(~i~1 < 10); {5430#true} is VALID [2018-11-23 12:14:29,904 INFO L256 TraceCheckUtils]: 27: Hoare triple {5430#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:14:29,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {5430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5525#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:29,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {5525#(<= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5525#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:29,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {5525#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:29,905 INFO L273 TraceCheckUtils]: 31: Hoare triple {5433#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:29,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {5433#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:29,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {5434#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:29,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {5434#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:29,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {5435#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:29,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {5435#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:29,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:29,909 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:29,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= avg_~i~0 5)} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:14:29,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {5431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:14:29,910 INFO L273 TraceCheckUtils]: 41: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:14:29,910 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5431#false} {5430#true} #70#return; {5431#false} is VALID [2018-11-23 12:14:29,910 INFO L273 TraceCheckUtils]: 43: Hoare triple {5431#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5431#false} is VALID [2018-11-23 12:14:29,910 INFO L256 TraceCheckUtils]: 44: Hoare triple {5431#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {5431#false} is VALID [2018-11-23 12:14:29,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {5431#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5431#false} is VALID [2018-11-23 12:14:29,911 INFO L273 TraceCheckUtils]: 46: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,911 INFO L273 TraceCheckUtils]: 48: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,911 INFO L273 TraceCheckUtils]: 49: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,912 INFO L273 TraceCheckUtils]: 50: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,912 INFO L273 TraceCheckUtils]: 51: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,912 INFO L273 TraceCheckUtils]: 54: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,913 INFO L273 TraceCheckUtils]: 55: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,913 INFO L273 TraceCheckUtils]: 56: Hoare triple {5431#false} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:14:29,913 INFO L273 TraceCheckUtils]: 57: Hoare triple {5431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:14:29,913 INFO L273 TraceCheckUtils]: 58: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:14:29,913 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {5431#false} {5431#false} #72#return; {5431#false} is VALID [2018-11-23 12:14:29,914 INFO L273 TraceCheckUtils]: 60: Hoare triple {5431#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {5431#false} is VALID [2018-11-23 12:14:29,914 INFO L273 TraceCheckUtils]: 61: Hoare triple {5431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5431#false} is VALID [2018-11-23 12:14:29,914 INFO L273 TraceCheckUtils]: 62: Hoare triple {5431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5431#false} is VALID [2018-11-23 12:14:29,914 INFO L273 TraceCheckUtils]: 63: Hoare triple {5431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5431#false} is VALID [2018-11-23 12:14:29,914 INFO L273 TraceCheckUtils]: 64: Hoare triple {5431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5431#false} is VALID [2018-11-23 12:14:29,915 INFO L273 TraceCheckUtils]: 65: Hoare triple {5431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {5431#false} is VALID [2018-11-23 12:14:29,915 INFO L273 TraceCheckUtils]: 66: Hoare triple {5431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {5431#false} is VALID [2018-11-23 12:14:29,915 INFO L273 TraceCheckUtils]: 67: Hoare triple {5431#false} assume !(~i~2 < 9); {5431#false} is VALID [2018-11-23 12:14:29,915 INFO L273 TraceCheckUtils]: 68: Hoare triple {5431#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5431#false} is VALID [2018-11-23 12:14:29,915 INFO L256 TraceCheckUtils]: 69: Hoare triple {5431#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {5431#false} is VALID [2018-11-23 12:14:29,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {5431#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5431#false} is VALID [2018-11-23 12:14:29,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 72: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 73: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 74: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 75: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 76: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 77: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 78: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 79: Hoare triple {5431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {5431#false} is VALID [2018-11-23 12:14:29,916 INFO L273 TraceCheckUtils]: 80: Hoare triple {5431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5431#false} is VALID [2018-11-23 12:14:29,917 INFO L273 TraceCheckUtils]: 81: Hoare triple {5431#false} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:14:29,917 INFO L273 TraceCheckUtils]: 82: Hoare triple {5431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:14:29,917 INFO L273 TraceCheckUtils]: 83: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:14:29,917 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {5431#false} {5431#false} #74#return; {5431#false} is VALID [2018-11-23 12:14:29,917 INFO L273 TraceCheckUtils]: 85: Hoare triple {5431#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {5431#false} is VALID [2018-11-23 12:14:29,917 INFO L273 TraceCheckUtils]: 86: Hoare triple {5431#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5431#false} is VALID [2018-11-23 12:14:29,917 INFO L273 TraceCheckUtils]: 87: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2018-11-23 12:14:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 124 proven. 25 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-11-23 12:14:29,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:29,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:14:29,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-23 12:14:29,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:29,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:14:29,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:29,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:14:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:14:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:14:30,000 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 9 states. [2018-11-23 12:14:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:30,207 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-23 12:14:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:14:30,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-23 12:14:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:14:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 12:14:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:14:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 12:14:30,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2018-11-23 12:14:30,739 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-23 12:14:30,741 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:14:30,741 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:14:30,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:14:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:14:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 12:14:30,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:30,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 12:14:30,767 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 12:14:30,767 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 12:14:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:30,770 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 12:14:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 12:14:30,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:30,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:30,771 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 12:14:30,771 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 12:14:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:30,773 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 12:14:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 12:14:30,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:30,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:30,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:30,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:14:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-23 12:14:30,776 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 88 [2018-11-23 12:14:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:30,776 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-23 12:14:30,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:14:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:14:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:14:30,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:30,777 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:30,778 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:30,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1953474611, now seen corresponding path program 12 times [2018-11-23 12:14:30,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:30,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:30,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:32,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {6053#true} call ULTIMATE.init(); {6053#true} is VALID [2018-11-23 12:14:32,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {6053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6053#true} is VALID [2018-11-23 12:14:32,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:14:32,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6053#true} {6053#true} #66#return; {6053#true} is VALID [2018-11-23 12:14:32,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {6053#true} call #t~ret12 := main(); {6053#true} is VALID [2018-11-23 12:14:32,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {6053#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6053#true} is VALID [2018-11-23 12:14:32,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 17: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {6053#true} assume !(~i~1 < 10); {6053#true} is VALID [2018-11-23 12:14:32,142 INFO L256 TraceCheckUtils]: 27: Hoare triple {6053#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:14:32,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {6053#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6055#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:32,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {6055#(= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6055#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:32,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {6055#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6056#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:32,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {6056#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6056#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:32,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {6056#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6057#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:32,144 INFO L273 TraceCheckUtils]: 33: Hoare triple {6057#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6057#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:32,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {6057#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6058#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:32,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {6058#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6058#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:32,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {6058#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6059#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:32,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {6059#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6059#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:32,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6060#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:32,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {6060#(<= avg_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6060#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:32,148 INFO L273 TraceCheckUtils]: 40: Hoare triple {6060#(<= avg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6061#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:32,149 INFO L273 TraceCheckUtils]: 41: Hoare triple {6061#(<= avg_~i~0 6)} assume !(~i~0 < 10); {6054#false} is VALID [2018-11-23 12:14:32,149 INFO L273 TraceCheckUtils]: 42: Hoare triple {6054#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6054#false} is VALID [2018-11-23 12:14:32,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {6054#false} assume true; {6054#false} is VALID [2018-11-23 12:14:32,149 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6054#false} {6053#true} #70#return; {6054#false} is VALID [2018-11-23 12:14:32,150 INFO L273 TraceCheckUtils]: 45: Hoare triple {6054#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6054#false} is VALID [2018-11-23 12:14:32,150 INFO L256 TraceCheckUtils]: 46: Hoare triple {6054#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:14:32,150 INFO L273 TraceCheckUtils]: 47: Hoare triple {6053#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6053#true} is VALID [2018-11-23 12:14:32,150 INFO L273 TraceCheckUtils]: 48: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,150 INFO L273 TraceCheckUtils]: 49: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,151 INFO L273 TraceCheckUtils]: 50: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,151 INFO L273 TraceCheckUtils]: 52: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,151 INFO L273 TraceCheckUtils]: 53: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,151 INFO L273 TraceCheckUtils]: 54: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,152 INFO L273 TraceCheckUtils]: 56: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,152 INFO L273 TraceCheckUtils]: 57: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,152 INFO L273 TraceCheckUtils]: 58: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,153 INFO L273 TraceCheckUtils]: 60: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:14:32,153 INFO L273 TraceCheckUtils]: 61: Hoare triple {6053#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:14:32,153 INFO L273 TraceCheckUtils]: 62: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:14:32,153 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6053#true} {6054#false} #72#return; {6054#false} is VALID [2018-11-23 12:14:32,153 INFO L273 TraceCheckUtils]: 64: Hoare triple {6054#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6054#false} is VALID [2018-11-23 12:14:32,153 INFO L273 TraceCheckUtils]: 65: Hoare triple {6054#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 66: Hoare triple {6054#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 67: Hoare triple {6054#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 68: Hoare triple {6054#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 69: Hoare triple {6054#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 70: Hoare triple {6054#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 71: Hoare triple {6054#false} assume !(~i~2 < 9); {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 72: Hoare triple {6054#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6054#false} is VALID [2018-11-23 12:14:32,154 INFO L256 TraceCheckUtils]: 73: Hoare triple {6054#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:14:32,154 INFO L273 TraceCheckUtils]: 74: Hoare triple {6053#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 75: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 76: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 77: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 78: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 79: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 80: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 81: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,155 INFO L273 TraceCheckUtils]: 82: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 83: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 84: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 85: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 86: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 87: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 88: Hoare triple {6053#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 89: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:14:32,156 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {6053#true} {6054#false} #74#return; {6054#false} is VALID [2018-11-23 12:14:32,156 INFO L273 TraceCheckUtils]: 91: Hoare triple {6054#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6054#false} is VALID [2018-11-23 12:14:32,157 INFO L273 TraceCheckUtils]: 92: Hoare triple {6054#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6054#false} is VALID [2018-11-23 12:14:32,157 INFO L273 TraceCheckUtils]: 93: Hoare triple {6054#false} assume !false; {6054#false} is VALID [2018-11-23 12:14:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-11-23 12:14:32,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:32,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:32,172 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:14:32,298 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:14:32,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:32,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:32,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {6053#true} call ULTIMATE.init(); {6053#true} is VALID [2018-11-23 12:14:32,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {6053#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6053#true} is VALID [2018-11-23 12:14:32,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:14:32,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6053#true} {6053#true} #66#return; {6053#true} is VALID [2018-11-23 12:14:32,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {6053#true} call #t~ret12 := main(); {6053#true} is VALID [2018-11-23 12:14:32,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {6053#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6053#true} is VALID [2018-11-23 12:14:32,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 18: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 19: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,479 INFO L273 TraceCheckUtils]: 20: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 21: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 22: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {6053#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {6053#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {6053#true} assume !(~i~1 < 10); {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L256 TraceCheckUtils]: 27: Hoare triple {6053#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {6053#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6053#true} is VALID [2018-11-23 12:14:32,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 36: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L273 TraceCheckUtils]: 41: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {6053#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6053#true} {6053#true} #70#return; {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L273 TraceCheckUtils]: 45: Hoare triple {6053#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6053#true} is VALID [2018-11-23 12:14:32,482 INFO L256 TraceCheckUtils]: 46: Hoare triple {6053#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 47: Hoare triple {6053#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 48: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 49: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 50: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 53: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,483 INFO L273 TraceCheckUtils]: 54: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 55: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 56: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 58: Hoare triple {6053#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {6053#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 60: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 61: Hoare triple {6053#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L273 TraceCheckUtils]: 62: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:14:32,484 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6053#true} {6053#true} #72#return; {6053#true} is VALID [2018-11-23 12:14:32,486 INFO L273 TraceCheckUtils]: 64: Hoare triple {6053#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6257#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:32,486 INFO L273 TraceCheckUtils]: 65: Hoare triple {6257#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6257#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:32,486 INFO L273 TraceCheckUtils]: 66: Hoare triple {6257#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6264#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:32,487 INFO L273 TraceCheckUtils]: 67: Hoare triple {6264#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6264#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:32,488 INFO L273 TraceCheckUtils]: 68: Hoare triple {6264#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6271#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:32,488 INFO L273 TraceCheckUtils]: 69: Hoare triple {6271#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6271#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:32,489 INFO L273 TraceCheckUtils]: 70: Hoare triple {6271#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6278#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:32,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {6278#(<= main_~i~2 3)} assume !(~i~2 < 9); {6054#false} is VALID [2018-11-23 12:14:32,490 INFO L273 TraceCheckUtils]: 72: Hoare triple {6054#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6054#false} is VALID [2018-11-23 12:14:32,490 INFO L256 TraceCheckUtils]: 73: Hoare triple {6054#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {6054#false} is VALID [2018-11-23 12:14:32,490 INFO L273 TraceCheckUtils]: 74: Hoare triple {6054#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6054#false} is VALID [2018-11-23 12:14:32,490 INFO L273 TraceCheckUtils]: 75: Hoare triple {6054#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6054#false} is VALID [2018-11-23 12:14:32,491 INFO L273 TraceCheckUtils]: 76: Hoare triple {6054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#false} is VALID [2018-11-23 12:14:32,491 INFO L273 TraceCheckUtils]: 77: Hoare triple {6054#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6054#false} is VALID [2018-11-23 12:14:32,491 INFO L273 TraceCheckUtils]: 78: Hoare triple {6054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#false} is VALID [2018-11-23 12:14:32,491 INFO L273 TraceCheckUtils]: 79: Hoare triple {6054#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6054#false} is VALID [2018-11-23 12:14:32,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {6054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#false} is VALID [2018-11-23 12:14:32,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {6054#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6054#false} is VALID [2018-11-23 12:14:32,492 INFO L273 TraceCheckUtils]: 82: Hoare triple {6054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#false} is VALID [2018-11-23 12:14:32,492 INFO L273 TraceCheckUtils]: 83: Hoare triple {6054#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6054#false} is VALID [2018-11-23 12:14:32,492 INFO L273 TraceCheckUtils]: 84: Hoare triple {6054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#false} is VALID [2018-11-23 12:14:32,492 INFO L273 TraceCheckUtils]: 85: Hoare triple {6054#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L273 TraceCheckUtils]: 86: Hoare triple {6054#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L273 TraceCheckUtils]: 87: Hoare triple {6054#false} assume !(~i~0 < 10); {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L273 TraceCheckUtils]: 88: Hoare triple {6054#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L273 TraceCheckUtils]: 89: Hoare triple {6054#false} assume true; {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {6054#false} {6054#false} #74#return; {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L273 TraceCheckUtils]: 91: Hoare triple {6054#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L273 TraceCheckUtils]: 92: Hoare triple {6054#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6054#false} is VALID [2018-11-23 12:14:32,493 INFO L273 TraceCheckUtils]: 93: Hoare triple {6054#false} assume !false; {6054#false} is VALID [2018-11-23 12:14:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 178 proven. 9 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-23 12:14:32,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:32,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 12:14:32,517 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-23 12:14:32,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:32,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:14:32,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:32,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:14:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:14:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:14:32,577 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 13 states. [2018-11-23 12:14:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:32,916 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-23 12:14:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:14:32,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-23 12:14:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:14:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-23 12:14:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:14:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-23 12:14:32,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 76 transitions. [2018-11-23 12:14:33,506 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-23 12:14:33,508 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:14:33,510 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 12:14:33,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:14:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 12:14:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-23 12:14:33,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:33,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 65 states. [2018-11-23 12:14:33,548 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 65 states. [2018-11-23 12:14:33,548 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 65 states. [2018-11-23 12:14:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:33,550 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 12:14:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:14:33,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:33,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:33,551 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 67 states. [2018-11-23 12:14:33,551 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 67 states. [2018-11-23 12:14:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:33,553 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 12:14:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:14:33,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:33,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:33,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:33,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:14:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-23 12:14:33,556 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 94 [2018-11-23 12:14:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:33,556 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-23 12:14:33,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:14:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:14:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 12:14:33,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:33,557 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:33,558 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:33,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:33,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2019788361, now seen corresponding path program 13 times [2018-11-23 12:14:33,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:33,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:33,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:33,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:34,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {6724#true} call ULTIMATE.init(); {6724#true} is VALID [2018-11-23 12:14:34,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {6724#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6724#true} is VALID [2018-11-23 12:14:34,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:14:34,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6724#true} {6724#true} #66#return; {6724#true} is VALID [2018-11-23 12:14:34,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {6724#true} call #t~ret12 := main(); {6724#true} is VALID [2018-11-23 12:14:34,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {6724#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6724#true} is VALID [2018-11-23 12:14:34,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {6724#true} assume !(~i~1 < 10); {6724#true} is VALID [2018-11-23 12:14:34,075 INFO L256 TraceCheckUtils]: 27: Hoare triple {6724#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:14:34,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {6724#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6726#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:34,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {6726#(= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6726#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:34,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {6726#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6727#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:34,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {6727#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6727#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:34,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {6727#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6728#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:34,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {6728#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6728#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:34,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {6728#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6729#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:34,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {6729#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6729#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:34,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {6729#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6730#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:34,079 INFO L273 TraceCheckUtils]: 37: Hoare triple {6730#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6730#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:34,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {6730#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6731#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:34,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {6731#(<= avg_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6731#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:34,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {6731#(<= avg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6732#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:34,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {6732#(<= avg_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6732#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:34,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {6732#(<= avg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6733#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:34,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {6733#(<= avg_~i~0 7)} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:14:34,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {6725#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:14:34,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:14:34,083 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {6725#false} {6724#true} #70#return; {6725#false} is VALID [2018-11-23 12:14:34,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {6725#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6725#false} is VALID [2018-11-23 12:14:34,084 INFO L256 TraceCheckUtils]: 48: Hoare triple {6725#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:14:34,084 INFO L273 TraceCheckUtils]: 49: Hoare triple {6724#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6724#true} is VALID [2018-11-23 12:14:34,084 INFO L273 TraceCheckUtils]: 50: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,084 INFO L273 TraceCheckUtils]: 51: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,085 INFO L273 TraceCheckUtils]: 52: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,085 INFO L273 TraceCheckUtils]: 53: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,085 INFO L273 TraceCheckUtils]: 54: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,085 INFO L273 TraceCheckUtils]: 55: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,086 INFO L273 TraceCheckUtils]: 58: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,086 INFO L273 TraceCheckUtils]: 59: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,086 INFO L273 TraceCheckUtils]: 60: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,086 INFO L273 TraceCheckUtils]: 61: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,086 INFO L273 TraceCheckUtils]: 62: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,086 INFO L273 TraceCheckUtils]: 63: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 64: Hoare triple {6724#true} assume !(~i~0 < 10); {6724#true} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 65: Hoare triple {6724#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6724#true} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 66: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:14:34,087 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {6724#true} {6725#false} #72#return; {6725#false} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 68: Hoare triple {6725#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6725#false} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 69: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 70: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 71: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,087 INFO L273 TraceCheckUtils]: 72: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,088 INFO L273 TraceCheckUtils]: 73: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,088 INFO L273 TraceCheckUtils]: 75: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,088 INFO L273 TraceCheckUtils]: 76: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,088 INFO L273 TraceCheckUtils]: 77: Hoare triple {6725#false} assume !(~i~2 < 9); {6725#false} is VALID [2018-11-23 12:14:34,088 INFO L273 TraceCheckUtils]: 78: Hoare triple {6725#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6725#false} is VALID [2018-11-23 12:14:34,088 INFO L256 TraceCheckUtils]: 79: Hoare triple {6725#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:14:34,088 INFO L273 TraceCheckUtils]: 80: Hoare triple {6724#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 81: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 82: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 83: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 84: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 85: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 86: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 87: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 88: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,089 INFO L273 TraceCheckUtils]: 89: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 90: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 91: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 92: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 93: Hoare triple {6724#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 94: Hoare triple {6724#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 95: Hoare triple {6724#true} assume !(~i~0 < 10); {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 96: Hoare triple {6724#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6724#true} is VALID [2018-11-23 12:14:34,090 INFO L273 TraceCheckUtils]: 97: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:14:34,091 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {6724#true} {6725#false} #74#return; {6725#false} is VALID [2018-11-23 12:14:34,091 INFO L273 TraceCheckUtils]: 99: Hoare triple {6725#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6725#false} is VALID [2018-11-23 12:14:34,091 INFO L273 TraceCheckUtils]: 100: Hoare triple {6725#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6725#false} is VALID [2018-11-23 12:14:34,091 INFO L273 TraceCheckUtils]: 101: Hoare triple {6725#false} assume !false; {6725#false} is VALID [2018-11-23 12:14:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-11-23 12:14:34,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:34,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:34,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:34,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:34,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {6724#true} call ULTIMATE.init(); {6724#true} is VALID [2018-11-23 12:14:34,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {6724#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6724#true} is VALID [2018-11-23 12:14:34,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:14:34,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6724#true} {6724#true} #66#return; {6724#true} is VALID [2018-11-23 12:14:34,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {6724#true} call #t~ret12 := main(); {6724#true} is VALID [2018-11-23 12:14:34,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {6724#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6724#true} is VALID [2018-11-23 12:14:34,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 14: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 20: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,437 INFO L273 TraceCheckUtils]: 21: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,438 INFO L273 TraceCheckUtils]: 24: Hoare triple {6724#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {6724#true} is VALID [2018-11-23 12:14:34,438 INFO L273 TraceCheckUtils]: 25: Hoare triple {6724#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6724#true} is VALID [2018-11-23 12:14:34,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {6724#true} assume !(~i~1 < 10); {6724#true} is VALID [2018-11-23 12:14:34,438 INFO L256 TraceCheckUtils]: 27: Hoare triple {6724#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:14:34,439 INFO L273 TraceCheckUtils]: 28: Hoare triple {6724#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6821#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:34,439 INFO L273 TraceCheckUtils]: 29: Hoare triple {6821#(<= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6821#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:34,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {6821#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6727#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:34,440 INFO L273 TraceCheckUtils]: 31: Hoare triple {6727#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6727#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:34,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {6727#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6728#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:34,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {6728#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6728#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:34,441 INFO L273 TraceCheckUtils]: 34: Hoare triple {6728#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6729#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:34,441 INFO L273 TraceCheckUtils]: 35: Hoare triple {6729#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6729#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:34,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {6729#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6730#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:34,442 INFO L273 TraceCheckUtils]: 37: Hoare triple {6730#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6730#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:34,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {6730#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6731#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:34,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {6731#(<= avg_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6731#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:34,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {6731#(<= avg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6732#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:34,445 INFO L273 TraceCheckUtils]: 41: Hoare triple {6732#(<= avg_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6732#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:34,446 INFO L273 TraceCheckUtils]: 42: Hoare triple {6732#(<= avg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6733#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:34,446 INFO L273 TraceCheckUtils]: 43: Hoare triple {6733#(<= avg_~i~0 7)} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:14:34,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {6725#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:14:34,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:14:34,447 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {6725#false} {6724#true} #70#return; {6725#false} is VALID [2018-11-23 12:14:34,447 INFO L273 TraceCheckUtils]: 47: Hoare triple {6725#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6725#false} is VALID [2018-11-23 12:14:34,447 INFO L256 TraceCheckUtils]: 48: Hoare triple {6725#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {6725#false} is VALID [2018-11-23 12:14:34,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {6725#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6725#false} is VALID [2018-11-23 12:14:34,448 INFO L273 TraceCheckUtils]: 50: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,448 INFO L273 TraceCheckUtils]: 51: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,448 INFO L273 TraceCheckUtils]: 52: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,449 INFO L273 TraceCheckUtils]: 54: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,449 INFO L273 TraceCheckUtils]: 58: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 59: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 60: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 62: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 63: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 64: Hoare triple {6725#false} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 65: Hoare triple {6725#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:14:34,450 INFO L273 TraceCheckUtils]: 66: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {6725#false} {6725#false} #72#return; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 68: Hoare triple {6725#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 69: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 70: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 71: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 72: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 73: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 74: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,451 INFO L273 TraceCheckUtils]: 75: Hoare triple {6725#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 76: Hoare triple {6725#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 77: Hoare triple {6725#false} assume !(~i~2 < 9); {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 78: Hoare triple {6725#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L256 TraceCheckUtils]: 79: Hoare triple {6725#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 80: Hoare triple {6725#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 81: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 82: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 83: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,452 INFO L273 TraceCheckUtils]: 84: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 85: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 86: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 87: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 88: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 89: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 90: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 91: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,453 INFO L273 TraceCheckUtils]: 92: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 93: Hoare triple {6725#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 94: Hoare triple {6725#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 95: Hoare triple {6725#false} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 96: Hoare triple {6725#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 97: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {6725#false} {6725#false} #74#return; {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 99: Hoare triple {6725#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 100: Hoare triple {6725#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6725#false} is VALID [2018-11-23 12:14:34,454 INFO L273 TraceCheckUtils]: 101: Hoare triple {6725#false} assume !false; {6725#false} is VALID [2018-11-23 12:14:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-11-23 12:14:34,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:34,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:14:34,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-11-23 12:14:34,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:34,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:14:34,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:34,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:14:34,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:14:34,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:34,597 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 11 states. [2018-11-23 12:14:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:34,990 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-11-23 12:14:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:14:34,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-11-23 12:14:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 12:14:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 12:14:34,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2018-11-23 12:14:35,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:35,076 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:14:35,076 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:14:35,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:14:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 12:14:35,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:35,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 67 states. [2018-11-23 12:14:35,108 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 67 states. [2018-11-23 12:14:35,108 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 67 states. [2018-11-23 12:14:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:35,113 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 12:14:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 12:14:35,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:35,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:35,114 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 68 states. [2018-11-23 12:14:35,114 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 68 states. [2018-11-23 12:14:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:35,116 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 12:14:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 12:14:35,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:35,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:35,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:35,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:14:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:14:35,118 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 102 [2018-11-23 12:14:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:35,119 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:14:35,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:14:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:14:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:14:35,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:35,120 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:35,120 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 574148423, now seen corresponding path program 14 times [2018-11-23 12:14:35,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:35,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:35,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:35,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:35,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {7430#true} call ULTIMATE.init(); {7430#true} is VALID [2018-11-23 12:14:35,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {7430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7430#true} is VALID [2018-11-23 12:14:35,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:14:35,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7430#true} {7430#true} #66#return; {7430#true} is VALID [2018-11-23 12:14:35,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {7430#true} call #t~ret12 := main(); {7430#true} is VALID [2018-11-23 12:14:35,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {7430#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7430#true} is VALID [2018-11-23 12:14:35,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,646 INFO L273 TraceCheckUtils]: 20: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,647 INFO L273 TraceCheckUtils]: 22: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,647 INFO L273 TraceCheckUtils]: 25: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {7430#true} assume !(~i~1 < 10); {7430#true} is VALID [2018-11-23 12:14:35,647 INFO L256 TraceCheckUtils]: 27: Hoare triple {7430#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:14:35,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {7430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7432#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:35,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {7432#(= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7432#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:35,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {7432#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:35,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {7433#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:35,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {7433#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:35,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {7434#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:35,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {7434#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:35,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {7435#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:35,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {7435#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:35,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {7436#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:35,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {7436#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7437#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:35,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {7437#(<= avg_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7437#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:35,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {7437#(<= avg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7438#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:35,653 INFO L273 TraceCheckUtils]: 41: Hoare triple {7438#(<= avg_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7438#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:35,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {7438#(<= avg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7439#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:35,655 INFO L273 TraceCheckUtils]: 43: Hoare triple {7439#(<= avg_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7439#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:35,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {7439#(<= avg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7440#(<= avg_~i~0 8)} is VALID [2018-11-23 12:14:35,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {7440#(<= avg_~i~0 8)} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:14:35,656 INFO L273 TraceCheckUtils]: 46: Hoare triple {7431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:14:35,657 INFO L273 TraceCheckUtils]: 47: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:14:35,657 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {7431#false} {7430#true} #70#return; {7431#false} is VALID [2018-11-23 12:14:35,657 INFO L273 TraceCheckUtils]: 49: Hoare triple {7431#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7431#false} is VALID [2018-11-23 12:14:35,657 INFO L256 TraceCheckUtils]: 50: Hoare triple {7431#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:14:35,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {7430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7430#true} is VALID [2018-11-23 12:14:35,658 INFO L273 TraceCheckUtils]: 52: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,658 INFO L273 TraceCheckUtils]: 53: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,658 INFO L273 TraceCheckUtils]: 54: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 61: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 62: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 63: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,659 INFO L273 TraceCheckUtils]: 64: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,660 INFO L273 TraceCheckUtils]: 65: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,660 INFO L273 TraceCheckUtils]: 66: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,660 INFO L273 TraceCheckUtils]: 67: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {7430#true} assume !(~i~0 < 10); {7430#true} is VALID [2018-11-23 12:14:35,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {7430#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {7430#true} is VALID [2018-11-23 12:14:35,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:14:35,660 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {7430#true} {7431#false} #72#return; {7431#false} is VALID [2018-11-23 12:14:35,660 INFO L273 TraceCheckUtils]: 72: Hoare triple {7431#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 73: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 74: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 75: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 78: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 79: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 80: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,661 INFO L273 TraceCheckUtils]: 81: Hoare triple {7431#false} assume !(~i~2 < 9); {7431#false} is VALID [2018-11-23 12:14:35,662 INFO L273 TraceCheckUtils]: 82: Hoare triple {7431#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {7431#false} is VALID [2018-11-23 12:14:35,662 INFO L256 TraceCheckUtils]: 83: Hoare triple {7431#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:14:35,662 INFO L273 TraceCheckUtils]: 84: Hoare triple {7430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7430#true} is VALID [2018-11-23 12:14:35,662 INFO L273 TraceCheckUtils]: 85: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,662 INFO L273 TraceCheckUtils]: 86: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,662 INFO L273 TraceCheckUtils]: 87: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,662 INFO L273 TraceCheckUtils]: 88: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,662 INFO L273 TraceCheckUtils]: 89: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 90: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 91: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 92: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 93: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 94: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 95: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,663 INFO L273 TraceCheckUtils]: 98: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 99: Hoare triple {7430#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7430#true} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 100: Hoare triple {7430#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7430#true} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 101: Hoare triple {7430#true} assume !(~i~0 < 10); {7430#true} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 102: Hoare triple {7430#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {7430#true} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 103: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:14:35,664 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7430#true} {7431#false} #74#return; {7431#false} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 105: Hoare triple {7431#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7431#false} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 106: Hoare triple {7431#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7431#false} is VALID [2018-11-23 12:14:35,664 INFO L273 TraceCheckUtils]: 107: Hoare triple {7431#false} assume !false; {7431#false} is VALID [2018-11-23 12:14:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2018-11-23 12:14:35,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:35,670 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:35,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:14:35,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:14:35,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:35,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:35,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {7430#true} call ULTIMATE.init(); {7430#true} is VALID [2018-11-23 12:14:35,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {7430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7430#true} is VALID [2018-11-23 12:14:35,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:14:35,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7430#true} {7430#true} #66#return; {7430#true} is VALID [2018-11-23 12:14:35,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {7430#true} call #t~ret12 := main(); {7430#true} is VALID [2018-11-23 12:14:35,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {7430#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7430#true} is VALID [2018-11-23 12:14:35,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 13: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 20: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {7430#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {7430#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {7430#true} assume !(~i~1 < 10); {7430#true} is VALID [2018-11-23 12:14:35,946 INFO L256 TraceCheckUtils]: 27: Hoare triple {7430#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:14:35,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {7430#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7528#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:35,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {7528#(<= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7528#(<= avg_~i~0 0)} is VALID [2018-11-23 12:14:35,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {7528#(<= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:35,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {7433#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7433#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:35,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {7433#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:35,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {7434#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7434#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:35,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {7434#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:35,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {7435#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7435#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:35,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {7435#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:35,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {7436#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7436#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:35,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {7436#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7437#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:35,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {7437#(<= avg_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7437#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:35,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {7437#(<= avg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7438#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:35,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {7438#(<= avg_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7438#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:35,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {7438#(<= avg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7439#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:35,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {7439#(<= avg_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7439#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:35,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {7439#(<= avg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7440#(<= avg_~i~0 8)} is VALID [2018-11-23 12:14:35,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {7440#(<= avg_~i~0 8)} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:14:35,956 INFO L273 TraceCheckUtils]: 46: Hoare triple {7431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:14:35,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:14:35,956 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {7431#false} {7430#true} #70#return; {7431#false} is VALID [2018-11-23 12:14:35,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {7431#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7431#false} is VALID [2018-11-23 12:14:35,957 INFO L256 TraceCheckUtils]: 50: Hoare triple {7431#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {7431#false} is VALID [2018-11-23 12:14:35,957 INFO L273 TraceCheckUtils]: 51: Hoare triple {7431#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7431#false} is VALID [2018-11-23 12:14:35,957 INFO L273 TraceCheckUtils]: 52: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,958 INFO L273 TraceCheckUtils]: 57: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,958 INFO L273 TraceCheckUtils]: 58: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,958 INFO L273 TraceCheckUtils]: 59: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,958 INFO L273 TraceCheckUtils]: 60: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,959 INFO L273 TraceCheckUtils]: 61: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,959 INFO L273 TraceCheckUtils]: 64: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,959 INFO L273 TraceCheckUtils]: 65: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 66: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 67: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 68: Hoare triple {7431#false} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 69: Hoare triple {7431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 70: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {7431#false} {7431#false} #72#return; {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 72: Hoare triple {7431#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 73: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,960 INFO L273 TraceCheckUtils]: 74: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 75: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 76: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 77: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 78: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 79: Hoare triple {7431#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 80: Hoare triple {7431#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 81: Hoare triple {7431#false} assume !(~i~2 < 9); {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L273 TraceCheckUtils]: 82: Hoare triple {7431#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {7431#false} is VALID [2018-11-23 12:14:35,961 INFO L256 TraceCheckUtils]: 83: Hoare triple {7431#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 84: Hoare triple {7431#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 85: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 86: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 87: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 88: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 89: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 90: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 91: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,962 INFO L273 TraceCheckUtils]: 92: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 93: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 94: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 95: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 96: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 97: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 98: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 99: Hoare triple {7431#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 100: Hoare triple {7431#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7431#false} is VALID [2018-11-23 12:14:35,963 INFO L273 TraceCheckUtils]: 101: Hoare triple {7431#false} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:14:35,964 INFO L273 TraceCheckUtils]: 102: Hoare triple {7431#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:14:35,964 INFO L273 TraceCheckUtils]: 103: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:14:35,964 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7431#false} {7431#false} #74#return; {7431#false} is VALID [2018-11-23 12:14:35,964 INFO L273 TraceCheckUtils]: 105: Hoare triple {7431#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {7431#false} is VALID [2018-11-23 12:14:35,964 INFO L273 TraceCheckUtils]: 106: Hoare triple {7431#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7431#false} is VALID [2018-11-23 12:14:35,964 INFO L273 TraceCheckUtils]: 107: Hoare triple {7431#false} assume !false; {7431#false} is VALID [2018-11-23 12:14:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 292 proven. 64 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2018-11-23 12:14:35,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:35,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:14:35,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-11-23 12:14:35,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:35,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:14:36,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:36,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:14:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:14:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:36,057 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 12 states. [2018-11-23 12:14:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:36,284 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-11-23 12:14:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:14:36,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-11-23 12:14:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:14:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:14:36,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:14:36,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:36,379 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:14:36,379 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:14:36,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:14:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:14:36,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:36,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:14:36,411 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:14:36,411 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:14:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:36,413 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:14:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:14:36,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:36,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:36,414 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:14:36,415 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:14:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:36,416 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:14:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:14:36,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:36,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:36,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:36,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:14:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:14:36,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 108 [2018-11-23 12:14:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:36,418 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:14:36,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:14:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:14:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 12:14:36,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:36,420 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:36,420 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:36,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 91857349, now seen corresponding path program 15 times [2018-11-23 12:14:36,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:36,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:36,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:36,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:36,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {8168#true} call ULTIMATE.init(); {8168#true} is VALID [2018-11-23 12:14:36,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {8168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8168#true} is VALID [2018-11-23 12:14:36,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:14:36,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8168#true} {8168#true} #66#return; {8168#true} is VALID [2018-11-23 12:14:36,645 INFO L256 TraceCheckUtils]: 4: Hoare triple {8168#true} call #t~ret12 := main(); {8168#true} is VALID [2018-11-23 12:14:36,645 INFO L273 TraceCheckUtils]: 5: Hoare triple {8168#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8168#true} is VALID [2018-11-23 12:14:36,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,649 INFO L273 TraceCheckUtils]: 24: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:36,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:36,650 INFO L273 TraceCheckUtils]: 26: Hoare triple {8168#true} assume !(~i~1 < 10); {8168#true} is VALID [2018-11-23 12:14:36,650 INFO L256 TraceCheckUtils]: 27: Hoare triple {8168#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:14:36,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {8168#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8170#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:36,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {8170#(= avg_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8170#(= avg_~i~0 0)} is VALID [2018-11-23 12:14:36,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {8170#(= avg_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8171#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:36,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {8171#(<= avg_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8171#(<= avg_~i~0 1)} is VALID [2018-11-23 12:14:36,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {8171#(<= avg_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8172#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:36,652 INFO L273 TraceCheckUtils]: 33: Hoare triple {8172#(<= avg_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8172#(<= avg_~i~0 2)} is VALID [2018-11-23 12:14:36,653 INFO L273 TraceCheckUtils]: 34: Hoare triple {8172#(<= avg_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8173#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:36,653 INFO L273 TraceCheckUtils]: 35: Hoare triple {8173#(<= avg_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8173#(<= avg_~i~0 3)} is VALID [2018-11-23 12:14:36,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {8173#(<= avg_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8174#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:36,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {8174#(<= avg_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8174#(<= avg_~i~0 4)} is VALID [2018-11-23 12:14:36,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {8174#(<= avg_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8175#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:36,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {8175#(<= avg_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8175#(<= avg_~i~0 5)} is VALID [2018-11-23 12:14:36,657 INFO L273 TraceCheckUtils]: 40: Hoare triple {8175#(<= avg_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8176#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:36,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {8176#(<= avg_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8176#(<= avg_~i~0 6)} is VALID [2018-11-23 12:14:36,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {8176#(<= avg_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8177#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:36,659 INFO L273 TraceCheckUtils]: 43: Hoare triple {8177#(<= avg_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8177#(<= avg_~i~0 7)} is VALID [2018-11-23 12:14:36,660 INFO L273 TraceCheckUtils]: 44: Hoare triple {8177#(<= avg_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8178#(<= avg_~i~0 8)} is VALID [2018-11-23 12:14:36,661 INFO L273 TraceCheckUtils]: 45: Hoare triple {8178#(<= avg_~i~0 8)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8178#(<= avg_~i~0 8)} is VALID [2018-11-23 12:14:36,661 INFO L273 TraceCheckUtils]: 46: Hoare triple {8178#(<= avg_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8179#(<= avg_~i~0 9)} is VALID [2018-11-23 12:14:36,662 INFO L273 TraceCheckUtils]: 47: Hoare triple {8179#(<= avg_~i~0 9)} assume !(~i~0 < 10); {8169#false} is VALID [2018-11-23 12:14:36,662 INFO L273 TraceCheckUtils]: 48: Hoare triple {8169#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8169#false} is VALID [2018-11-23 12:14:36,662 INFO L273 TraceCheckUtils]: 49: Hoare triple {8169#false} assume true; {8169#false} is VALID [2018-11-23 12:14:36,662 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {8169#false} {8168#true} #70#return; {8169#false} is VALID [2018-11-23 12:14:36,662 INFO L273 TraceCheckUtils]: 51: Hoare triple {8169#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8169#false} is VALID [2018-11-23 12:14:36,663 INFO L256 TraceCheckUtils]: 52: Hoare triple {8169#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:14:36,663 INFO L273 TraceCheckUtils]: 53: Hoare triple {8168#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8168#true} is VALID [2018-11-23 12:14:36,663 INFO L273 TraceCheckUtils]: 54: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,663 INFO L273 TraceCheckUtils]: 55: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,663 INFO L273 TraceCheckUtils]: 56: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,663 INFO L273 TraceCheckUtils]: 57: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,663 INFO L273 TraceCheckUtils]: 58: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,664 INFO L273 TraceCheckUtils]: 59: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,664 INFO L273 TraceCheckUtils]: 60: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,664 INFO L273 TraceCheckUtils]: 61: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,664 INFO L273 TraceCheckUtils]: 62: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,665 INFO L273 TraceCheckUtils]: 63: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,665 INFO L273 TraceCheckUtils]: 64: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,665 INFO L273 TraceCheckUtils]: 65: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,665 INFO L273 TraceCheckUtils]: 66: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,666 INFO L273 TraceCheckUtils]: 67: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,666 INFO L273 TraceCheckUtils]: 68: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,666 INFO L273 TraceCheckUtils]: 69: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,666 INFO L273 TraceCheckUtils]: 70: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,667 INFO L273 TraceCheckUtils]: 71: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,667 INFO L273 TraceCheckUtils]: 72: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:14:36,667 INFO L273 TraceCheckUtils]: 73: Hoare triple {8168#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:14:36,667 INFO L273 TraceCheckUtils]: 74: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:14:36,667 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8168#true} {8169#false} #72#return; {8169#false} is VALID [2018-11-23 12:14:36,667 INFO L273 TraceCheckUtils]: 76: Hoare triple {8169#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {8169#false} is VALID [2018-11-23 12:14:36,667 INFO L273 TraceCheckUtils]: 77: Hoare triple {8169#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8169#false} is VALID [2018-11-23 12:14:36,668 INFO L273 TraceCheckUtils]: 78: Hoare triple {8169#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8169#false} is VALID [2018-11-23 12:14:36,668 INFO L273 TraceCheckUtils]: 79: Hoare triple {8169#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8169#false} is VALID [2018-11-23 12:14:36,668 INFO L273 TraceCheckUtils]: 80: Hoare triple {8169#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8169#false} is VALID [2018-11-23 12:14:36,668 INFO L273 TraceCheckUtils]: 81: Hoare triple {8169#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8169#false} is VALID [2018-11-23 12:14:36,668 INFO L273 TraceCheckUtils]: 82: Hoare triple {8169#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8169#false} is VALID [2018-11-23 12:14:36,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {8169#false} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8169#false} is VALID [2018-11-23 12:14:36,669 INFO L273 TraceCheckUtils]: 84: Hoare triple {8169#false} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8169#false} is VALID [2018-11-23 12:14:36,669 INFO L273 TraceCheckUtils]: 85: Hoare triple {8169#false} assume !(~i~2 < 9); {8169#false} is VALID [2018-11-23 12:14:36,669 INFO L273 TraceCheckUtils]: 86: Hoare triple {8169#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8169#false} is VALID [2018-11-23 12:14:36,669 INFO L256 TraceCheckUtils]: 87: Hoare triple {8169#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:14:36,669 INFO L273 TraceCheckUtils]: 88: Hoare triple {8168#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8168#true} is VALID [2018-11-23 12:14:36,669 INFO L273 TraceCheckUtils]: 89: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,669 INFO L273 TraceCheckUtils]: 90: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,670 INFO L273 TraceCheckUtils]: 91: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,670 INFO L273 TraceCheckUtils]: 92: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,670 INFO L273 TraceCheckUtils]: 93: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,670 INFO L273 TraceCheckUtils]: 94: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,670 INFO L273 TraceCheckUtils]: 95: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,670 INFO L273 TraceCheckUtils]: 96: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,670 INFO L273 TraceCheckUtils]: 97: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,671 INFO L273 TraceCheckUtils]: 98: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,671 INFO L273 TraceCheckUtils]: 99: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,671 INFO L273 TraceCheckUtils]: 100: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,671 INFO L273 TraceCheckUtils]: 101: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,671 INFO L273 TraceCheckUtils]: 102: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,671 INFO L273 TraceCheckUtils]: 103: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,671 INFO L273 TraceCheckUtils]: 104: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,672 INFO L273 TraceCheckUtils]: 105: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:36,672 INFO L273 TraceCheckUtils]: 106: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:36,672 INFO L273 TraceCheckUtils]: 107: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:14:36,672 INFO L273 TraceCheckUtils]: 108: Hoare triple {8168#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:14:36,672 INFO L273 TraceCheckUtils]: 109: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:14:36,672 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {8168#true} {8169#false} #74#return; {8169#false} is VALID [2018-11-23 12:14:36,672 INFO L273 TraceCheckUtils]: 111: Hoare triple {8169#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8169#false} is VALID [2018-11-23 12:14:36,673 INFO L273 TraceCheckUtils]: 112: Hoare triple {8169#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8169#false} is VALID [2018-11-23 12:14:36,673 INFO L273 TraceCheckUtils]: 113: Hoare triple {8169#false} assume !false; {8169#false} is VALID [2018-11-23 12:14:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 449 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-11-23 12:14:36,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:36,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:36,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:14:36,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:14:36,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:36,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:37,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {8168#true} call ULTIMATE.init(); {8168#true} is VALID [2018-11-23 12:14:37,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {8168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8168#true} is VALID [2018-11-23 12:14:37,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:14:37,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8168#true} {8168#true} #66#return; {8168#true} is VALID [2018-11-23 12:14:37,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {8168#true} call #t~ret12 := main(); {8168#true} is VALID [2018-11-23 12:14:37,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {8168#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8168#true} is VALID [2018-11-23 12:14:37,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 19: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 20: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {8168#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {8168#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {8168#true} assume !(~i~1 < 10); {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L256 TraceCheckUtils]: 27: Hoare triple {8168#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 28: Hoare triple {8168#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,059 INFO L273 TraceCheckUtils]: 32: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 34: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 35: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 39: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 40: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,060 INFO L273 TraceCheckUtils]: 41: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 42: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 43: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 44: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 45: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 46: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 47: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 48: Hoare triple {8168#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L273 TraceCheckUtils]: 49: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:14:37,061 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {8168#true} {8168#true} #70#return; {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 51: Hoare triple {8168#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L256 TraceCheckUtils]: 52: Hoare triple {8168#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {8168#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 54: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 55: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 56: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 57: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 58: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,062 INFO L273 TraceCheckUtils]: 59: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 60: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 61: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 62: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 63: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 64: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 65: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 66: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 67: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,063 INFO L273 TraceCheckUtils]: 68: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,064 INFO L273 TraceCheckUtils]: 69: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,064 INFO L273 TraceCheckUtils]: 70: Hoare triple {8168#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8168#true} is VALID [2018-11-23 12:14:37,064 INFO L273 TraceCheckUtils]: 71: Hoare triple {8168#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8168#true} is VALID [2018-11-23 12:14:37,064 INFO L273 TraceCheckUtils]: 72: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:14:37,064 INFO L273 TraceCheckUtils]: 73: Hoare triple {8168#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:14:37,064 INFO L273 TraceCheckUtils]: 74: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:14:37,064 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8168#true} {8168#true} #72#return; {8168#true} is VALID [2018-11-23 12:14:37,065 INFO L273 TraceCheckUtils]: 76: Hoare triple {8168#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {8411#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:37,065 INFO L273 TraceCheckUtils]: 77: Hoare triple {8411#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8411#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:37,066 INFO L273 TraceCheckUtils]: 78: Hoare triple {8411#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8418#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:37,066 INFO L273 TraceCheckUtils]: 79: Hoare triple {8418#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8418#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:37,066 INFO L273 TraceCheckUtils]: 80: Hoare triple {8418#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8425#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:37,067 INFO L273 TraceCheckUtils]: 81: Hoare triple {8425#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8425#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:37,067 INFO L273 TraceCheckUtils]: 82: Hoare triple {8425#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8432#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:37,067 INFO L273 TraceCheckUtils]: 83: Hoare triple {8432#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8432#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:37,068 INFO L273 TraceCheckUtils]: 84: Hoare triple {8432#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8439#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:37,069 INFO L273 TraceCheckUtils]: 85: Hoare triple {8439#(<= main_~i~2 4)} assume !(~i~2 < 9); {8169#false} is VALID [2018-11-23 12:14:37,069 INFO L273 TraceCheckUtils]: 86: Hoare triple {8169#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8169#false} is VALID [2018-11-23 12:14:37,069 INFO L256 TraceCheckUtils]: 87: Hoare triple {8169#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {8169#false} is VALID [2018-11-23 12:14:37,069 INFO L273 TraceCheckUtils]: 88: Hoare triple {8169#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8169#false} is VALID [2018-11-23 12:14:37,070 INFO L273 TraceCheckUtils]: 89: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,070 INFO L273 TraceCheckUtils]: 90: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,070 INFO L273 TraceCheckUtils]: 91: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,070 INFO L273 TraceCheckUtils]: 92: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,070 INFO L273 TraceCheckUtils]: 93: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,071 INFO L273 TraceCheckUtils]: 94: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,071 INFO L273 TraceCheckUtils]: 95: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,071 INFO L273 TraceCheckUtils]: 96: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,071 INFO L273 TraceCheckUtils]: 97: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,071 INFO L273 TraceCheckUtils]: 98: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,071 INFO L273 TraceCheckUtils]: 99: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,072 INFO L273 TraceCheckUtils]: 100: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,072 INFO L273 TraceCheckUtils]: 101: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,072 INFO L273 TraceCheckUtils]: 102: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,072 INFO L273 TraceCheckUtils]: 103: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,072 INFO L273 TraceCheckUtils]: 104: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,073 INFO L273 TraceCheckUtils]: 105: Hoare triple {8169#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8169#false} is VALID [2018-11-23 12:14:37,073 INFO L273 TraceCheckUtils]: 106: Hoare triple {8169#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8169#false} is VALID [2018-11-23 12:14:37,073 INFO L273 TraceCheckUtils]: 107: Hoare triple {8169#false} assume !(~i~0 < 10); {8169#false} is VALID [2018-11-23 12:14:37,073 INFO L273 TraceCheckUtils]: 108: Hoare triple {8169#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8169#false} is VALID [2018-11-23 12:14:37,073 INFO L273 TraceCheckUtils]: 109: Hoare triple {8169#false} assume true; {8169#false} is VALID [2018-11-23 12:14:37,074 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {8169#false} {8169#false} #74#return; {8169#false} is VALID [2018-11-23 12:14:37,074 INFO L273 TraceCheckUtils]: 111: Hoare triple {8169#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8169#false} is VALID [2018-11-23 12:14:37,074 INFO L273 TraceCheckUtils]: 112: Hoare triple {8169#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8169#false} is VALID [2018-11-23 12:14:37,074 INFO L273 TraceCheckUtils]: 113: Hoare triple {8169#false} assume !false; {8169#false} is VALID [2018-11-23 12:14:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 370 proven. 16 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-23 12:14:37,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:37,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 12:14:37,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-11-23 12:14:37,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:37,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:14:37,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:37,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:14:37,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:14:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:14:37,166 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 17 states. [2018-11-23 12:14:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:37,901 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-23 12:14:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:14:37,901 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-11-23 12:14:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:14:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2018-11-23 12:14:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:14:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2018-11-23 12:14:37,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 83 transitions. [2018-11-23 12:14:37,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:37,999 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:14:37,999 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:14:38,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:14:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:14:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 12:14:38,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:38,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-23 12:14:38,025 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-23 12:14:38,026 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-23 12:14:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:38,028 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 12:14:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 12:14:38,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:38,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:38,029 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-23 12:14:38,029 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-23 12:14:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:38,031 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 12:14:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 12:14:38,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:38,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:38,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:38,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:14:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-23 12:14:38,033 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 114 [2018-11-23 12:14:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:38,033 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-23 12:14:38,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:14:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 12:14:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:14:38,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:38,035 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:38,035 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:38,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash 676955969, now seen corresponding path program 16 times [2018-11-23 12:14:38,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:38,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:38,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:38,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {8952#true} call ULTIMATE.init(); {8952#true} is VALID [2018-11-23 12:14:38,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {8952#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8952#true} is VALID [2018-11-23 12:14:38,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:14:38,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8952#true} {8952#true} #66#return; {8952#true} is VALID [2018-11-23 12:14:38,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {8952#true} call #t~ret12 := main(); {8952#true} is VALID [2018-11-23 12:14:38,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {8952#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8952#true} is VALID [2018-11-23 12:14:38,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 19: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 25: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 26: Hoare triple {8952#true} assume !(~i~1 < 10); {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L256 TraceCheckUtils]: 27: Hoare triple {8952#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {8952#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 38: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:14:38,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {8952#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {8952#true} {8952#true} #70#return; {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {8952#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L256 TraceCheckUtils]: 54: Hoare triple {8952#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L273 TraceCheckUtils]: 55: Hoare triple {8952#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L273 TraceCheckUtils]: 56: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L273 TraceCheckUtils]: 57: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L273 TraceCheckUtils]: 58: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,526 INFO L273 TraceCheckUtils]: 59: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 62: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 63: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 67: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,527 INFO L273 TraceCheckUtils]: 68: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 69: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 70: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 72: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 73: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 74: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 75: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 76: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:14:38,528 INFO L273 TraceCheckUtils]: 77: Hoare triple {8952#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:14:38,529 INFO L273 TraceCheckUtils]: 78: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:14:38,529 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8952#true} {8952#true} #72#return; {8952#true} is VALID [2018-11-23 12:14:38,529 INFO L273 TraceCheckUtils]: 80: Hoare triple {8952#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {8954#(= main_~i~2 0)} is VALID [2018-11-23 12:14:38,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {8954#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8954#(= main_~i~2 0)} is VALID [2018-11-23 12:14:38,530 INFO L273 TraceCheckUtils]: 82: Hoare triple {8954#(= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8955#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:38,530 INFO L273 TraceCheckUtils]: 83: Hoare triple {8955#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8955#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:38,531 INFO L273 TraceCheckUtils]: 84: Hoare triple {8955#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8956#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:38,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {8956#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8956#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:38,531 INFO L273 TraceCheckUtils]: 86: Hoare triple {8956#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8957#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:38,532 INFO L273 TraceCheckUtils]: 87: Hoare triple {8957#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8957#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:38,532 INFO L273 TraceCheckUtils]: 88: Hoare triple {8957#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8958#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:38,532 INFO L273 TraceCheckUtils]: 89: Hoare triple {8958#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8958#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:38,533 INFO L273 TraceCheckUtils]: 90: Hoare triple {8958#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8959#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:38,533 INFO L273 TraceCheckUtils]: 91: Hoare triple {8959#(<= main_~i~2 5)} assume !(~i~2 < 9); {8953#false} is VALID [2018-11-23 12:14:38,533 INFO L273 TraceCheckUtils]: 92: Hoare triple {8953#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8953#false} is VALID [2018-11-23 12:14:38,534 INFO L256 TraceCheckUtils]: 93: Hoare triple {8953#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:14:38,534 INFO L273 TraceCheckUtils]: 94: Hoare triple {8952#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8952#true} is VALID [2018-11-23 12:14:38,534 INFO L273 TraceCheckUtils]: 95: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,534 INFO L273 TraceCheckUtils]: 96: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,534 INFO L273 TraceCheckUtils]: 97: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,535 INFO L273 TraceCheckUtils]: 98: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,535 INFO L273 TraceCheckUtils]: 99: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,535 INFO L273 TraceCheckUtils]: 100: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,535 INFO L273 TraceCheckUtils]: 101: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,535 INFO L273 TraceCheckUtils]: 102: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,536 INFO L273 TraceCheckUtils]: 103: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,536 INFO L273 TraceCheckUtils]: 104: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,536 INFO L273 TraceCheckUtils]: 105: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,536 INFO L273 TraceCheckUtils]: 106: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,536 INFO L273 TraceCheckUtils]: 107: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,537 INFO L273 TraceCheckUtils]: 108: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,537 INFO L273 TraceCheckUtils]: 109: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,537 INFO L273 TraceCheckUtils]: 110: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,537 INFO L273 TraceCheckUtils]: 111: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,537 INFO L273 TraceCheckUtils]: 112: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,538 INFO L273 TraceCheckUtils]: 113: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,538 INFO L273 TraceCheckUtils]: 114: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,538 INFO L273 TraceCheckUtils]: 115: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:14:38,538 INFO L273 TraceCheckUtils]: 116: Hoare triple {8952#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:14:38,538 INFO L273 TraceCheckUtils]: 117: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:14:38,538 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {8952#true} {8953#false} #74#return; {8953#false} is VALID [2018-11-23 12:14:38,539 INFO L273 TraceCheckUtils]: 119: Hoare triple {8953#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8953#false} is VALID [2018-11-23 12:14:38,539 INFO L273 TraceCheckUtils]: 120: Hoare triple {8953#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8953#false} is VALID [2018-11-23 12:14:38,539 INFO L273 TraceCheckUtils]: 121: Hoare triple {8953#false} assume !false; {8953#false} is VALID [2018-11-23 12:14:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:14:38,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:38,545 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:38,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:14:38,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:14:38,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:38,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:38,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {8952#true} call ULTIMATE.init(); {8952#true} is VALID [2018-11-23 12:14:38,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {8952#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8952#true} is VALID [2018-11-23 12:14:38,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:14:38,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8952#true} {8952#true} #66#return; {8952#true} is VALID [2018-11-23 12:14:38,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {8952#true} call #t~ret12 := main(); {8952#true} is VALID [2018-11-23 12:14:38,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {8952#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8952#true} is VALID [2018-11-23 12:14:38,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {8952#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L273 TraceCheckUtils]: 25: Hoare triple {8952#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {8952#true} assume !(~i~1 < 10); {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L256 TraceCheckUtils]: 27: Hoare triple {8952#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:14:38,816 INFO L273 TraceCheckUtils]: 28: Hoare triple {8952#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 29: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 34: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 35: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 36: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,817 INFO L273 TraceCheckUtils]: 37: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 38: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 39: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 42: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 43: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 44: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 45: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,818 INFO L273 TraceCheckUtils]: 46: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L273 TraceCheckUtils]: 47: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L273 TraceCheckUtils]: 48: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L273 TraceCheckUtils]: 49: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L273 TraceCheckUtils]: 50: Hoare triple {8952#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L273 TraceCheckUtils]: 51: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {8952#true} {8952#true} #70#return; {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L273 TraceCheckUtils]: 53: Hoare triple {8952#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L256 TraceCheckUtils]: 54: Hoare triple {8952#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:14:38,819 INFO L273 TraceCheckUtils]: 55: Hoare triple {8952#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 56: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 57: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 58: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 59: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 60: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 61: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 62: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 63: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,820 INFO L273 TraceCheckUtils]: 64: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,821 INFO L273 TraceCheckUtils]: 65: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,821 INFO L273 TraceCheckUtils]: 66: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,821 INFO L273 TraceCheckUtils]: 67: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,821 INFO L273 TraceCheckUtils]: 68: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,821 INFO L273 TraceCheckUtils]: 69: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,821 INFO L273 TraceCheckUtils]: 70: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,822 INFO L273 TraceCheckUtils]: 71: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,822 INFO L273 TraceCheckUtils]: 72: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,822 INFO L273 TraceCheckUtils]: 73: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,822 INFO L273 TraceCheckUtils]: 74: Hoare triple {8952#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8952#true} is VALID [2018-11-23 12:14:38,822 INFO L273 TraceCheckUtils]: 75: Hoare triple {8952#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8952#true} is VALID [2018-11-23 12:14:38,822 INFO L273 TraceCheckUtils]: 76: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:14:38,823 INFO L273 TraceCheckUtils]: 77: Hoare triple {8952#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:14:38,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:14:38,823 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8952#true} {8952#true} #72#return; {8952#true} is VALID [2018-11-23 12:14:38,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {8952#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {9203#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:38,851 INFO L273 TraceCheckUtils]: 81: Hoare triple {9203#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9203#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:38,852 INFO L273 TraceCheckUtils]: 82: Hoare triple {9203#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8955#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:38,852 INFO L273 TraceCheckUtils]: 83: Hoare triple {8955#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8955#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:38,852 INFO L273 TraceCheckUtils]: 84: Hoare triple {8955#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8956#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:38,853 INFO L273 TraceCheckUtils]: 85: Hoare triple {8956#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8956#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:38,853 INFO L273 TraceCheckUtils]: 86: Hoare triple {8956#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8957#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:38,854 INFO L273 TraceCheckUtils]: 87: Hoare triple {8957#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8957#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:38,854 INFO L273 TraceCheckUtils]: 88: Hoare triple {8957#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8958#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:38,854 INFO L273 TraceCheckUtils]: 89: Hoare triple {8958#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {8958#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:38,855 INFO L273 TraceCheckUtils]: 90: Hoare triple {8958#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {8959#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:38,855 INFO L273 TraceCheckUtils]: 91: Hoare triple {8959#(<= main_~i~2 5)} assume !(~i~2 < 9); {8953#false} is VALID [2018-11-23 12:14:38,856 INFO L273 TraceCheckUtils]: 92: Hoare triple {8953#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8953#false} is VALID [2018-11-23 12:14:38,856 INFO L256 TraceCheckUtils]: 93: Hoare triple {8953#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {8953#false} is VALID [2018-11-23 12:14:38,856 INFO L273 TraceCheckUtils]: 94: Hoare triple {8953#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8953#false} is VALID [2018-11-23 12:14:38,856 INFO L273 TraceCheckUtils]: 95: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,856 INFO L273 TraceCheckUtils]: 96: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,857 INFO L273 TraceCheckUtils]: 97: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,857 INFO L273 TraceCheckUtils]: 98: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,857 INFO L273 TraceCheckUtils]: 99: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,857 INFO L273 TraceCheckUtils]: 100: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,857 INFO L273 TraceCheckUtils]: 101: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,858 INFO L273 TraceCheckUtils]: 102: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,858 INFO L273 TraceCheckUtils]: 103: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,858 INFO L273 TraceCheckUtils]: 104: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,858 INFO L273 TraceCheckUtils]: 105: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,858 INFO L273 TraceCheckUtils]: 106: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,859 INFO L273 TraceCheckUtils]: 107: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,859 INFO L273 TraceCheckUtils]: 108: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,859 INFO L273 TraceCheckUtils]: 109: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,859 INFO L273 TraceCheckUtils]: 110: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,859 INFO L273 TraceCheckUtils]: 111: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L273 TraceCheckUtils]: 112: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L273 TraceCheckUtils]: 113: Hoare triple {8953#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L273 TraceCheckUtils]: 114: Hoare triple {8953#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L273 TraceCheckUtils]: 115: Hoare triple {8953#false} assume !(~i~0 < 10); {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L273 TraceCheckUtils]: 116: Hoare triple {8953#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L273 TraceCheckUtils]: 117: Hoare triple {8953#false} assume true; {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {8953#false} {8953#false} #74#return; {8953#false} is VALID [2018-11-23 12:14:38,860 INFO L273 TraceCheckUtils]: 119: Hoare triple {8953#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {8953#false} is VALID [2018-11-23 12:14:38,861 INFO L273 TraceCheckUtils]: 120: Hoare triple {8953#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8953#false} is VALID [2018-11-23 12:14:38,861 INFO L273 TraceCheckUtils]: 121: Hoare triple {8953#false} assume !false; {8953#false} is VALID [2018-11-23 12:14:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 450 proven. 25 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-11-23 12:14:38,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:38,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:14:38,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-11-23 12:14:38,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:38,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:14:38,930 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-23 12:14:38,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:14:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:14:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:14:38,932 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2018-11-23 12:14:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:39,140 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 12:14:39,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:14:39,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-11-23 12:14:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:14:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2018-11-23 12:14:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:14:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2018-11-23 12:14:39,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2018-11-23 12:14:39,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:39,322 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:14:39,322 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:14:39,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:14:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:14:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 12:14:39,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:39,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 12:14:39,351 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 12:14:39,351 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 12:14:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:39,353 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 12:14:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 12:14:39,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:39,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:39,354 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 12:14:39,354 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 12:14:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:39,356 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 12:14:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 12:14:39,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:39,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:39,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:39,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:14:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:14:39,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 122 [2018-11-23 12:14:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:39,359 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:14:39,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:14:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:14:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:14:39,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:39,360 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:39,360 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:39,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:39,361 INFO L82 PathProgramCache]: Analyzing trace with hash 550390079, now seen corresponding path program 17 times [2018-11-23 12:14:39,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:39,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:39,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:39,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:39,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:40,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {9747#true} call ULTIMATE.init(); {9747#true} is VALID [2018-11-23 12:14:40,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {9747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9747#true} is VALID [2018-11-23 12:14:40,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:14:40,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9747#true} {9747#true} #66#return; {9747#true} is VALID [2018-11-23 12:14:40,038 INFO L256 TraceCheckUtils]: 4: Hoare triple {9747#true} call #t~ret12 := main(); {9747#true} is VALID [2018-11-23 12:14:40,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {9747#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9747#true} is VALID [2018-11-23 12:14:40,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,039 INFO L273 TraceCheckUtils]: 11: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 17: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 18: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 25: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {9747#true} assume !(~i~1 < 10); {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L256 TraceCheckUtils]: 27: Hoare triple {9747#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {9747#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 29: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 30: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 31: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 32: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,043 INFO L273 TraceCheckUtils]: 34: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,043 INFO L273 TraceCheckUtils]: 37: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,043 INFO L273 TraceCheckUtils]: 39: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 40: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 41: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 42: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 43: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 45: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 47: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,044 INFO L273 TraceCheckUtils]: 48: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L273 TraceCheckUtils]: 49: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L273 TraceCheckUtils]: 50: Hoare triple {9747#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L273 TraceCheckUtils]: 51: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {9747#true} {9747#true} #70#return; {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {9747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L256 TraceCheckUtils]: 54: Hoare triple {9747#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {9747#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 59: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 60: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 61: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 64: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 65: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,046 INFO L273 TraceCheckUtils]: 66: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,047 INFO L273 TraceCheckUtils]: 67: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,047 INFO L273 TraceCheckUtils]: 68: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,047 INFO L273 TraceCheckUtils]: 69: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,047 INFO L273 TraceCheckUtils]: 70: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,047 INFO L273 TraceCheckUtils]: 71: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,047 INFO L273 TraceCheckUtils]: 72: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,047 INFO L273 TraceCheckUtils]: 73: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,048 INFO L273 TraceCheckUtils]: 74: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,048 INFO L273 TraceCheckUtils]: 75: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,048 INFO L273 TraceCheckUtils]: 76: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:14:40,048 INFO L273 TraceCheckUtils]: 77: Hoare triple {9747#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:14:40,048 INFO L273 TraceCheckUtils]: 78: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:14:40,048 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {9747#true} {9747#true} #72#return; {9747#true} is VALID [2018-11-23 12:14:40,049 INFO L273 TraceCheckUtils]: 80: Hoare triple {9747#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {9749#(= main_~i~2 0)} is VALID [2018-11-23 12:14:40,050 INFO L273 TraceCheckUtils]: 81: Hoare triple {9749#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9749#(= main_~i~2 0)} is VALID [2018-11-23 12:14:40,050 INFO L273 TraceCheckUtils]: 82: Hoare triple {9749#(= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9750#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:40,051 INFO L273 TraceCheckUtils]: 83: Hoare triple {9750#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9750#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:40,051 INFO L273 TraceCheckUtils]: 84: Hoare triple {9750#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9751#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:40,051 INFO L273 TraceCheckUtils]: 85: Hoare triple {9751#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9751#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:40,052 INFO L273 TraceCheckUtils]: 86: Hoare triple {9751#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9752#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:40,052 INFO L273 TraceCheckUtils]: 87: Hoare triple {9752#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9752#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:40,053 INFO L273 TraceCheckUtils]: 88: Hoare triple {9752#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9753#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:40,053 INFO L273 TraceCheckUtils]: 89: Hoare triple {9753#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9753#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:40,056 INFO L273 TraceCheckUtils]: 90: Hoare triple {9753#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9754#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:40,057 INFO L273 TraceCheckUtils]: 91: Hoare triple {9754#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9754#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:40,057 INFO L273 TraceCheckUtils]: 92: Hoare triple {9754#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9755#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:40,058 INFO L273 TraceCheckUtils]: 93: Hoare triple {9755#(<= main_~i~2 6)} assume !(~i~2 < 9); {9748#false} is VALID [2018-11-23 12:14:40,058 INFO L273 TraceCheckUtils]: 94: Hoare triple {9748#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9748#false} is VALID [2018-11-23 12:14:40,058 INFO L256 TraceCheckUtils]: 95: Hoare triple {9748#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:14:40,058 INFO L273 TraceCheckUtils]: 96: Hoare triple {9747#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9747#true} is VALID [2018-11-23 12:14:40,058 INFO L273 TraceCheckUtils]: 97: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,058 INFO L273 TraceCheckUtils]: 98: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,058 INFO L273 TraceCheckUtils]: 99: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,058 INFO L273 TraceCheckUtils]: 100: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 101: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 102: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 103: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 104: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 105: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 106: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 107: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 108: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,059 INFO L273 TraceCheckUtils]: 109: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 110: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 111: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 112: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 113: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 114: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 115: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 116: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,060 INFO L273 TraceCheckUtils]: 117: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:14:40,061 INFO L273 TraceCheckUtils]: 118: Hoare triple {9747#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:14:40,061 INFO L273 TraceCheckUtils]: 119: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:14:40,061 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {9747#true} {9748#false} #74#return; {9748#false} is VALID [2018-11-23 12:14:40,061 INFO L273 TraceCheckUtils]: 121: Hoare triple {9748#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {9748#false} is VALID [2018-11-23 12:14:40,061 INFO L273 TraceCheckUtils]: 122: Hoare triple {9748#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9748#false} is VALID [2018-11-23 12:14:40,061 INFO L273 TraceCheckUtils]: 123: Hoare triple {9748#false} assume !false; {9748#false} is VALID [2018-11-23 12:14:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:14:40,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:40,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:40,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:14:40,710 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 12:14:40,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:40,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:40,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {9747#true} call ULTIMATE.init(); {9747#true} is VALID [2018-11-23 12:14:40,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {9747#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9747#true} is VALID [2018-11-23 12:14:40,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:14:40,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9747#true} {9747#true} #66#return; {9747#true} is VALID [2018-11-23 12:14:40,887 INFO L256 TraceCheckUtils]: 4: Hoare triple {9747#true} call #t~ret12 := main(); {9747#true} is VALID [2018-11-23 12:14:40,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {9747#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9747#true} is VALID [2018-11-23 12:14:40,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {9747#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {9747#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {9747#true} assume !(~i~1 < 10); {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L256 TraceCheckUtils]: 27: Hoare triple {9747#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 28: Hoare triple {9747#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9747#true} is VALID [2018-11-23 12:14:40,890 INFO L273 TraceCheckUtils]: 29: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 30: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 33: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 34: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 37: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 39: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 41: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 42: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,892 INFO L273 TraceCheckUtils]: 46: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L273 TraceCheckUtils]: 47: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L273 TraceCheckUtils]: 48: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L273 TraceCheckUtils]: 49: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L273 TraceCheckUtils]: 50: Hoare triple {9747#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L273 TraceCheckUtils]: 51: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {9747#true} {9747#true} #70#return; {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {9747#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L256 TraceCheckUtils]: 54: Hoare triple {9747#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:14:40,893 INFO L273 TraceCheckUtils]: 55: Hoare triple {9747#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 56: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 57: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 58: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 59: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 60: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 61: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 65: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 66: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 69: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 70: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 71: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,896 INFO L273 TraceCheckUtils]: 73: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,896 INFO L273 TraceCheckUtils]: 74: Hoare triple {9747#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9747#true} is VALID [2018-11-23 12:14:40,896 INFO L273 TraceCheckUtils]: 75: Hoare triple {9747#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9747#true} is VALID [2018-11-23 12:14:40,896 INFO L273 TraceCheckUtils]: 76: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:14:40,896 INFO L273 TraceCheckUtils]: 77: Hoare triple {9747#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:14:40,896 INFO L273 TraceCheckUtils]: 78: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:14:40,896 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {9747#true} {9747#true} #72#return; {9747#true} is VALID [2018-11-23 12:14:40,897 INFO L273 TraceCheckUtils]: 80: Hoare triple {9747#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {9999#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:40,897 INFO L273 TraceCheckUtils]: 81: Hoare triple {9999#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9999#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:40,898 INFO L273 TraceCheckUtils]: 82: Hoare triple {9999#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9750#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:40,898 INFO L273 TraceCheckUtils]: 83: Hoare triple {9750#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9750#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:40,898 INFO L273 TraceCheckUtils]: 84: Hoare triple {9750#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9751#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:40,899 INFO L273 TraceCheckUtils]: 85: Hoare triple {9751#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9751#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:40,899 INFO L273 TraceCheckUtils]: 86: Hoare triple {9751#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9752#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:40,899 INFO L273 TraceCheckUtils]: 87: Hoare triple {9752#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9752#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:40,900 INFO L273 TraceCheckUtils]: 88: Hoare triple {9752#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9753#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:40,900 INFO L273 TraceCheckUtils]: 89: Hoare triple {9753#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9753#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:40,901 INFO L273 TraceCheckUtils]: 90: Hoare triple {9753#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9754#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:40,902 INFO L273 TraceCheckUtils]: 91: Hoare triple {9754#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {9754#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:40,902 INFO L273 TraceCheckUtils]: 92: Hoare triple {9754#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {9755#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:40,903 INFO L273 TraceCheckUtils]: 93: Hoare triple {9755#(<= main_~i~2 6)} assume !(~i~2 < 9); {9748#false} is VALID [2018-11-23 12:14:40,903 INFO L273 TraceCheckUtils]: 94: Hoare triple {9748#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9748#false} is VALID [2018-11-23 12:14:40,903 INFO L256 TraceCheckUtils]: 95: Hoare triple {9748#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {9748#false} is VALID [2018-11-23 12:14:40,904 INFO L273 TraceCheckUtils]: 96: Hoare triple {9748#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9748#false} is VALID [2018-11-23 12:14:40,904 INFO L273 TraceCheckUtils]: 97: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,904 INFO L273 TraceCheckUtils]: 98: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,904 INFO L273 TraceCheckUtils]: 99: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,904 INFO L273 TraceCheckUtils]: 100: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,905 INFO L273 TraceCheckUtils]: 101: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,905 INFO L273 TraceCheckUtils]: 102: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,905 INFO L273 TraceCheckUtils]: 103: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,905 INFO L273 TraceCheckUtils]: 104: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,905 INFO L273 TraceCheckUtils]: 105: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,906 INFO L273 TraceCheckUtils]: 106: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,906 INFO L273 TraceCheckUtils]: 107: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,906 INFO L273 TraceCheckUtils]: 108: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,906 INFO L273 TraceCheckUtils]: 109: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,906 INFO L273 TraceCheckUtils]: 110: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 111: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 112: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 113: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 114: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 115: Hoare triple {9748#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 116: Hoare triple {9748#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 117: Hoare triple {9748#false} assume !(~i~0 < 10); {9748#false} is VALID [2018-11-23 12:14:40,907 INFO L273 TraceCheckUtils]: 118: Hoare triple {9748#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {9748#false} is VALID [2018-11-23 12:14:40,908 INFO L273 TraceCheckUtils]: 119: Hoare triple {9748#false} assume true; {9748#false} is VALID [2018-11-23 12:14:40,908 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {9748#false} {9748#false} #74#return; {9748#false} is VALID [2018-11-23 12:14:40,908 INFO L273 TraceCheckUtils]: 121: Hoare triple {9748#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {9748#false} is VALID [2018-11-23 12:14:40,908 INFO L273 TraceCheckUtils]: 122: Hoare triple {9748#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9748#false} is VALID [2018-11-23 12:14:40,908 INFO L273 TraceCheckUtils]: 123: Hoare triple {9748#false} assume !false; {9748#false} is VALID [2018-11-23 12:14:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 450 proven. 36 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-11-23 12:14:40,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:40,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:14:40,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-11-23 12:14:40,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:40,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:14:40,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:40,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:14:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:14:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:40,988 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-11-23 12:14:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:41,404 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-23 12:14:41,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:14:41,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-11-23 12:14:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-11-23 12:14:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:14:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-11-23 12:14:41,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2018-11-23 12:14:41,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:41,473 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:14:41,473 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:14:41,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:14:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:14:41,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:14:41,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:41,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:14:41,500 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:14:41,500 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:14:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:41,501 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:14:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:14:41,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:41,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:41,502 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:14:41,502 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:14:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:41,503 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:14:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:14:41,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:41,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:41,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:41,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:14:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:14:41,506 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 124 [2018-11-23 12:14:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:41,506 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:14:41,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:14:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:14:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:14:41,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:41,508 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:41,508 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:41,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash -820345923, now seen corresponding path program 18 times [2018-11-23 12:14:41,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:41,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:41,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:41,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {10559#true} call ULTIMATE.init(); {10559#true} is VALID [2018-11-23 12:14:41,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {10559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10559#true} is VALID [2018-11-23 12:14:41,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:14:41,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10559#true} {10559#true} #66#return; {10559#true} is VALID [2018-11-23 12:14:41,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {10559#true} call #t~ret12 := main(); {10559#true} is VALID [2018-11-23 12:14:41,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {10559#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10559#true} is VALID [2018-11-23 12:14:41,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {10559#true} assume !(~i~1 < 10); {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L256 TraceCheckUtils]: 27: Hoare triple {10559#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {10559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,747 INFO L273 TraceCheckUtils]: 33: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 34: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 35: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,748 INFO L273 TraceCheckUtils]: 42: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 43: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 44: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 48: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 49: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 50: Hoare triple {10559#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:14:41,749 INFO L273 TraceCheckUtils]: 51: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {10559#true} {10559#true} #70#return; {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L273 TraceCheckUtils]: 53: Hoare triple {10559#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L256 TraceCheckUtils]: 54: Hoare triple {10559#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L273 TraceCheckUtils]: 55: Hoare triple {10559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L273 TraceCheckUtils]: 56: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L273 TraceCheckUtils]: 57: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L273 TraceCheckUtils]: 58: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L273 TraceCheckUtils]: 59: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,750 INFO L273 TraceCheckUtils]: 60: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 61: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 62: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 63: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 64: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 65: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 66: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 70: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 71: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 72: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 73: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 74: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 75: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 76: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:14:41,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {10559#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:14:41,753 INFO L273 TraceCheckUtils]: 78: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:14:41,753 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10559#true} {10559#true} #72#return; {10559#true} is VALID [2018-11-23 12:14:41,753 INFO L273 TraceCheckUtils]: 80: Hoare triple {10559#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {10561#(= main_~i~2 0)} is VALID [2018-11-23 12:14:41,773 INFO L273 TraceCheckUtils]: 81: Hoare triple {10561#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10561#(= main_~i~2 0)} is VALID [2018-11-23 12:14:41,787 INFO L273 TraceCheckUtils]: 82: Hoare triple {10561#(= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10562#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:41,796 INFO L273 TraceCheckUtils]: 83: Hoare triple {10562#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10562#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:41,797 INFO L273 TraceCheckUtils]: 84: Hoare triple {10562#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10563#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:41,798 INFO L273 TraceCheckUtils]: 85: Hoare triple {10563#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10563#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:41,798 INFO L273 TraceCheckUtils]: 86: Hoare triple {10563#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10564#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:41,798 INFO L273 TraceCheckUtils]: 87: Hoare triple {10564#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10564#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:41,799 INFO L273 TraceCheckUtils]: 88: Hoare triple {10564#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10565#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:41,799 INFO L273 TraceCheckUtils]: 89: Hoare triple {10565#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10565#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:41,800 INFO L273 TraceCheckUtils]: 90: Hoare triple {10565#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10566#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:41,800 INFO L273 TraceCheckUtils]: 91: Hoare triple {10566#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10566#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:41,800 INFO L273 TraceCheckUtils]: 92: Hoare triple {10566#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10567#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:41,801 INFO L273 TraceCheckUtils]: 93: Hoare triple {10567#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10567#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:41,801 INFO L273 TraceCheckUtils]: 94: Hoare triple {10567#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10568#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:41,802 INFO L273 TraceCheckUtils]: 95: Hoare triple {10568#(<= main_~i~2 7)} assume !(~i~2 < 9); {10560#false} is VALID [2018-11-23 12:14:41,802 INFO L273 TraceCheckUtils]: 96: Hoare triple {10560#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {10560#false} is VALID [2018-11-23 12:14:41,802 INFO L256 TraceCheckUtils]: 97: Hoare triple {10560#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:14:41,802 INFO L273 TraceCheckUtils]: 98: Hoare triple {10559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10559#true} is VALID [2018-11-23 12:14:41,802 INFO L273 TraceCheckUtils]: 99: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,802 INFO L273 TraceCheckUtils]: 100: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,802 INFO L273 TraceCheckUtils]: 101: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,802 INFO L273 TraceCheckUtils]: 102: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,803 INFO L273 TraceCheckUtils]: 103: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,803 INFO L273 TraceCheckUtils]: 104: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,803 INFO L273 TraceCheckUtils]: 105: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,803 INFO L273 TraceCheckUtils]: 106: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,803 INFO L273 TraceCheckUtils]: 107: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,804 INFO L273 TraceCheckUtils]: 108: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,804 INFO L273 TraceCheckUtils]: 109: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,804 INFO L273 TraceCheckUtils]: 110: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,804 INFO L273 TraceCheckUtils]: 111: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,804 INFO L273 TraceCheckUtils]: 112: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,804 INFO L273 TraceCheckUtils]: 113: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,805 INFO L273 TraceCheckUtils]: 114: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,805 INFO L273 TraceCheckUtils]: 115: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,805 INFO L273 TraceCheckUtils]: 116: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,805 INFO L273 TraceCheckUtils]: 117: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:41,805 INFO L273 TraceCheckUtils]: 118: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:41,806 INFO L273 TraceCheckUtils]: 119: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:14:41,806 INFO L273 TraceCheckUtils]: 120: Hoare triple {10559#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:14:41,806 INFO L273 TraceCheckUtils]: 121: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:14:41,806 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {10559#true} {10560#false} #74#return; {10560#false} is VALID [2018-11-23 12:14:41,806 INFO L273 TraceCheckUtils]: 123: Hoare triple {10560#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {10560#false} is VALID [2018-11-23 12:14:41,807 INFO L273 TraceCheckUtils]: 124: Hoare triple {10560#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10560#false} is VALID [2018-11-23 12:14:41,807 INFO L273 TraceCheckUtils]: 125: Hoare triple {10560#false} assume !false; {10560#false} is VALID [2018-11-23 12:14:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:14:41,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:41,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:41,822 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:14:42,064 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 12:14:42,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:14:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:42,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:42,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {10559#true} call ULTIMATE.init(); {10559#true} is VALID [2018-11-23 12:14:42,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {10559#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10559#true} is VALID [2018-11-23 12:14:42,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:14:42,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10559#true} {10559#true} #66#return; {10559#true} is VALID [2018-11-23 12:14:42,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {10559#true} call #t~ret12 := main(); {10559#true} is VALID [2018-11-23 12:14:42,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {10559#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10559#true} is VALID [2018-11-23 12:14:42,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 15: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {10559#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {10559#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {10559#true} assume !(~i~1 < 10); {10559#true} is VALID [2018-11-23 12:14:42,231 INFO L256 TraceCheckUtils]: 27: Hoare triple {10559#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {10559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 30: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 35: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 38: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 39: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 40: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 44: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 45: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L273 TraceCheckUtils]: 48: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {10559#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L273 TraceCheckUtils]: 51: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {10559#true} {10559#true} #70#return; {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L273 TraceCheckUtils]: 53: Hoare triple {10559#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10559#true} is VALID [2018-11-23 12:14:42,234 INFO L256 TraceCheckUtils]: 54: Hoare triple {10559#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 55: Hoare triple {10559#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 56: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 57: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 58: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 59: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 60: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,235 INFO L273 TraceCheckUtils]: 63: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 64: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 65: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 66: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 67: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 68: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 69: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 71: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,236 INFO L273 TraceCheckUtils]: 72: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,237 INFO L273 TraceCheckUtils]: 73: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,237 INFO L273 TraceCheckUtils]: 74: Hoare triple {10559#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10559#true} is VALID [2018-11-23 12:14:42,237 INFO L273 TraceCheckUtils]: 75: Hoare triple {10559#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10559#true} is VALID [2018-11-23 12:14:42,237 INFO L273 TraceCheckUtils]: 76: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:14:42,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {10559#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:14:42,237 INFO L273 TraceCheckUtils]: 78: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:14:42,237 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10559#true} {10559#true} #72#return; {10559#true} is VALID [2018-11-23 12:14:42,238 INFO L273 TraceCheckUtils]: 80: Hoare triple {10559#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {10812#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:42,238 INFO L273 TraceCheckUtils]: 81: Hoare triple {10812#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10812#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:42,238 INFO L273 TraceCheckUtils]: 82: Hoare triple {10812#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10562#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:42,239 INFO L273 TraceCheckUtils]: 83: Hoare triple {10562#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10562#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:42,239 INFO L273 TraceCheckUtils]: 84: Hoare triple {10562#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10563#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:42,240 INFO L273 TraceCheckUtils]: 85: Hoare triple {10563#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10563#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:42,240 INFO L273 TraceCheckUtils]: 86: Hoare triple {10563#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10564#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:42,240 INFO L273 TraceCheckUtils]: 87: Hoare triple {10564#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10564#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:42,241 INFO L273 TraceCheckUtils]: 88: Hoare triple {10564#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10565#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:42,242 INFO L273 TraceCheckUtils]: 89: Hoare triple {10565#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10565#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:42,242 INFO L273 TraceCheckUtils]: 90: Hoare triple {10565#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10566#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:42,243 INFO L273 TraceCheckUtils]: 91: Hoare triple {10566#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10566#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:42,244 INFO L273 TraceCheckUtils]: 92: Hoare triple {10566#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10567#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:42,244 INFO L273 TraceCheckUtils]: 93: Hoare triple {10567#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {10567#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:42,245 INFO L273 TraceCheckUtils]: 94: Hoare triple {10567#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {10568#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:42,245 INFO L273 TraceCheckUtils]: 95: Hoare triple {10568#(<= main_~i~2 7)} assume !(~i~2 < 9); {10560#false} is VALID [2018-11-23 12:14:42,246 INFO L273 TraceCheckUtils]: 96: Hoare triple {10560#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {10560#false} is VALID [2018-11-23 12:14:42,246 INFO L256 TraceCheckUtils]: 97: Hoare triple {10560#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {10560#false} is VALID [2018-11-23 12:14:42,246 INFO L273 TraceCheckUtils]: 98: Hoare triple {10560#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10560#false} is VALID [2018-11-23 12:14:42,246 INFO L273 TraceCheckUtils]: 99: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,247 INFO L273 TraceCheckUtils]: 100: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,247 INFO L273 TraceCheckUtils]: 101: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,247 INFO L273 TraceCheckUtils]: 102: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,247 INFO L273 TraceCheckUtils]: 103: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,247 INFO L273 TraceCheckUtils]: 104: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,247 INFO L273 TraceCheckUtils]: 105: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,248 INFO L273 TraceCheckUtils]: 106: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,248 INFO L273 TraceCheckUtils]: 107: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,248 INFO L273 TraceCheckUtils]: 108: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,248 INFO L273 TraceCheckUtils]: 109: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,248 INFO L273 TraceCheckUtils]: 110: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,249 INFO L273 TraceCheckUtils]: 111: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,249 INFO L273 TraceCheckUtils]: 112: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,249 INFO L273 TraceCheckUtils]: 113: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,249 INFO L273 TraceCheckUtils]: 114: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,249 INFO L273 TraceCheckUtils]: 115: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,250 INFO L273 TraceCheckUtils]: 116: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,250 INFO L273 TraceCheckUtils]: 117: Hoare triple {10560#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {10560#false} is VALID [2018-11-23 12:14:42,250 INFO L273 TraceCheckUtils]: 118: Hoare triple {10560#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10560#false} is VALID [2018-11-23 12:14:42,250 INFO L273 TraceCheckUtils]: 119: Hoare triple {10560#false} assume !(~i~0 < 10); {10560#false} is VALID [2018-11-23 12:14:42,250 INFO L273 TraceCheckUtils]: 120: Hoare triple {10560#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {10560#false} is VALID [2018-11-23 12:14:42,250 INFO L273 TraceCheckUtils]: 121: Hoare triple {10560#false} assume true; {10560#false} is VALID [2018-11-23 12:14:42,251 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {10560#false} {10560#false} #74#return; {10560#false} is VALID [2018-11-23 12:14:42,251 INFO L273 TraceCheckUtils]: 123: Hoare triple {10560#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {10560#false} is VALID [2018-11-23 12:14:42,251 INFO L273 TraceCheckUtils]: 124: Hoare triple {10560#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10560#false} is VALID [2018-11-23 12:14:42,251 INFO L273 TraceCheckUtils]: 125: Hoare triple {10560#false} assume !false; {10560#false} is VALID [2018-11-23 12:14:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 450 proven. 49 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-11-23 12:14:42,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:42,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:14:42,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-11-23 12:14:42,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:42,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:14:42,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:42,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:14:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:14:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:42,326 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2018-11-23 12:14:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:42,596 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-23 12:14:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:14:42,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-11-23 12:14:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2018-11-23 12:14:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:14:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2018-11-23 12:14:42,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2018-11-23 12:14:42,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:42,658 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:14:42,658 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:14:42,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:14:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:14:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-23 12:14:42,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:42,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 79 states. [2018-11-23 12:14:42,683 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 79 states. [2018-11-23 12:14:42,683 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 79 states. [2018-11-23 12:14:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:42,685 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:14:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:14:42,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:42,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:42,686 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 80 states. [2018-11-23 12:14:42,686 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 80 states. [2018-11-23 12:14:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:42,687 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:14:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:14:42,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:42,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:42,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:42,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:14:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-11-23 12:14:42,690 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 126 [2018-11-23 12:14:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:42,690 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-23 12:14:42,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:14:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-11-23 12:14:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 12:14:42,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:42,691 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:42,692 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:42,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:42,692 INFO L82 PathProgramCache]: Analyzing trace with hash 457316027, now seen corresponding path program 19 times [2018-11-23 12:14:42,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:42,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:42,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:42,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:14:42,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:42,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {11388#true} call ULTIMATE.init(); {11388#true} is VALID [2018-11-23 12:14:42,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {11388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11388#true} is VALID [2018-11-23 12:14:42,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:14:42,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11388#true} {11388#true} #66#return; {11388#true} is VALID [2018-11-23 12:14:42,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {11388#true} call #t~ret12 := main(); {11388#true} is VALID [2018-11-23 12:14:42,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {11388#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11388#true} is VALID [2018-11-23 12:14:42,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 14: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L273 TraceCheckUtils]: 26: Hoare triple {11388#true} assume !(~i~1 < 10); {11388#true} is VALID [2018-11-23 12:14:42,900 INFO L256 TraceCheckUtils]: 27: Hoare triple {11388#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 28: Hoare triple {11388#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 29: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 31: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 32: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 33: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 37: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 38: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 41: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 43: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 44: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,902 INFO L273 TraceCheckUtils]: 45: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L273 TraceCheckUtils]: 46: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L273 TraceCheckUtils]: 47: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L273 TraceCheckUtils]: 48: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L273 TraceCheckUtils]: 49: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L273 TraceCheckUtils]: 50: Hoare triple {11388#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L273 TraceCheckUtils]: 51: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {11388#true} {11388#true} #70#return; {11388#true} is VALID [2018-11-23 12:14:42,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {11388#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L256 TraceCheckUtils]: 54: Hoare triple {11388#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 55: Hoare triple {11388#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 56: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 57: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 58: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 59: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 60: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 61: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,904 INFO L273 TraceCheckUtils]: 62: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 63: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 64: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 65: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 66: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 67: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 68: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 69: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 70: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,905 INFO L273 TraceCheckUtils]: 71: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L273 TraceCheckUtils]: 72: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L273 TraceCheckUtils]: 73: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L273 TraceCheckUtils]: 74: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L273 TraceCheckUtils]: 75: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L273 TraceCheckUtils]: 76: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L273 TraceCheckUtils]: 77: Hoare triple {11388#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L273 TraceCheckUtils]: 78: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:14:42,906 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {11388#true} {11388#true} #72#return; {11388#true} is VALID [2018-11-23 12:14:42,907 INFO L273 TraceCheckUtils]: 80: Hoare triple {11388#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {11390#(= main_~i~2 0)} is VALID [2018-11-23 12:14:42,907 INFO L273 TraceCheckUtils]: 81: Hoare triple {11390#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11390#(= main_~i~2 0)} is VALID [2018-11-23 12:14:42,907 INFO L273 TraceCheckUtils]: 82: Hoare triple {11390#(= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11391#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:42,908 INFO L273 TraceCheckUtils]: 83: Hoare triple {11391#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11391#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:42,908 INFO L273 TraceCheckUtils]: 84: Hoare triple {11391#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11392#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:42,908 INFO L273 TraceCheckUtils]: 85: Hoare triple {11392#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11392#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:42,909 INFO L273 TraceCheckUtils]: 86: Hoare triple {11392#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11393#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:42,909 INFO L273 TraceCheckUtils]: 87: Hoare triple {11393#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11393#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:42,910 INFO L273 TraceCheckUtils]: 88: Hoare triple {11393#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11394#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:42,910 INFO L273 TraceCheckUtils]: 89: Hoare triple {11394#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11394#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:42,910 INFO L273 TraceCheckUtils]: 90: Hoare triple {11394#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11395#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:42,911 INFO L273 TraceCheckUtils]: 91: Hoare triple {11395#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11395#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:42,912 INFO L273 TraceCheckUtils]: 92: Hoare triple {11395#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11396#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:42,912 INFO L273 TraceCheckUtils]: 93: Hoare triple {11396#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11396#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:42,913 INFO L273 TraceCheckUtils]: 94: Hoare triple {11396#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11397#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:42,913 INFO L273 TraceCheckUtils]: 95: Hoare triple {11397#(<= main_~i~2 7)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11397#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:42,914 INFO L273 TraceCheckUtils]: 96: Hoare triple {11397#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11398#(<= main_~i~2 8)} is VALID [2018-11-23 12:14:42,915 INFO L273 TraceCheckUtils]: 97: Hoare triple {11398#(<= main_~i~2 8)} assume !(~i~2 < 9); {11389#false} is VALID [2018-11-23 12:14:42,915 INFO L273 TraceCheckUtils]: 98: Hoare triple {11389#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {11389#false} is VALID [2018-11-23 12:14:42,915 INFO L256 TraceCheckUtils]: 99: Hoare triple {11389#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:14:42,915 INFO L273 TraceCheckUtils]: 100: Hoare triple {11388#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11388#true} is VALID [2018-11-23 12:14:42,916 INFO L273 TraceCheckUtils]: 101: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,916 INFO L273 TraceCheckUtils]: 102: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,916 INFO L273 TraceCheckUtils]: 103: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,916 INFO L273 TraceCheckUtils]: 104: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,916 INFO L273 TraceCheckUtils]: 105: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,917 INFO L273 TraceCheckUtils]: 106: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,917 INFO L273 TraceCheckUtils]: 107: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,917 INFO L273 TraceCheckUtils]: 108: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,917 INFO L273 TraceCheckUtils]: 109: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,917 INFO L273 TraceCheckUtils]: 110: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,917 INFO L273 TraceCheckUtils]: 111: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 112: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 113: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 114: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 115: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 116: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 117: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 118: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 119: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:42,918 INFO L273 TraceCheckUtils]: 120: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:42,919 INFO L273 TraceCheckUtils]: 121: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:14:42,919 INFO L273 TraceCheckUtils]: 122: Hoare triple {11388#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:14:42,919 INFO L273 TraceCheckUtils]: 123: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:14:42,919 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {11388#true} {11389#false} #74#return; {11389#false} is VALID [2018-11-23 12:14:42,919 INFO L273 TraceCheckUtils]: 125: Hoare triple {11389#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11389#false} is VALID [2018-11-23 12:14:42,919 INFO L273 TraceCheckUtils]: 126: Hoare triple {11389#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11389#false} is VALID [2018-11-23 12:14:42,919 INFO L273 TraceCheckUtils]: 127: Hoare triple {11389#false} assume !false; {11389#false} is VALID [2018-11-23 12:14:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:14:42,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:14:42,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:14:42,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:43,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:14:43,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {11388#true} call ULTIMATE.init(); {11388#true} is VALID [2018-11-23 12:14:43,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {11388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11388#true} is VALID [2018-11-23 12:14:43,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:14:43,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11388#true} {11388#true} #66#return; {11388#true} is VALID [2018-11-23 12:14:43,202 INFO L256 TraceCheckUtils]: 4: Hoare triple {11388#true} call #t~ret12 := main(); {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {11388#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,204 INFO L273 TraceCheckUtils]: 22: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 24: Hoare triple {11388#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet3; {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {11388#true} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {11388#true} assume !(~i~1 < 10); {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L256 TraceCheckUtils]: 27: Hoare triple {11388#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {11388#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 29: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 30: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,205 INFO L273 TraceCheckUtils]: 31: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 32: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 33: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 34: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 43: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 45: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 47: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 48: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,207 INFO L273 TraceCheckUtils]: 49: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L273 TraceCheckUtils]: 50: Hoare triple {11388#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L273 TraceCheckUtils]: 51: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {11388#true} {11388#true} #70#return; {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {11388#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem6, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem6;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L256 TraceCheckUtils]: 54: Hoare triple {11388#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L273 TraceCheckUtils]: 55: Hoare triple {11388#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L273 TraceCheckUtils]: 56: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L273 TraceCheckUtils]: 57: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,208 INFO L273 TraceCheckUtils]: 58: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 59: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 60: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 61: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 62: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 63: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 64: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 65: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 66: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,209 INFO L273 TraceCheckUtils]: 67: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 68: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 69: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 70: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 71: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 72: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 73: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 74: Hoare triple {11388#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11388#true} is VALID [2018-11-23 12:14:43,210 INFO L273 TraceCheckUtils]: 75: Hoare triple {11388#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11388#true} is VALID [2018-11-23 12:14:43,211 INFO L273 TraceCheckUtils]: 76: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:14:43,211 INFO L273 TraceCheckUtils]: 77: Hoare triple {11388#true} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:14:43,211 INFO L273 TraceCheckUtils]: 78: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:14:43,211 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {11388#true} {11388#true} #72#return; {11388#true} is VALID [2018-11-23 12:14:43,214 INFO L273 TraceCheckUtils]: 80: Hoare triple {11388#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0; {11642#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:43,214 INFO L273 TraceCheckUtils]: 81: Hoare triple {11642#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11642#(<= main_~i~2 0)} is VALID [2018-11-23 12:14:43,215 INFO L273 TraceCheckUtils]: 82: Hoare triple {11642#(<= main_~i~2 0)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11391#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:43,215 INFO L273 TraceCheckUtils]: 83: Hoare triple {11391#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11391#(<= main_~i~2 1)} is VALID [2018-11-23 12:14:43,216 INFO L273 TraceCheckUtils]: 84: Hoare triple {11391#(<= main_~i~2 1)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11392#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:43,216 INFO L273 TraceCheckUtils]: 85: Hoare triple {11392#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11392#(<= main_~i~2 2)} is VALID [2018-11-23 12:14:43,216 INFO L273 TraceCheckUtils]: 86: Hoare triple {11392#(<= main_~i~2 2)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11393#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:43,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {11393#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11393#(<= main_~i~2 3)} is VALID [2018-11-23 12:14:43,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {11393#(<= main_~i~2 3)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11394#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:43,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {11394#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11394#(<= main_~i~2 4)} is VALID [2018-11-23 12:14:43,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {11394#(<= main_~i~2 4)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11395#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:43,219 INFO L273 TraceCheckUtils]: 91: Hoare triple {11395#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11395#(<= main_~i~2 5)} is VALID [2018-11-23 12:14:43,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {11395#(<= main_~i~2 5)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11396#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:43,220 INFO L273 TraceCheckUtils]: 93: Hoare triple {11396#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11396#(<= main_~i~2 6)} is VALID [2018-11-23 12:14:43,221 INFO L273 TraceCheckUtils]: 94: Hoare triple {11396#(<= main_~i~2 6)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11397#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:43,221 INFO L273 TraceCheckUtils]: 95: Hoare triple {11397#(<= main_~i~2 7)} assume !!(~i~2 < 9);call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem10, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem10; {11397#(<= main_~i~2 7)} is VALID [2018-11-23 12:14:43,222 INFO L273 TraceCheckUtils]: 96: Hoare triple {11397#(<= main_~i~2 7)} #t~post9 := ~i~2;~i~2 := 1 + #t~post9;havoc #t~post9; {11398#(<= main_~i~2 8)} is VALID [2018-11-23 12:14:43,223 INFO L273 TraceCheckUtils]: 97: Hoare triple {11398#(<= main_~i~2 8)} assume !(~i~2 < 9); {11389#false} is VALID [2018-11-23 12:14:43,223 INFO L273 TraceCheckUtils]: 98: Hoare triple {11389#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {11389#false} is VALID [2018-11-23 12:14:43,223 INFO L256 TraceCheckUtils]: 99: Hoare triple {11389#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {11389#false} is VALID [2018-11-23 12:14:43,223 INFO L273 TraceCheckUtils]: 100: Hoare triple {11389#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11389#false} is VALID [2018-11-23 12:14:43,224 INFO L273 TraceCheckUtils]: 101: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,224 INFO L273 TraceCheckUtils]: 102: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,224 INFO L273 TraceCheckUtils]: 103: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,224 INFO L273 TraceCheckUtils]: 104: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,224 INFO L273 TraceCheckUtils]: 105: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,224 INFO L273 TraceCheckUtils]: 106: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,225 INFO L273 TraceCheckUtils]: 107: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,225 INFO L273 TraceCheckUtils]: 108: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,225 INFO L273 TraceCheckUtils]: 109: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,225 INFO L273 TraceCheckUtils]: 110: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,225 INFO L273 TraceCheckUtils]: 111: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,225 INFO L273 TraceCheckUtils]: 112: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 113: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 114: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 115: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 116: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 117: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 118: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 119: Hoare triple {11389#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~ret~0 := ~ret~0 + #t~mem1;havoc #t~mem1; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 120: Hoare triple {11389#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11389#false} is VALID [2018-11-23 12:14:43,226 INFO L273 TraceCheckUtils]: 121: Hoare triple {11389#false} assume !(~i~0 < 10); {11389#false} is VALID [2018-11-23 12:14:43,227 INFO L273 TraceCheckUtils]: 122: Hoare triple {11389#false} #res := (if (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 <= 2147483647 then (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 else (if ~ret~0 < 0 && 0 != ~ret~0 % 10 then 1 + ~ret~0 / 10 else ~ret~0 / 10) % 4294967296 - 4294967296); {11389#false} is VALID [2018-11-23 12:14:43,227 INFO L273 TraceCheckUtils]: 123: Hoare triple {11389#false} assume true; {11389#false} is VALID [2018-11-23 12:14:43,227 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {11389#false} {11389#false} #74#return; {11389#false} is VALID [2018-11-23 12:14:43,227 INFO L273 TraceCheckUtils]: 125: Hoare triple {11389#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647;~ret5~0 := #t~ret11;havoc #t~ret11; {11389#false} is VALID [2018-11-23 12:14:43,227 INFO L273 TraceCheckUtils]: 126: Hoare triple {11389#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11389#false} is VALID [2018-11-23 12:14:43,227 INFO L273 TraceCheckUtils]: 127: Hoare triple {11389#false} assume !false; {11389#false} is VALID [2018-11-23 12:14:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2018-11-23 12:14:43,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:14:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:14:43,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2018-11-23 12:14:43,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:14:43,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:14:43,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:43,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:14:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:14:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:43,311 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2018-11-23 12:14:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:43,552 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-23 12:14:43,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:14:43,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2018-11-23 12:14:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:14:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 12:14:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:14:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 12:14:43,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2018-11-23 12:14:43,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:14:43,613 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:14:43,614 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:14:43,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:14:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:14:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 12:14:43,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:14:43,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-23 12:14:43,642 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:14:43,642 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:14:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:43,644 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 12:14:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:14:43,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:43,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:43,645 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:14:43,645 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:14:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:14:43,647 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 12:14:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:14:43,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:14:43,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:14:43,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:14:43,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:14:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:14:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:14:43,649 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 128 [2018-11-23 12:14:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:14:43,649 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:14:43,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:14:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:14:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:14:43,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:14:43,651 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:14:43,651 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:14:43,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:14:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash -70196679, now seen corresponding path program 20 times [2018-11-23 12:14:43,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:14:43,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:14:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:43,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:14:43,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:14:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:14:53,146 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 3 [2018-11-23 12:14:53,922 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 26 [2018-11-23 12:14:54,222 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 34 [2018-11-23 12:14:54,522 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 36 [2018-11-23 12:14:55,008 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 41 [2018-11-23 12:14:55,662 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 45 [2018-11-23 12:14:56,217 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 51 [2018-11-23 12:14:56,787 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 52 [2018-11-23 12:14:57,449 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 58 [2018-11-23 12:14:58,261 WARN L180 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 251 DAG size of output: 60 [2018-11-23 12:14:59,272 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 65 [2018-11-23 12:15:00,203 WARN L180 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 294 DAG size of output: 67 [2018-11-23 12:15:01,416 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 71 [2018-11-23 12:15:02,715 WARN L180 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 73 [2018-11-23 12:15:04,001 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 77 [2018-11-23 12:15:04,963 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 80 [2018-11-23 12:15:06,805 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 337 DAG size of output: 82 [2018-11-23 12:15:07,970 WARN L180 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 82 [2018-11-23 12:15:08,659 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 74 [2018-11-23 12:15:09,211 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:15:09,217 INFO L168 Benchmark]: Toolchain (without parser) took 59441.29 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -97.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-23 12:15:09,218 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:15:09,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.95 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-23 12:15:09,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:15:09,219 INFO L168 Benchmark]: Boogie Preprocessor took 33.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:15:09,219 INFO L168 Benchmark]: RCFGBuilder took 816.68 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 659.0 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -689.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:15:09,220 INFO L168 Benchmark]: TraceAbstraction took 58168.90 ms. Allocated memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: 714.6 MB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 581.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-23 12:15:09,222 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 388.95 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 Procedure Inliner took 26.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 816.68 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 659.0 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -689.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58168.90 ms. Allocated memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: 714.6 MB). Free memory was 2.0 GB in the beginning and 1.5 GB in the end (delta: 581.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...