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/sum10_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:16:56,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:56,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:56,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:56,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:56,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:56,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:56,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:56,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:56,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:56,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:56,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:56,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:56,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:56,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:56,131 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:56,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:56,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:56,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:56,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:56,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:56,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:56,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:56,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:56,143 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:56,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:56,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:56,146 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:56,146 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:56,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:56,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:56,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:56,149 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:56,149 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:56,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:56,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:56,151 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:16:56,181 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:56,181 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:56,182 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:56,183 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:56,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:16:56,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:16:56,184 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:16:56,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:56,186 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:56,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:16:56,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:56,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:56,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:56,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:56,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:56,187 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:56,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:56,188 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:56,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:56,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:56,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:56,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:56,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:56,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:56,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:56,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:56,191 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:56,191 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:16:56,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:56,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:16:56,192 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:16:56,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:56,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:56,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:56,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:56,274 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:56,275 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-11-23 12:16:56,341 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7f5d843/94d67998d7064a0da2d1110f7adb773d/FLAGbaa93083e [2018-11-23 12:16:56,792 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:56,793 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-11-23 12:16:56,799 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7f5d843/94d67998d7064a0da2d1110f7adb773d/FLAGbaa93083e [2018-11-23 12:16:57,166 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7f5d843/94d67998d7064a0da2d1110f7adb773d [2018-11-23 12:16:57,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:57,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:57,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:57,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:57,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:57,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7803aff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57, skipping insertion in model container [2018-11-23 12:16:57,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:57,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:57,505 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:57,519 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:57,558 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:57,576 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:57,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57 WrapperNode [2018-11-23 12:16:57,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:57,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:57,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:57,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:57,585 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:16:57" (1/1) ... [2018-11-23 12:16:57,594 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:16:57" (1/1) ... [2018-11-23 12:16:57,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:57,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:57,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:57,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:57,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (1/1) ... [2018-11-23 12:16:57,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:57,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:57,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:57,646 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:57,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (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:16:57,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:16:57,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:16:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:57,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:16:57,788 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 12:16:57,788 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 12:16:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:57,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:57,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:16:58,449 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:58,450 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:16:58,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:58 BoogieIcfgContainer [2018-11-23 12:16:58,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:58,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:58,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:58,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:58,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:57" (1/3) ... [2018-11-23 12:16:58,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edb395e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:58, skipping insertion in model container [2018-11-23 12:16:58,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:57" (2/3) ... [2018-11-23 12:16:58,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edb395e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:58, skipping insertion in model container [2018-11-23 12:16:58,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:58" (3/3) ... [2018-11-23 12:16:58,460 INFO L112 eAbstractionObserver]: Analyzing ICFG sum10_true-unreach-call_true-termination.i [2018-11-23 12:16:58,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:58,480 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:58,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:58,535 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:16:58,536 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:58,536 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:58,536 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:58,536 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:58,537 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:58,537 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:58,537 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:58,537 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:16:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:58,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:58,568 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:16:58,571 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:58,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:58,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2018-11-23 12:16:58,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:58,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:58,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:58,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:16:58,831 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:16:58,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:16:58,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:16:58,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 12:16:58,833 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:16:58,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:16:58,847 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:16:58,848 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:16:58,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:16:58,849 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:16:58,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:16:58,850 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:16:58,850 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:16:58,850 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:16:58,851 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:16:58,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:16:58,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:16:58,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:16:58,852 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:16:58,853 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:16:58,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:16:58,854 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:16:58,854 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:16:58,854 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:16:58,855 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:16:58,855 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:16:58,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:16:58,856 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:16:58,856 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:16:58,857 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:16:58,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:16:58,864 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:16:58,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:58,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:16:58,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:58,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:58,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:16:59,120 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:16:59,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:16:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:16:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:59,132 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:16:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,535 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:16:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:16:59,535 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:16:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:16:59,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:16:59,813 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:16:59,826 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:16:59,826 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:16:59,830 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:16:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:16:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:16:59,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:59,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:16:59,894 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:16:59,894 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:16:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,900 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:16:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:16:59,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:59,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:59,902 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:16:59,902 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:16:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,907 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:16:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:16:59,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:59,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:59,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:59,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:16:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:16:59,914 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:16:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:59,915 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:16:59,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:16:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:16:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:59,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:59,917 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:16:59,918 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:59,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2018-11-23 12:16:59,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:59,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:59,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:00,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:17:00,034 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:17:00,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:17:00,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:17:00,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret12 := main(); {198#true} is VALID [2018-11-23 12:17:00,040 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:17:00,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 10); {199#false} is VALID [2018-11-23 12:17:00,041 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:17:00,041 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:17:00,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 10); {198#true} is VALID [2018-11-23 12:17:00,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:17:00,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:17:00,042 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:17:00,043 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:17:00,043 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:17:00,043 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:17:00,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 10); {198#true} is VALID [2018-11-23 12:17:00,044 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:17:00,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:17:00,044 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:17:00,045 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:17:00,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 9); {199#false} is VALID [2018-11-23 12:17:00,045 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:17:00,046 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:17:00,046 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:17:00,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 10); {198#true} is VALID [2018-11-23 12:17:00,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:17:00,047 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:17:00,047 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:17:00,048 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:17:00,048 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:17:00,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:17:00,050 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:17:00,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:17:00,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:17:00,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:17:00,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:00,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:17:00,116 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:17:00,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:17:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:17:00,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:17:00,118 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:17:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:00,699 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:17:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:17:00,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:17:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:17:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:17:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:17:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:17:00,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:17:00,849 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:17:00,852 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:17:00,852 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:17:00,853 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:17:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:17:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:17:00,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:00,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:17:00,887 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:17:00,887 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:17:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:00,890 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:17:00,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:17:00,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:00,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:00,892 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:17:00,892 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:17:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:00,895 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:17:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:17:00,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:00,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:00,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:00,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:17:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:17:00,900 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:17:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:00,900 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:17:00,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:17:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:17:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:17:00,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:00,902 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:17:00,903 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:00,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:00,903 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2018-11-23 12:17:00,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:00,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:17:01,072 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:17:01,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:17:01,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:17:01,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:17:01,073 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:17:01,073 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:17:01,073 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:17:01,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10); {362#true} is VALID [2018-11-23 12:17:01,074 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:17:01,075 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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:01,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= sum_~i~0 0)} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:17:01,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:17:01,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:17:01,076 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:17:01,077 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:17:01,077 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:17:01,077 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:17:01,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 10); {362#true} is VALID [2018-11-23 12:17:01,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:17:01,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:17:01,078 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:17:01,079 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:17:01,079 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9); {363#false} is VALID [2018-11-23 12:17:01,079 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:17:01,080 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:17:01,080 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:17:01,080 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 10); {362#true} is VALID [2018-11-23 12:17:01,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:17:01,081 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:17:01,081 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:17:01,082 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:17:01,082 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:17:01,082 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:17:01,085 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:17:01,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:01,085 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:17:01,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:01,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:17:01,315 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:17:01,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:17:01,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:17:01,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret12 := main(); {362#true} is VALID [2018-11-23 12:17:01,317 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:17:01,317 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:17:01,318 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:17:01,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10); {362#true} is VALID [2018-11-23 12:17:01,318 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:17:01,322 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:01,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= sum_~i~0 0)} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:17:01,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:17:01,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:17:01,324 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:17:01,325 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:17:01,325 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:17:01,325 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:17:01,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:17:01,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:17:01,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:17:01,326 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:17:01,327 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:17:01,327 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9); {363#false} is VALID [2018-11-23 12:17:01,327 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:17:01,327 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:17:01,328 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:17:01,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 10); {363#false} is VALID [2018-11-23 12:17:01,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:17:01,329 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:17:01,329 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:17:01,329 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:17:01,330 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:17:01,330 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:17:01,332 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:17:01,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:17:01,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:17:01,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:17:01,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:01,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:17:01,474 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:17:01,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:17:01,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:17:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:17:01,475 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:17:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,698 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:17:01,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:17:01,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:17:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:17:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:17:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:17:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:17:01,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:17:01,822 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:17:01,825 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:17:01,825 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:17:01,826 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:17:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:17:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:17:01,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:01,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:17:01,844 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:17:01,844 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:17:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,848 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:17:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:17:01,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:01,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:01,849 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:17:01,850 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:17:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,852 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:17:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:17:01,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:01,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:01,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:01,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:17:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:17:01,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:17:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:01,856 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:17:01,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:17:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:17:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:17:01,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:01,858 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:17:01,859 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:01,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:01,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2018-11-23 12:17:01,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:01,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:01,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:17:01,968 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:17:01,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:17:01,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:17:01,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret12 := main(); {630#true} is VALID [2018-11-23 12:17:01,970 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:17:01,970 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:17:01,970 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:17:01,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 10); {630#true} is VALID [2018-11-23 12:17:01,971 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:17:01,971 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:17:01,971 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:17:01,971 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:17:01,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 10); {630#true} is VALID [2018-11-23 12:17:01,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:17:01,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:17:01,973 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:17:01,973 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:17:01,973 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:17:01,973 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:17:01,974 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:17:01,974 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:17:01,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 10); {630#true} is VALID [2018-11-23 12:17:01,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:17:01,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:17:01,975 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:17:01,981 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:17:01,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 9); {631#false} is VALID [2018-11-23 12:17:01,983 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:17:01,983 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:17:01,984 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:17:01,984 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:17:01,984 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:17:01,984 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 10); {630#true} is VALID [2018-11-23 12:17:01,985 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:17:01,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:17:01,985 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:17:01,985 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:17:01,985 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:17:01,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:17:01,988 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:17:01,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:17:01,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:17:01,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:17:01,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:01,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:17:02,111 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:17:02,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:17:02,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:17:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:17:02,112 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:17:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,211 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:17:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:17:02,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:17:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:17:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:17:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:17:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:17:02,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:17:02,308 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:17:02,310 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:17:02,311 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:17:02,312 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:17:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:17:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:17:02,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:02,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:17:02,324 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:17:02,325 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:17:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,328 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:17:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:17:02,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,332 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:17:02,333 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:17:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,335 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:17:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:17:02,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:02,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:17:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:17:02,339 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:17:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:02,339 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:17:02,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:17:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:17:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:17:02,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:02,341 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:17:02,342 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:02,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2018-11-23 12:17:02,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:02,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:02,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:02,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:02,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:17:02,444 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:17:02,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:17:02,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:17:02,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:17:02,445 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:17:02,447 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:17:02,447 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:17:02,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10); {800#false} is VALID [2018-11-23 12:17:02,449 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:17:02,449 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:17:02,449 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:17:02,449 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:17:02,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 10); {799#true} is VALID [2018-11-23 12:17:02,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:17:02,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:17:02,450 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:17:02,450 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:17:02,451 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:17:02,451 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:17:02,451 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:17:02,451 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:17:02,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 10); {799#true} is VALID [2018-11-23 12:17:02,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:17:02,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:17:02,453 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:17:02,453 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:17:02,453 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:17:02,453 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:17:02,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9); {800#false} is VALID [2018-11-23 12:17:02,454 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:17:02,454 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:17:02,455 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:17:02,455 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:17:02,455 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:17:02,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 10); {799#true} is VALID [2018-11-23 12:17:02,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:17:02,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:17:02,456 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:17:02,456 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:17:02,457 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:17:02,457 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:17:02,460 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:17:02,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:02,460 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:17:02,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:02,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:02,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:17:02,842 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:17:02,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:17:02,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:17:02,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret12 := main(); {799#true} is VALID [2018-11-23 12:17:02,844 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:17:02,845 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:17:02,845 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:17:02,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10); {800#false} is VALID [2018-11-23 12:17:02,846 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:17:02,846 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:17:02,847 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:17:02,847 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:17:02,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 10); {800#false} is VALID [2018-11-23 12:17:02,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:17:02,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:17:02,848 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:17:02,848 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:17:02,848 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:17:02,849 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:17:02,849 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:17:02,849 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:17:02,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 10); {800#false} is VALID [2018-11-23 12:17:02,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:17:02,850 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:17:02,850 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:17:02,850 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:17:02,851 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:17:02,851 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:17:02,851 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9); {800#false} is VALID [2018-11-23 12:17:02,851 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:17:02,851 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:17:02,852 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:17:02,852 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:17:02,852 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:17:02,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 10); {800#false} is VALID [2018-11-23 12:17:02,852 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:17:02,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:17:02,853 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:17:02,853 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:17:02,854 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:17:02,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:17:02,856 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:17:02,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:02,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:17:02,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:17:02,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:02,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:17:02,948 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:17:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:17:02,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:17:02,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:17:02,950 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:17:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:03,185 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:17:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:17:03,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:17:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:17:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:17:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:17:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:17:03,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:17:03,294 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:17:03,295 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:17:03,295 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:17:03,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:17:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:17:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:17:03,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:03,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:17:03,379 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:17:03,379 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:17:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:03,382 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:17:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:17:03,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:03,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:03,383 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:17:03,383 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:17:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:03,385 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:17:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:17:03,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:03,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:03,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:03,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:17:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:17:03,389 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:17:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:03,389 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:17:03,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:17:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:17:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:17:03,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:03,391 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:17:03,391 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:03,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2018-11-23 12:17:03,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:03,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:17:03,533 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:17:03,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:17:03,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:17:03,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:17:03,535 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:17:03,537 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:17:03,538 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:17:03,539 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:17:03,539 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:17:03,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10); {1115#false} is VALID [2018-11-23 12:17:03,540 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:17:03,540 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:17:03,541 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:17:03,541 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:17:03,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 10); {1114#true} is VALID [2018-11-23 12:17:03,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:17:03,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:17:03,542 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:17:03,542 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:17:03,543 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:17:03,543 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:17:03,543 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:17:03,543 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:17:03,543 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 10); {1114#true} is VALID [2018-11-23 12:17:03,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:17:03,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:17:03,544 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:17:03,544 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:17:03,544 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:17:03,545 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:17:03,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9); {1115#false} is VALID [2018-11-23 12:17:03,545 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:17:03,545 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:17:03,545 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:17:03,546 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:17:03,546 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:17:03,546 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 10); {1114#true} is VALID [2018-11-23 12:17:03,546 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:17:03,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:17:03,547 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:17:03,547 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:17:03,547 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:17:03,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:17:03,549 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:17:03,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:03,550 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:17:03,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:03,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:03,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:03,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:03,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:17:03,731 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:17:03,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:17:03,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:17:03,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret12 := main(); {1114#true} is VALID [2018-11-23 12:17:03,738 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:17:03,739 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:17:03,739 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:17:03,741 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:17:03,742 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:17:03,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10); {1115#false} is VALID [2018-11-23 12:17:03,744 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:17:03,744 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:17:03,745 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:17:03,745 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:17:03,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 10); {1115#false} is VALID [2018-11-23 12:17:03,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:17:03,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:17:03,747 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:17:03,747 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:17:03,747 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:17:03,747 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:17:03,747 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:17:03,748 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:17:03,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 10); {1115#false} is VALID [2018-11-23 12:17:03,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:17:03,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:17:03,748 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:17:03,749 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:17:03,749 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:17:03,749 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:17:03,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9); {1115#false} is VALID [2018-11-23 12:17:03,749 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:17:03,750 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:17:03,750 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:17:03,750 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:17:03,750 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:17:03,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 10); {1115#false} is VALID [2018-11-23 12:17:03,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:17:03,751 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:17:03,751 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:17:03,752 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:17:03,752 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:17:03,752 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:17:03,754 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:17:03,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:03,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:17:03,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:17:03,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:03,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:17:03,841 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:17:03,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:17:03,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:17:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:17:03,842 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:17:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:04,021 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:17:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:17:04,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:17:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:17:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:17:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:17:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:17:04,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:17:04,180 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:17:04,184 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:17:04,184 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:17:04,185 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:17:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:17:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:17:04,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:04,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:17:04,213 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:17:04,214 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:17:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:04,218 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:17:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:17:04,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:04,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:04,219 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:17:04,219 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:17:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:04,222 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:17:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:17:04,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:04,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:04,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:04,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:17:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:17:04,225 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:17:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:04,225 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:17:04,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:17:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:17:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:17:04,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:04,227 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:17:04,228 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:04,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2018-11-23 12:17:04,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:04,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:04,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:05,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:17:05,038 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:17:05,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:17:05,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:17:05,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:17:05,040 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:17:05,040 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:17:05,042 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:17:05,042 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:17:05,043 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:17:05,043 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:17:05,044 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:17:05,044 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 10); {1447#false} is VALID [2018-11-23 12:17:05,045 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:17:05,045 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:17:05,045 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:17:05,046 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:17:05,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:17:05,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:17:05,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:17:05,047 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:17:05,048 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:17:05,048 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:17:05,048 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:17:05,049 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:17:05,049 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:17:05,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:17:05,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:17:05,050 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:17:05,050 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:17:05,050 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:17:05,050 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:17:05,051 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:17:05,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 9); {1447#false} is VALID [2018-11-23 12:17:05,051 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:17:05,051 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:17:05,052 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:17:05,052 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:17:05,052 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:17:05,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:17:05,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:17:05,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:17:05,053 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:17:05,054 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:17:05,054 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:17:05,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:17:05,057 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:17:05,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:05,057 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:17:05,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:05,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:17:05,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:05,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:05,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:17:05,286 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:17:05,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:17:05,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:17:05,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret12 := main(); {1446#true} is VALID [2018-11-23 12:17:05,287 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:17:05,287 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:17:05,287 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:17:05,288 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:17:05,288 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:17:05,288 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:17:05,288 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:17:05,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 10); {1446#true} is VALID [2018-11-23 12:17:05,289 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:17:05,289 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:17:05,289 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:17:05,289 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:17:05,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:17:05,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:17:05,290 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:17:05,290 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:17:05,290 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:17:05,290 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:17:05,290 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:17:05,290 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:17:05,291 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:17:05,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10); {1446#true} is VALID [2018-11-23 12:17:05,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:17:05,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:17:05,291 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:17:05,292 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:17:05,292 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:17:05,292 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:17:05,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 9); {1446#true} is VALID [2018-11-23 12:17:05,292 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:17:05,292 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:17:05,293 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:05,293 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= sum_~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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:05,294 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1570#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:05,295 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= sum_~i~0 1)} assume !(~i~0 < 10); {1447#false} is VALID [2018-11-23 12:17:05,295 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:17:05,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:17:05,295 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:17:05,295 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:17:05,295 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:17:05,296 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:17:05,298 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:17:05,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:05,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:17:05,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:17:05,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:05,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:17:05,440 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:17:05,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:17:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:17:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:17:05,441 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:17:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:05,712 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:17:05,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:17:05,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:17:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:17:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:17:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:17:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:17:05,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:17:05,795 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:17:05,797 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:17:05,798 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:17:05,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:17:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:17:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:17:05,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:05,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:17:05,860 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:17:05,860 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:17:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:05,862 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:17:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:17:05,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:05,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:05,863 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:17:05,863 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:17:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:05,866 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:17:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:17:05,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:05,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:05,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:05,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:17:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:17:05,869 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:17:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:05,869 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:17:05,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:17:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:17:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:17:05,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:05,871 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:17:05,871 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:05,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2018-11-23 12:17:05,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:05,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:05,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:05,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:05,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:06,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:17:06,009 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:17:06,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:17:06,010 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:17:06,010 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:17:06,011 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:17:06,016 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:17:06,016 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:17:06,017 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:17:06,017 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:17:06,018 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:17:06,018 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:17:06,019 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:17:06,019 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:17:06,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10); {1810#false} is VALID [2018-11-23 12:17:06,020 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:17:06,021 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:17:06,021 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:17:06,021 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:17:06,022 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:17:06,022 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:17:06,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 10); {1809#true} is VALID [2018-11-23 12:17:06,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:17:06,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:17:06,023 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:17:06,023 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:17:06,023 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:17:06,023 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:17:06,024 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:17:06,024 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:17:06,024 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:17:06,024 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:17:06,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 10); {1809#true} is VALID [2018-11-23 12:17:06,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:17:06,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:17:06,025 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:17:06,025 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:17:06,026 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:17:06,026 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:17:06,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9); {1810#false} is VALID [2018-11-23 12:17:06,026 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:17:06,027 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:17:06,027 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:17:06,027 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:17:06,027 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:17:06,028 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:17:06,028 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:17:06,028 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 10); {1809#true} is VALID [2018-11-23 12:17:06,028 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:17:06,028 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:17:06,029 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:17:06,029 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:17:06,029 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:17:06,029 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:17:06,033 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:17:06,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:06,033 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:17:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:06,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:06,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:06,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:06,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:17:06,230 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:17:06,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:17:06,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:17:06,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret12 := main(); {1809#true} is VALID [2018-11-23 12:17:06,231 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:17:06,231 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:17:06,232 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:17:06,232 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:17:06,232 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:17:06,232 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:17:06,233 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:17:06,233 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:17:06,233 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:17:06,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {1809#true} assume !(~i~1 < 10); {1809#true} is VALID [2018-11-23 12:17:06,233 INFO L256 TraceCheckUtils]: 15: Hoare triple {1809#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:17:06,237 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:06,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {1867#(<= sum_~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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:06,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {1867#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1874#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:06,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {1874#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:06,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {1874#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1881#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:06,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {1881#(<= sum_~i~0 2)} assume !(~i~0 < 10); {1810#false} is VALID [2018-11-23 12:17:06,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:17:06,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:17:06,245 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1809#true} #70#return; {1810#false} is VALID [2018-11-23 12:17:06,246 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:17:06,246 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:17:06,246 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:17:06,247 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:17:06,247 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:17:06,247 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:17:06,248 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:17:06,248 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 10); {1810#false} is VALID [2018-11-23 12:17:06,248 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:17:06,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:17:06,249 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:17:06,249 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:17:06,249 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:17:06,250 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:17:06,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9); {1810#false} is VALID [2018-11-23 12:17:06,250 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:17:06,250 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:17:06,251 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:17:06,251 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:17:06,251 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:17:06,251 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:17:06,251 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:17:06,252 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 10); {1810#false} is VALID [2018-11-23 12:17:06,252 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:17:06,252 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:17:06,252 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:17:06,252 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:17:06,252 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:17:06,253 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:17:06,256 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:17:06,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:06,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-23 12:17:06,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-23 12:17:06,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:06,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:17:06,376 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:17:06,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:17:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:17:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:17:06,377 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 10 states. [2018-11-23 12:17:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,703 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-23 12:17:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:17:06,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-23 12:17:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:17:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:17:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:17:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:17:06,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2018-11-23 12:17:06,833 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:17:06,835 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:17:06,835 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:17:06,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:17:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:17:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 12:17:06,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:06,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 12:17:06,863 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 12:17:06,864 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 12:17:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,866 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-23 12:17:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:17:06,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:06,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:06,867 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 12:17:06,867 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 12:17:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,869 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-23 12:17:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:17:06,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:06,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:06,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:06,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:17:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 12:17:06,872 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 54 [2018-11-23 12:17:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:06,872 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 12:17:06,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:17:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 12:17:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:17:06,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:06,874 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:17:06,874 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:06,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1857622835, now seen corresponding path program 5 times [2018-11-23 12:17:06,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:06,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:06,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:06,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:06,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:07,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {2221#true} call ULTIMATE.init(); {2221#true} is VALID [2018-11-23 12:17:07,301 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:17:07,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:17:07,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2221#true} {2221#true} #66#return; {2221#true} is VALID [2018-11-23 12:17:07,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {2221#true} call #t~ret12 := main(); {2221#true} is VALID [2018-11-23 12:17:07,306 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:17:07,307 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:17:07,308 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:17:07,308 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:17:07,309 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:17:07,309 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:17:07,309 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:17:07,310 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:17:07,310 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:17:07,311 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:17:07,312 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:17:07,312 INFO L273 TraceCheckUtils]: 16: Hoare triple {2228#(<= main_~i~1 5)} assume !(~i~1 < 10); {2222#false} is VALID [2018-11-23 12:17:07,313 INFO L256 TraceCheckUtils]: 17: Hoare triple {2222#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:17:07,313 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:17:07,313 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:17:07,313 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:17:07,314 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:17:07,314 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:17:07,314 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:17:07,314 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:17:07,315 INFO L273 TraceCheckUtils]: 25: Hoare triple {2221#true} assume !(~i~0 < 10); {2221#true} is VALID [2018-11-23 12:17:07,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {2221#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2221#true} is VALID [2018-11-23 12:17:07,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:17:07,315 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2221#true} {2222#false} #70#return; {2222#false} is VALID [2018-11-23 12:17:07,316 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:17:07,316 INFO L256 TraceCheckUtils]: 30: Hoare triple {2222#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:17:07,316 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:17:07,316 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:17:07,317 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:17:07,317 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:17:07,317 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:17:07,317 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:17:07,317 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:17:07,317 INFO L273 TraceCheckUtils]: 38: Hoare triple {2221#true} assume !(~i~0 < 10); {2221#true} is VALID [2018-11-23 12:17:07,318 INFO L273 TraceCheckUtils]: 39: Hoare triple {2221#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2221#true} is VALID [2018-11-23 12:17:07,318 INFO L273 TraceCheckUtils]: 40: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:17:07,318 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2221#true} {2222#false} #72#return; {2222#false} is VALID [2018-11-23 12:17:07,318 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:17:07,318 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:17:07,318 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:17:07,318 INFO L273 TraceCheckUtils]: 45: Hoare triple {2222#false} assume !(~i~2 < 9); {2222#false} is VALID [2018-11-23 12:17:07,319 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:17:07,319 INFO L256 TraceCheckUtils]: 47: Hoare triple {2222#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:17:07,319 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:17:07,319 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:17:07,319 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:17:07,319 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:17:07,320 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:17:07,320 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:17:07,320 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:17:07,320 INFO L273 TraceCheckUtils]: 55: Hoare triple {2221#true} assume !(~i~0 < 10); {2221#true} is VALID [2018-11-23 12:17:07,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {2221#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2221#true} is VALID [2018-11-23 12:17:07,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:17:07,321 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2221#true} {2222#false} #74#return; {2222#false} is VALID [2018-11-23 12:17:07,321 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:17:07,321 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:17:07,321 INFO L273 TraceCheckUtils]: 61: Hoare triple {2222#false} assume !false; {2222#false} is VALID [2018-11-23 12:17:07,324 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:17:07,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:07,324 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:17:07,334 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:07,403 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 12:17:07,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:07,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:07,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {2221#true} call ULTIMATE.init(); {2221#true} is VALID [2018-11-23 12:17:07,611 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:17:07,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {2221#true} assume true; {2221#true} is VALID [2018-11-23 12:17:07,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2221#true} {2221#true} #66#return; {2221#true} is VALID [2018-11-23 12:17:07,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {2221#true} call #t~ret12 := main(); {2221#true} is VALID [2018-11-23 12:17:07,612 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:17:07,612 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:17:07,612 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:17:07,612 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:17:07,613 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:17:07,613 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:17:07,613 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:17:07,613 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:17:07,613 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:17:07,613 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:17:07,613 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:17:07,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {2221#true} assume !(~i~1 < 10); {2221#true} is VALID [2018-11-23 12:17:07,614 INFO L256 TraceCheckUtils]: 17: Hoare triple {2221#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2221#true} is VALID [2018-11-23 12:17:07,618 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:07,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {2286#(<= sum_~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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:07,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {2286#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2293#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:07,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {2293#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:07,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {2293#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2300#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:07,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {2300#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:07,621 INFO L273 TraceCheckUtils]: 24: Hoare triple {2300#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:07,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {2307#(<= sum_~i~0 3)} assume !(~i~0 < 10); {2222#false} is VALID [2018-11-23 12:17:07,622 INFO L273 TraceCheckUtils]: 26: Hoare triple {2222#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2222#false} is VALID [2018-11-23 12:17:07,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {2222#false} assume true; {2222#false} is VALID [2018-11-23 12:17:07,622 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2222#false} {2221#true} #70#return; {2222#false} is VALID [2018-11-23 12:17:07,623 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:17:07,623 INFO L256 TraceCheckUtils]: 30: Hoare triple {2222#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2222#false} is VALID [2018-11-23 12:17:07,623 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:17:07,623 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:17:07,624 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:17:07,624 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:17:07,624 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:17:07,624 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:17:07,625 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:17:07,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {2222#false} assume !(~i~0 < 10); {2222#false} is VALID [2018-11-23 12:17:07,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {2222#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2222#false} is VALID [2018-11-23 12:17:07,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {2222#false} assume true; {2222#false} is VALID [2018-11-23 12:17:07,626 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2222#false} {2222#false} #72#return; {2222#false} is VALID [2018-11-23 12:17:07,626 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:17:07,626 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:17:07,626 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:17:07,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {2222#false} assume !(~i~2 < 9); {2222#false} is VALID [2018-11-23 12:17:07,627 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:17:07,627 INFO L256 TraceCheckUtils]: 47: Hoare triple {2222#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2222#false} is VALID [2018-11-23 12:17:07,627 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:17:07,627 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:17:07,627 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:17:07,628 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:17:07,628 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:17:07,628 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:17:07,628 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:17:07,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {2222#false} assume !(~i~0 < 10); {2222#false} is VALID [2018-11-23 12:17:07,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {2222#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2222#false} is VALID [2018-11-23 12:17:07,629 INFO L273 TraceCheckUtils]: 57: Hoare triple {2222#false} assume true; {2222#false} is VALID [2018-11-23 12:17:07,629 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2222#false} {2222#false} #74#return; {2222#false} is VALID [2018-11-23 12:17:07,629 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:17:07,629 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:17:07,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {2222#false} assume !false; {2222#false} is VALID [2018-11-23 12:17:07,642 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:17:07,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:07,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 12:17:07,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-23 12:17:07,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:07,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:17:07,752 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:17:07,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:17:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:17:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:07,753 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 12 states. [2018-11-23 12:17:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:08,289 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2018-11-23 12:17:08,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:17:08,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-23 12:17:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 12:17:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 12:17:08,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2018-11-23 12:17:08,403 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:17:08,405 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:17:08,405 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:17:08,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:17:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-23 12:17:08,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:08,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 45 states. [2018-11-23 12:17:08,437 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 45 states. [2018-11-23 12:17:08,438 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 45 states. [2018-11-23 12:17:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:08,440 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 12:17:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:17:08,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:08,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:08,448 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 47 states. [2018-11-23 12:17:08,448 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 47 states. [2018-11-23 12:17:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:08,451 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 12:17:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:17:08,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:08,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:08,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:08,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:17:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 12:17:08,457 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 62 [2018-11-23 12:17:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:08,457 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 12:17:08,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:17:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:17:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:17:08,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:08,458 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:17:08,458 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:08,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:08,459 INFO L82 PathProgramCache]: Analyzing trace with hash 932875661, now seen corresponding path program 6 times [2018-11-23 12:17:08,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:08,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:08,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:08,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:08,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 12:17:08,726 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:17:08,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:17:08,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #66#return; {2682#true} is VALID [2018-11-23 12:17:08,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret12 := main(); {2682#true} is VALID [2018-11-23 12:17:08,727 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:17:08,728 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:17:08,728 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:17:08,729 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:17:08,729 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:17:08,730 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:17:08,730 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:17:08,730 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:17:08,731 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:17:08,731 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:17:08,732 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:17:08,732 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:17:08,733 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:17:08,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {2690#(<= main_~i~1 6)} assume !(~i~1 < 10); {2683#false} is VALID [2018-11-23 12:17:08,734 INFO L256 TraceCheckUtils]: 19: Hoare triple {2683#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:17:08,734 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:17:08,734 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:17:08,734 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:17:08,735 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:17:08,735 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:17:08,735 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:17:08,735 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:17:08,735 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:17:08,736 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:17:08,736 INFO L273 TraceCheckUtils]: 29: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:17:08,736 INFO L273 TraceCheckUtils]: 30: Hoare triple {2682#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:17:08,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:17:08,736 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2682#true} {2683#false} #70#return; {2683#false} is VALID [2018-11-23 12:17:08,737 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:17:08,737 INFO L256 TraceCheckUtils]: 34: Hoare triple {2683#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:17:08,737 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:17:08,737 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:17:08,737 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:17:08,737 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:17:08,737 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:17:08,738 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:17:08,738 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:17:08,738 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:17:08,738 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:17:08,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:17:08,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {2682#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:17:08,738 INFO L273 TraceCheckUtils]: 46: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:17:08,739 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2682#true} {2683#false} #72#return; {2683#false} is VALID [2018-11-23 12:17:08,739 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:17:08,739 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:17:08,739 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:17:08,739 INFO L273 TraceCheckUtils]: 51: Hoare triple {2683#false} assume !(~i~2 < 9); {2683#false} is VALID [2018-11-23 12:17:08,739 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:17:08,740 INFO L256 TraceCheckUtils]: 53: Hoare triple {2683#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:17:08,740 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:17:08,740 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:17:08,740 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:17:08,740 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:17:08,741 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:17:08,741 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:17:08,741 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:17:08,741 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:17:08,741 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:17:08,741 INFO L273 TraceCheckUtils]: 63: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:17:08,742 INFO L273 TraceCheckUtils]: 64: Hoare triple {2682#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:17:08,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:17:08,742 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2682#true} {2683#false} #74#return; {2683#false} is VALID [2018-11-23 12:17:08,742 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:17:08,742 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:17:08,742 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 12:17:08,745 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:17:08,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:08,746 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:17:08,762 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:17:08,804 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:17:08,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:08,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:09,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 12:17:09,078 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:17:09,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:17:09,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #66#return; {2682#true} is VALID [2018-11-23 12:17:09,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret12 := main(); {2682#true} is VALID [2018-11-23 12:17:09,079 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:17:09,079 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:17:09,079 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:17:09,080 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:17:09,080 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:17:09,080 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:17:09,080 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:17:09,080 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:17:09,080 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:17:09,081 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:17:09,081 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:17:09,081 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:17:09,081 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:17:09,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {2682#true} assume !(~i~1 < 10); {2682#true} is VALID [2018-11-23 12:17:09,081 INFO L256 TraceCheckUtils]: 19: Hoare triple {2682#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:17:09,082 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:17:09,082 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:17:09,082 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:17:09,082 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:17:09,082 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:17:09,082 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:17:09,082 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:17:09,083 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:17:09,083 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:17:09,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:17:09,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {2682#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:17:09,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:17:09,083 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2682#true} {2682#true} #70#return; {2682#true} is VALID [2018-11-23 12:17:09,084 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:17:09,084 INFO L256 TraceCheckUtils]: 34: Hoare triple {2682#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2682#true} is VALID [2018-11-23 12:17:09,084 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:17:09,084 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:17:09,084 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:17:09,085 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:17:09,085 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:17:09,085 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:17:09,085 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:17:09,086 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:17:09,086 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:17:09,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {2682#true} assume !(~i~0 < 10); {2682#true} is VALID [2018-11-23 12:17:09,086 INFO L273 TraceCheckUtils]: 45: Hoare triple {2682#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2682#true} is VALID [2018-11-23 12:17:09,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 12:17:09,087 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2682#true} {2682#true} #72#return; {2682#true} is VALID [2018-11-23 12:17:09,102 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:17:09,116 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:17:09,125 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:17:09,138 INFO L273 TraceCheckUtils]: 51: Hoare triple {2845#(<= main_~i~2 1)} assume !(~i~2 < 9); {2683#false} is VALID [2018-11-23 12:17:09,138 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:17:09,138 INFO L256 TraceCheckUtils]: 53: Hoare triple {2683#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2683#false} is VALID [2018-11-23 12:17:09,139 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:17:09,139 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:17:09,139 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:17:09,139 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:17:09,140 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:17:09,140 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:17:09,140 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:17:09,140 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:17:09,140 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:17:09,141 INFO L273 TraceCheckUtils]: 63: Hoare triple {2683#false} assume !(~i~0 < 10); {2683#false} is VALID [2018-11-23 12:17:09,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {2683#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2683#false} is VALID [2018-11-23 12:17:09,141 INFO L273 TraceCheckUtils]: 65: Hoare triple {2683#false} assume true; {2683#false} is VALID [2018-11-23 12:17:09,141 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2683#false} {2683#false} #74#return; {2683#false} is VALID [2018-11-23 12:17:09,141 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:17:09,142 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:17:09,142 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 12:17:09,145 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:17:09,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:09,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:17:09,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-23 12:17:09,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:09,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:17:09,265 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:17:09,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:17:09,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:17:09,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:09,266 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 11 states. [2018-11-23 12:17:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:09,531 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-23 12:17:09,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:17:09,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-11-23 12:17:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:17:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:17:09,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:17:09,627 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:17:09,628 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:17:09,628 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:17:09,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:17:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 12:17:09,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:09,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-23 12:17:09,650 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-23 12:17:09,650 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-23 12:17:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:09,653 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 12:17:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:17:09,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:09,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:09,654 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-23 12:17:09,654 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-23 12:17:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:09,656 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 12:17:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:17:09,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:09,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:09,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:09,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:17:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:17:09,658 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 70 [2018-11-23 12:17:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:09,658 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:17:09,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:17:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:17:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 12:17:09,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:09,660 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:17:09,660 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:09,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash 592539373, now seen corresponding path program 7 times [2018-11-23 12:17:09,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:09,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:09,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:09,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:10,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 12:17:10,523 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:17:10,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:17:10,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #66#return; {3189#true} is VALID [2018-11-23 12:17:10,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret12 := main(); {3189#true} is VALID [2018-11-23 12:17:10,524 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:17:10,534 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:17:10,535 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:17:10,535 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:17:10,536 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:17:10,536 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:17:10,537 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:17:10,537 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:17:10,537 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:17:10,538 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:17:10,539 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:17:10,539 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:17:10,540 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:17:10,541 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:17:10,541 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:17:10,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~i~1 7)} assume !(~i~1 < 10); {3190#false} is VALID [2018-11-23 12:17:10,542 INFO L256 TraceCheckUtils]: 21: Hoare triple {3190#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3189#true} is VALID [2018-11-23 12:17:10,543 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:17:10,543 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:17:10,543 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:17:10,543 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:17:10,543 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:17:10,544 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:17:10,544 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:17:10,544 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:17:10,544 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:17:10,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {3189#true} assume !(~i~0 < 10); {3189#true} is VALID [2018-11-23 12:17:10,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {3189#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3189#true} is VALID [2018-11-23 12:17:10,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:17:10,545 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3189#true} {3190#false} #70#return; {3190#false} is VALID [2018-11-23 12:17:10,545 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:17:10,546 INFO L256 TraceCheckUtils]: 36: Hoare triple {3190#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3189#true} is VALID [2018-11-23 12:17:10,546 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:17:10,546 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:17:10,546 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:17:10,546 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:17:10,546 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:17:10,546 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:17:10,546 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:17:10,546 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:17:10,547 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:17:10,547 INFO L273 TraceCheckUtils]: 46: Hoare triple {3189#true} assume !(~i~0 < 10); {3189#true} is VALID [2018-11-23 12:17:10,547 INFO L273 TraceCheckUtils]: 47: Hoare triple {3189#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3189#true} is VALID [2018-11-23 12:17:10,547 INFO L273 TraceCheckUtils]: 48: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:17:10,547 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3189#true} {3190#false} #72#return; {3190#false} is VALID [2018-11-23 12:17:10,547 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:17:10,547 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:17:10,547 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:17:10,548 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:17:10,548 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:17:10,548 INFO L273 TraceCheckUtils]: 55: Hoare triple {3190#false} assume !(~i~2 < 9); {3190#false} is VALID [2018-11-23 12:17:10,548 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:17:10,548 INFO L256 TraceCheckUtils]: 57: Hoare triple {3190#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3189#true} is VALID [2018-11-23 12:17:10,548 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:17:10,548 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:17:10,548 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:17:10,549 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:17:10,549 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:17:10,549 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:17:10,549 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:17:10,549 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:17:10,549 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:17:10,549 INFO L273 TraceCheckUtils]: 67: Hoare triple {3189#true} assume !(~i~0 < 10); {3189#true} is VALID [2018-11-23 12:17:10,549 INFO L273 TraceCheckUtils]: 68: Hoare triple {3189#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3189#true} is VALID [2018-11-23 12:17:10,549 INFO L273 TraceCheckUtils]: 69: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:17:10,550 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3189#true} {3190#false} #74#return; {3190#false} is VALID [2018-11-23 12:17:10,550 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:17:10,550 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:17:10,550 INFO L273 TraceCheckUtils]: 73: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 12:17:10,552 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:17:10,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:10,553 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:17:10,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:10,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:10,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 12:17:10,791 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:17:10,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 12:17:10,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #66#return; {3189#true} is VALID [2018-11-23 12:17:10,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret12 := main(); {3189#true} is VALID [2018-11-23 12:17:10,793 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:17:10,794 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:17:10,794 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:17:10,795 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:17:10,795 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:17:10,795 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:17:10,796 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:17:10,796 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:17:10,797 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:17:10,798 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:17:10,798 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:17:10,799 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:17:10,800 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:17:10,800 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:17:10,801 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:17:10,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {3198#(<= main_~i~1 7)} assume !(~i~1 < 10); {3190#false} is VALID [2018-11-23 12:17:10,802 INFO L256 TraceCheckUtils]: 21: Hoare triple {3190#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3190#false} is VALID [2018-11-23 12:17:10,802 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:17:10,803 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:17:10,803 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:17:10,803 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:17:10,803 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:17:10,803 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:17:10,804 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:17:10,804 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:17:10,804 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:17:10,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {3190#false} assume !(~i~0 < 10); {3190#false} is VALID [2018-11-23 12:17:10,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {3190#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3190#false} is VALID [2018-11-23 12:17:10,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {3190#false} assume true; {3190#false} is VALID [2018-11-23 12:17:10,805 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3190#false} {3190#false} #70#return; {3190#false} is VALID [2018-11-23 12:17:10,805 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:17:10,805 INFO L256 TraceCheckUtils]: 36: Hoare triple {3190#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3190#false} is VALID [2018-11-23 12:17:10,805 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:17:10,805 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:17:10,805 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:17:10,806 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:17:10,806 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:17:10,806 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:17:10,806 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:17:10,806 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:17:10,806 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:17:10,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {3190#false} assume !(~i~0 < 10); {3190#false} is VALID [2018-11-23 12:17:10,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {3190#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3190#false} is VALID [2018-11-23 12:17:10,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {3190#false} assume true; {3190#false} is VALID [2018-11-23 12:17:10,807 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3190#false} {3190#false} #72#return; {3190#false} is VALID [2018-11-23 12:17:10,807 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:17:10,807 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:17:10,807 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:17:10,807 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:17:10,807 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:17:10,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {3190#false} assume !(~i~2 < 9); {3190#false} is VALID [2018-11-23 12:17:10,807 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:17:10,808 INFO L256 TraceCheckUtils]: 57: Hoare triple {3190#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3190#false} is VALID [2018-11-23 12:17:10,808 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:17:10,808 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:17:10,808 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:17:10,808 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:17:10,808 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:17:10,808 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:17:10,808 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:17:10,809 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:17:10,809 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:17:10,809 INFO L273 TraceCheckUtils]: 67: Hoare triple {3190#false} assume !(~i~0 < 10); {3190#false} is VALID [2018-11-23 12:17:10,809 INFO L273 TraceCheckUtils]: 68: Hoare triple {3190#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3190#false} is VALID [2018-11-23 12:17:10,809 INFO L273 TraceCheckUtils]: 69: Hoare triple {3190#false} assume true; {3190#false} is VALID [2018-11-23 12:17:10,809 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3190#false} {3190#false} #74#return; {3190#false} is VALID [2018-11-23 12:17:10,809 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:17:10,809 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:17:10,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 12:17:10,812 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:17:10,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:10,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:17:10,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 12:17:10,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:10,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:17:10,890 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:17:10,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:17:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:17:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:10,891 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2018-11-23 12:17:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:11,364 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-11-23 12:17:11,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:17:11,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 12:17:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:17:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:17:11,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:17:11,435 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:17:11,439 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:17:11,439 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:17:11,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:17:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:17:11,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:11,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:17:11,472 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:17:11,472 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:17:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:11,475 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:17:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:17:11,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:11,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:11,475 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:17:11,475 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:17:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:11,477 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:17:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:17:11,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:11,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:11,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:11,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:17:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:17:11,478 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 74 [2018-11-23 12:17:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:11,479 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:17:11,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:17:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:17:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:17:11,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:11,480 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:17:11,480 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:11,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 295497935, now seen corresponding path program 8 times [2018-11-23 12:17:11,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:11,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:11,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:11,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:11,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 12:17:11,837 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:17:11,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:17:11,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3718#true} {3718#true} #66#return; {3718#true} is VALID [2018-11-23 12:17:11,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {3718#true} call #t~ret12 := main(); {3718#true} is VALID [2018-11-23 12:17:11,838 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:17:11,838 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:17:11,839 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:17:11,839 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:17:11,840 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:17:11,841 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:17:11,842 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:17:11,842 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:17:11,843 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:17:11,843 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:17:11,844 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:17:11,844 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:17:11,844 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:17:11,845 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:17:11,846 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:17:11,846 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:17:11,847 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:17:11,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#(<= main_~i~1 8)} assume !(~i~1 < 10); {3719#false} is VALID [2018-11-23 12:17:11,848 INFO L256 TraceCheckUtils]: 23: Hoare triple {3719#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3718#true} is VALID [2018-11-23 12:17:11,848 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:17:11,848 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:17:11,848 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:17:11,849 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:17:11,849 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:17:11,849 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:17:11,849 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:17:11,850 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:17:11,850 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:17:11,850 INFO L273 TraceCheckUtils]: 33: Hoare triple {3718#true} assume !(~i~0 < 10); {3718#true} is VALID [2018-11-23 12:17:11,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {3718#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3718#true} is VALID [2018-11-23 12:17:11,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:17:11,851 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3718#true} {3719#false} #70#return; {3719#false} is VALID [2018-11-23 12:17:11,851 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:17:11,851 INFO L256 TraceCheckUtils]: 38: Hoare triple {3719#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3718#true} is VALID [2018-11-23 12:17:11,851 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:17:11,851 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:17:11,852 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:17:11,852 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:17:11,852 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:17:11,852 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:17:11,852 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:17:11,852 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:17:11,852 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:17:11,852 INFO L273 TraceCheckUtils]: 48: Hoare triple {3718#true} assume !(~i~0 < 10); {3718#true} is VALID [2018-11-23 12:17:11,853 INFO L273 TraceCheckUtils]: 49: Hoare triple {3718#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3718#true} is VALID [2018-11-23 12:17:11,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:17:11,853 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3718#true} {3719#false} #72#return; {3719#false} is VALID [2018-11-23 12:17:11,853 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:17:11,853 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:17:11,853 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:17:11,853 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:17:11,853 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:17:11,854 INFO L273 TraceCheckUtils]: 57: Hoare triple {3719#false} assume !(~i~2 < 9); {3719#false} is VALID [2018-11-23 12:17:11,854 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:17:11,854 INFO L256 TraceCheckUtils]: 59: Hoare triple {3719#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3718#true} is VALID [2018-11-23 12:17:11,854 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:17:11,854 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:17:11,854 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:17:11,854 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:17:11,854 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:17:11,855 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:17:11,855 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:17:11,855 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:17:11,855 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:17:11,855 INFO L273 TraceCheckUtils]: 69: Hoare triple {3718#true} assume !(~i~0 < 10); {3718#true} is VALID [2018-11-23 12:17:11,855 INFO L273 TraceCheckUtils]: 70: Hoare triple {3718#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3718#true} is VALID [2018-11-23 12:17:11,855 INFO L273 TraceCheckUtils]: 71: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:17:11,855 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {3718#true} {3719#false} #74#return; {3719#false} is VALID [2018-11-23 12:17:11,855 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:17:11,856 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:17:11,856 INFO L273 TraceCheckUtils]: 75: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 12:17:11,858 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:17:11,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:11,859 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:17:11,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:11,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:11,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:11,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:12,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {3718#true} call ULTIMATE.init(); {3718#true} is VALID [2018-11-23 12:17:12,050 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:17:12,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {3718#true} assume true; {3718#true} is VALID [2018-11-23 12:17:12,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3718#true} {3718#true} #66#return; {3718#true} is VALID [2018-11-23 12:17:12,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {3718#true} call #t~ret12 := main(); {3718#true} is VALID [2018-11-23 12:17:12,052 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:17:12,052 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:17:12,053 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:17:12,053 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:17:12,054 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:17:12,054 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:17:12,055 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:17:12,056 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:17:12,057 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:17:12,057 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:17:12,058 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:17:12,059 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:17:12,060 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:17:12,060 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:17:12,061 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:17:12,062 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:17:12,063 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:17:12,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {3728#(<= main_~i~1 8)} assume !(~i~1 < 10); {3719#false} is VALID [2018-11-23 12:17:12,064 INFO L256 TraceCheckUtils]: 23: Hoare triple {3719#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3719#false} is VALID [2018-11-23 12:17:12,064 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:17:12,064 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:17:12,065 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:17:12,065 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:17:12,065 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:17:12,065 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:17:12,066 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:17:12,066 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:17:12,066 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:17:12,067 INFO L273 TraceCheckUtils]: 33: Hoare triple {3719#false} assume !(~i~0 < 10); {3719#false} is VALID [2018-11-23 12:17:12,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {3719#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3719#false} is VALID [2018-11-23 12:17:12,067 INFO L273 TraceCheckUtils]: 35: Hoare triple {3719#false} assume true; {3719#false} is VALID [2018-11-23 12:17:12,067 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3719#false} {3719#false} #70#return; {3719#false} is VALID [2018-11-23 12:17:12,067 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:17:12,068 INFO L256 TraceCheckUtils]: 38: Hoare triple {3719#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3719#false} is VALID [2018-11-23 12:17:12,068 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:17:12,068 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:17:12,068 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:17:12,068 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:17:12,068 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:17:12,069 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:17:12,069 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:17:12,069 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:17:12,069 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:17:12,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {3719#false} assume !(~i~0 < 10); {3719#false} is VALID [2018-11-23 12:17:12,069 INFO L273 TraceCheckUtils]: 49: Hoare triple {3719#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3719#false} is VALID [2018-11-23 12:17:12,069 INFO L273 TraceCheckUtils]: 50: Hoare triple {3719#false} assume true; {3719#false} is VALID [2018-11-23 12:17:12,070 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3719#false} {3719#false} #72#return; {3719#false} is VALID [2018-11-23 12:17:12,070 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:17:12,070 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:17:12,070 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:17:12,070 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:17:12,070 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:17:12,071 INFO L273 TraceCheckUtils]: 57: Hoare triple {3719#false} assume !(~i~2 < 9); {3719#false} is VALID [2018-11-23 12:17:12,071 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:17:12,071 INFO L256 TraceCheckUtils]: 59: Hoare triple {3719#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3719#false} is VALID [2018-11-23 12:17:12,071 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:17:12,071 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:17:12,071 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:17:12,071 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:17:12,072 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:17:12,072 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:17:12,072 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:17:12,072 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:17:12,072 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:17:12,072 INFO L273 TraceCheckUtils]: 69: Hoare triple {3719#false} assume !(~i~0 < 10); {3719#false} is VALID [2018-11-23 12:17:12,072 INFO L273 TraceCheckUtils]: 70: Hoare triple {3719#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3719#false} is VALID [2018-11-23 12:17:12,072 INFO L273 TraceCheckUtils]: 71: Hoare triple {3719#false} assume true; {3719#false} is VALID [2018-11-23 12:17:12,072 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {3719#false} {3719#false} #74#return; {3719#false} is VALID [2018-11-23 12:17:12,073 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:17:12,073 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:17:12,073 INFO L273 TraceCheckUtils]: 75: Hoare triple {3719#false} assume !false; {3719#false} is VALID [2018-11-23 12:17:12,075 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:17:12,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:12,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:17:12,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-23 12:17:12,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:12,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:17:12,154 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:17:12,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:17:12,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:17:12,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:12,156 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 12 states. [2018-11-23 12:17:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:12,332 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-23 12:17:12,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:17:12,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-11-23 12:17:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:17:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:17:12,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:17:12,463 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:17:12,465 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:17:12,465 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:17:12,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:17:12,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 12:17:12,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:12,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 12:17:12,495 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 12:17:12,495 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 12:17:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:12,497 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 12:17:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 12:17:12,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:12,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:12,498 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 12:17:12,498 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 12:17:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:12,500 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 12:17:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-23 12:17:12,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:12,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:12,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:12,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:17:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-23 12:17:12,503 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 76 [2018-11-23 12:17:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:12,504 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-23 12:17:12,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:17:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-23 12:17:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 12:17:12,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:12,505 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:17:12,505 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:12,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1693482447, now seen corresponding path program 9 times [2018-11-23 12:17:12,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:12,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:12,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:12,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {4264#true} call ULTIMATE.init(); {4264#true} is VALID [2018-11-23 12:17:12,748 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:17:12,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:17:12,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4264#true} {4264#true} #66#return; {4264#true} is VALID [2018-11-23 12:17:12,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {4264#true} call #t~ret12 := main(); {4264#true} is VALID [2018-11-23 12:17:12,750 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:17:12,750 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:17:12,751 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:17:12,752 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:17:12,753 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:17:12,754 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:17:12,754 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:17:12,755 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:17:12,756 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:17:12,757 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:17:12,758 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:17:12,758 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:17:12,759 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:17:12,760 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:17:12,761 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:17:12,761 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:17:12,762 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:17:12,763 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:17:12,764 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:17:12,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {4275#(<= main_~i~1 9)} assume !(~i~1 < 10); {4265#false} is VALID [2018-11-23 12:17:12,765 INFO L256 TraceCheckUtils]: 25: Hoare triple {4265#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:17:12,765 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:17:12,766 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:17:12,766 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:17:12,766 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:17:12,766 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:17:12,767 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:17:12,767 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:17:12,767 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:17:12,767 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:17:12,768 INFO L273 TraceCheckUtils]: 35: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:17:12,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {4264#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:17:12,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:17:12,768 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4264#true} {4265#false} #70#return; {4265#false} is VALID [2018-11-23 12:17:12,768 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:17:12,768 INFO L256 TraceCheckUtils]: 40: Hoare triple {4265#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:17:12,768 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:17:12,769 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:17:12,769 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:17:12,769 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:17:12,769 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:17:12,769 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:17:12,769 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:17:12,770 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:17:12,770 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:17:12,770 INFO L273 TraceCheckUtils]: 50: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:17:12,770 INFO L273 TraceCheckUtils]: 51: Hoare triple {4264#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:17:12,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:17:12,770 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {4264#true} {4265#false} #72#return; {4265#false} is VALID [2018-11-23 12:17:12,770 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:17:12,771 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:17:12,771 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:17:12,771 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:17:12,771 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:17:12,771 INFO L273 TraceCheckUtils]: 59: Hoare triple {4265#false} assume !(~i~2 < 9); {4265#false} is VALID [2018-11-23 12:17:12,771 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:17:12,772 INFO L256 TraceCheckUtils]: 61: Hoare triple {4265#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:17:12,772 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:17:12,772 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:17:12,772 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:17:12,772 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:17:12,772 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:17:12,772 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:17:12,773 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:17:12,773 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:17:12,773 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:17:12,773 INFO L273 TraceCheckUtils]: 71: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:17:12,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {4264#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:17:12,773 INFO L273 TraceCheckUtils]: 73: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:17:12,774 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4264#true} {4265#false} #74#return; {4265#false} is VALID [2018-11-23 12:17:12,774 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:17:12,774 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:17:12,774 INFO L273 TraceCheckUtils]: 77: Hoare triple {4265#false} assume !false; {4265#false} is VALID [2018-11-23 12:17:12,780 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:17:12,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:12,780 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:17:12,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:12,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:17:12,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:12,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:12,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {4264#true} call ULTIMATE.init(); {4264#true} is VALID [2018-11-23 12:17:12,956 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:17:12,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:17:12,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4264#true} {4264#true} #66#return; {4264#true} is VALID [2018-11-23 12:17:12,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {4264#true} call #t~ret12 := main(); {4264#true} is VALID [2018-11-23 12:17:12,957 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:17:12,957 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:17:12,958 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:17:12,958 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:17:12,958 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:17:12,958 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:17:12,959 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:17:12,959 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:17:12,959 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:17:12,959 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:17:12,959 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:17:12,959 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:17:12,960 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:17:12,960 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:17:12,960 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:17:12,960 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:17:12,960 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:17:12,960 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:17:12,961 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:17:12,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {4264#true} assume !(~i~1 < 10); {4264#true} is VALID [2018-11-23 12:17:12,961 INFO L256 TraceCheckUtils]: 25: Hoare triple {4264#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:17:12,961 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:17:12,961 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:17:12,961 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:17:12,961 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:17:12,962 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:17:12,962 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:17:12,962 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:17:12,962 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:17:12,962 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:17:12,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:17:12,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {4264#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:17:12,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:17:12,963 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4264#true} {4264#true} #70#return; {4264#true} is VALID [2018-11-23 12:17:12,963 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:17:12,963 INFO L256 TraceCheckUtils]: 40: Hoare triple {4264#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4264#true} is VALID [2018-11-23 12:17:12,963 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:17:12,963 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:17:12,964 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:17:12,964 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:17:12,964 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:17:12,964 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:17:12,964 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:17:12,964 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:17:12,964 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:17:12,965 INFO L273 TraceCheckUtils]: 50: Hoare triple {4264#true} assume !(~i~0 < 10); {4264#true} is VALID [2018-11-23 12:17:12,965 INFO L273 TraceCheckUtils]: 51: Hoare triple {4264#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4264#true} is VALID [2018-11-23 12:17:12,965 INFO L273 TraceCheckUtils]: 52: Hoare triple {4264#true} assume true; {4264#true} is VALID [2018-11-23 12:17:12,965 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {4264#true} {4264#true} #72#return; {4264#true} is VALID [2018-11-23 12:17:12,967 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:17:12,967 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:17:12,969 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:17:12,969 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:17:12,971 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:17:12,972 INFO L273 TraceCheckUtils]: 59: Hoare triple {4455#(<= main_~i~2 2)} assume !(~i~2 < 9); {4265#false} is VALID [2018-11-23 12:17:12,972 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:17:12,972 INFO L256 TraceCheckUtils]: 61: Hoare triple {4265#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4265#false} is VALID [2018-11-23 12:17:12,972 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:17:12,973 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:17:12,973 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:17:12,973 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:17:12,973 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:17:12,974 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:17:12,974 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:17:12,974 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:17:12,974 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:17:12,975 INFO L273 TraceCheckUtils]: 71: Hoare triple {4265#false} assume !(~i~0 < 10); {4265#false} is VALID [2018-11-23 12:17:12,975 INFO L273 TraceCheckUtils]: 72: Hoare triple {4265#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4265#false} is VALID [2018-11-23 12:17:12,975 INFO L273 TraceCheckUtils]: 73: Hoare triple {4265#false} assume true; {4265#false} is VALID [2018-11-23 12:17:12,975 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4265#false} {4265#false} #74#return; {4265#false} is VALID [2018-11-23 12:17:12,975 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:17:12,976 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:17:12,976 INFO L273 TraceCheckUtils]: 77: Hoare triple {4265#false} assume !false; {4265#false} is VALID [2018-11-23 12:17:12,994 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:17:13,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:13,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:17:13,014 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-11-23 12:17:13,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:13,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:17:13,092 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:17:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:17:13,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:17:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:17:13,093 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 15 states. [2018-11-23 12:17:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:13,785 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-23 12:17:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:17:13,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2018-11-23 12:17:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:17:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2018-11-23 12:17:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:17:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 78 transitions. [2018-11-23 12:17:13,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 78 transitions. [2018-11-23 12:17:13,874 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:17:13,876 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:17:13,876 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:17:13,877 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:17:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:17:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 12:17:13,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:13,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 12:17:13,902 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 12:17:13,902 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 12:17:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:13,904 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-23 12:17:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-23 12:17:13,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:13,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:13,905 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 12:17:13,905 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 12:17:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:13,906 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-23 12:17:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-23 12:17:13,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:13,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:13,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:13,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:17:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-23 12:17:13,909 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 78 [2018-11-23 12:17:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:13,909 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-23 12:17:13,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:17:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:17:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:17:13,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:13,911 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:17:13,911 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:13,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1088178321, now seen corresponding path program 10 times [2018-11-23 12:17:13,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:13,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:13,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:14,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {4839#true} call ULTIMATE.init(); {4839#true} is VALID [2018-11-23 12:17:14,708 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:17:14,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:17:14,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4839#true} {4839#true} #66#return; {4839#true} is VALID [2018-11-23 12:17:14,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {4839#true} call #t~ret12 := main(); {4839#true} is VALID [2018-11-23 12:17:14,709 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:17:14,709 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:17:14,709 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:17:14,709 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:17:14,710 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:17:14,710 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:17:14,710 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:17:14,710 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:17:14,710 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:17:14,711 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:17:14,711 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:17:14,711 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:17:14,711 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:17:14,711 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:17:14,711 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:17:14,712 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:17:14,712 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:17:14,712 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:17:14,712 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:17:14,712 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:17:14,712 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:17:14,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {4839#true} assume !(~i~1 < 10); {4839#true} is VALID [2018-11-23 12:17:14,712 INFO L256 TraceCheckUtils]: 27: Hoare triple {4839#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:17:14,713 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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:14,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {4841#(= sum_~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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:14,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {4841#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4842#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:14,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {4842#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:14,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {4842#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4843#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:14,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {4843#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:14,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {4843#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4844#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:14,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {4844#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:14,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {4844#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4845#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:14,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= sum_~i~0 4)} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:17:14,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {4840#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:17:14,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:17:14,717 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4840#false} {4839#true} #70#return; {4840#false} is VALID [2018-11-23 12:17:14,718 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:17:14,718 INFO L256 TraceCheckUtils]: 42: Hoare triple {4840#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:17:14,718 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:17:14,718 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:17:14,718 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:17:14,719 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:17:14,719 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:17:14,719 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:17:14,719 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:17:14,719 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:17:14,720 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:17:14,720 INFO L273 TraceCheckUtils]: 52: Hoare triple {4839#true} assume !(~i~0 < 10); {4839#true} is VALID [2018-11-23 12:17:14,720 INFO L273 TraceCheckUtils]: 53: Hoare triple {4839#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4839#true} is VALID [2018-11-23 12:17:14,720 INFO L273 TraceCheckUtils]: 54: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:17:14,720 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4839#true} {4840#false} #72#return; {4840#false} is VALID [2018-11-23 12:17:14,721 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:17:14,721 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:17:14,721 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:17:14,721 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:17:14,721 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:17:14,721 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:17:14,722 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:17:14,722 INFO L273 TraceCheckUtils]: 63: Hoare triple {4840#false} assume !(~i~2 < 9); {4840#false} is VALID [2018-11-23 12:17:14,722 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:17:14,722 INFO L256 TraceCheckUtils]: 65: Hoare triple {4840#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:17:14,722 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:17:14,722 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:17:14,722 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:17:14,723 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:17:14,723 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:17:14,723 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:17:14,723 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:17:14,723 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:17:14,723 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:17:14,723 INFO L273 TraceCheckUtils]: 75: Hoare triple {4839#true} assume !(~i~0 < 10); {4839#true} is VALID [2018-11-23 12:17:14,723 INFO L273 TraceCheckUtils]: 76: Hoare triple {4839#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4839#true} is VALID [2018-11-23 12:17:14,723 INFO L273 TraceCheckUtils]: 77: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:17:14,724 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {4839#true} {4840#false} #74#return; {4840#false} is VALID [2018-11-23 12:17:14,724 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:17:14,724 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:17:14,724 INFO L273 TraceCheckUtils]: 81: Hoare triple {4840#false} assume !false; {4840#false} is VALID [2018-11-23 12:17:14,727 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:17:14,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:14,727 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:17:14,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:14,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:14,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:14,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:14,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {4839#true} call ULTIMATE.init(); {4839#true} is VALID [2018-11-23 12:17:14,908 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:17:14,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {4839#true} assume true; {4839#true} is VALID [2018-11-23 12:17:14,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4839#true} {4839#true} #66#return; {4839#true} is VALID [2018-11-23 12:17:14,909 INFO L256 TraceCheckUtils]: 4: Hoare triple {4839#true} call #t~ret12 := main(); {4839#true} is VALID [2018-11-23 12:17:14,909 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:17:14,909 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:17:14,910 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:17:14,910 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:17:14,910 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:17:14,910 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:17:14,910 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:17:14,911 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:17:14,911 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:17:14,911 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:17:14,911 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:17:14,911 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:17:14,911 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:17:14,911 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:17:14,911 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:17:14,912 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:17:14,912 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:17:14,912 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:17:14,912 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:17:14,912 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:17:14,912 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:17:14,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {4839#true} assume !(~i~1 < 10); {4839#true} is VALID [2018-11-23 12:17:14,912 INFO L256 TraceCheckUtils]: 27: Hoare triple {4839#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {4839#true} is VALID [2018-11-23 12:17:14,931 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:14,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {4933#(<= sum_~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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:14,932 INFO L273 TraceCheckUtils]: 30: Hoare triple {4933#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4842#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:14,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {4842#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:14,933 INFO L273 TraceCheckUtils]: 32: Hoare triple {4842#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4843#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:14,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {4843#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:14,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {4843#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4844#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:14,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {4844#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:14,935 INFO L273 TraceCheckUtils]: 36: Hoare triple {4844#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4845#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:14,936 INFO L273 TraceCheckUtils]: 37: Hoare triple {4845#(<= sum_~i~0 4)} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:17:14,936 INFO L273 TraceCheckUtils]: 38: Hoare triple {4840#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:17:14,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:17:14,936 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4840#false} {4839#true} #70#return; {4840#false} is VALID [2018-11-23 12:17:14,936 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:17:14,937 INFO L256 TraceCheckUtils]: 42: Hoare triple {4840#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {4840#false} is VALID [2018-11-23 12:17:14,937 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:17:14,937 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:17:14,937 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:17:14,938 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:17:14,938 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:17:14,938 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:17:14,938 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:17:14,938 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:17:14,939 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:17:14,939 INFO L273 TraceCheckUtils]: 52: Hoare triple {4840#false} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:17:14,939 INFO L273 TraceCheckUtils]: 53: Hoare triple {4840#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:17:14,939 INFO L273 TraceCheckUtils]: 54: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:17:14,939 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4840#false} {4840#false} #72#return; {4840#false} is VALID [2018-11-23 12:17:14,940 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:17:14,940 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:17:14,940 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:17:14,940 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:17:14,940 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:17:14,941 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:17:14,941 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:17:14,941 INFO L273 TraceCheckUtils]: 63: Hoare triple {4840#false} assume !(~i~2 < 9); {4840#false} is VALID [2018-11-23 12:17:14,941 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:17:14,941 INFO L256 TraceCheckUtils]: 65: Hoare triple {4840#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {4840#false} is VALID [2018-11-23 12:17:14,941 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:17:14,941 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:17:14,941 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:17:14,942 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:17:14,942 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:17:14,942 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:17:14,942 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:17:14,942 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:17:14,942 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:17:14,942 INFO L273 TraceCheckUtils]: 75: Hoare triple {4840#false} assume !(~i~0 < 10); {4840#false} is VALID [2018-11-23 12:17:14,942 INFO L273 TraceCheckUtils]: 76: Hoare triple {4840#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4840#false} is VALID [2018-11-23 12:17:14,942 INFO L273 TraceCheckUtils]: 77: Hoare triple {4840#false} assume true; {4840#false} is VALID [2018-11-23 12:17:14,943 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {4840#false} {4840#false} #74#return; {4840#false} is VALID [2018-11-23 12:17:14,943 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:17:14,943 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:17:14,943 INFO L273 TraceCheckUtils]: 81: Hoare triple {4840#false} assume !false; {4840#false} is VALID [2018-11-23 12:17:14,946 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:17:14,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:14,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:17:14,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-11-23 12:17:14,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:14,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:17:15,014 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:17:15,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:17:15,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:17:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:17:15,015 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 8 states. [2018-11-23 12:17:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:15,209 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-23 12:17:15,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:17:15,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-11-23 12:17:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:17:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 12:17:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:17:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 12:17:15,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-23 12:17:15,277 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:17:15,279 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:17:15,279 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:17:15,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:17:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:17:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 12:17:15,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:15,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 12:17:15,437 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 12:17:15,437 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 12:17:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:15,440 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 12:17:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 12:17:15,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:15,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:15,441 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 12:17:15,441 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 12:17:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:15,443 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 12:17:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-23 12:17:15,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:15,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:15,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:15,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:17:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:17:15,446 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 82 [2018-11-23 12:17:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:15,446 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:17:15,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:17:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:17:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 12:17:15,447 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:15,447 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:17:15,448 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:15,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash 678539503, now seen corresponding path program 11 times [2018-11-23 12:17:15,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:15,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:15,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:16,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2018-11-23 12:17:16,391 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:17:16,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:17:16,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #66#return; {5430#true} is VALID [2018-11-23 12:17:16,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret12 := main(); {5430#true} is VALID [2018-11-23 12:17:16,391 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:17:16,392 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:17:16,392 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:17:16,392 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:17:16,392 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:17:16,392 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:17:16,393 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:17:16,393 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:17:16,393 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:17:16,393 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:17:16,393 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:17:16,393 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:17:16,393 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:17:16,393 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:17:16,394 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:17:16,394 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:17:16,394 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:17:16,394 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:17:16,394 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:17:16,394 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:17:16,394 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:17:16,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {5430#true} assume !(~i~1 < 10); {5430#true} is VALID [2018-11-23 12:17:16,394 INFO L256 TraceCheckUtils]: 27: Hoare triple {5430#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:17:16,395 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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:16,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {5432#(= sum_~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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:16,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {5432#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:16,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {5433#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:16,396 INFO L273 TraceCheckUtils]: 32: Hoare triple {5433#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5434#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:16,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {5434#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:16,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {5434#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5435#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:16,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {5435#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:16,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {5435#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5436#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:16,399 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:16,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:16,401 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= sum_~i~0 5)} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:17:16,401 INFO L273 TraceCheckUtils]: 40: Hoare triple {5431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:17:16,401 INFO L273 TraceCheckUtils]: 41: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:17:16,401 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5431#false} {5430#true} #70#return; {5431#false} is VALID [2018-11-23 12:17:16,401 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:17:16,402 INFO L256 TraceCheckUtils]: 44: Hoare triple {5431#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:17:16,402 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:17:16,402 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:17:16,402 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:17:16,402 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:17:16,403 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:17:16,403 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:17:16,403 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:17:16,403 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:17:16,403 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:17:16,404 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:17:16,404 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:17:16,404 INFO L273 TraceCheckUtils]: 56: Hoare triple {5430#true} assume !(~i~0 < 10); {5430#true} is VALID [2018-11-23 12:17:16,404 INFO L273 TraceCheckUtils]: 57: Hoare triple {5430#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5430#true} is VALID [2018-11-23 12:17:16,404 INFO L273 TraceCheckUtils]: 58: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:17:16,404 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {5430#true} {5431#false} #72#return; {5431#false} is VALID [2018-11-23 12:17:16,404 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:17:16,404 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:17:16,404 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:17:16,405 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:17:16,405 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:17:16,405 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:17:16,405 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:17:16,405 INFO L273 TraceCheckUtils]: 67: Hoare triple {5431#false} assume !(~i~2 < 9); {5431#false} is VALID [2018-11-23 12:17:16,405 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:17:16,405 INFO L256 TraceCheckUtils]: 69: Hoare triple {5431#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:17:16,405 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:17:16,406 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:17:16,406 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:17:16,406 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:17:16,406 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:17:16,406 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:17:16,406 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:17:16,406 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:17:16,406 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:17:16,407 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:17:16,407 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:17:16,407 INFO L273 TraceCheckUtils]: 81: Hoare triple {5430#true} assume !(~i~0 < 10); {5430#true} is VALID [2018-11-23 12:17:16,407 INFO L273 TraceCheckUtils]: 82: Hoare triple {5430#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5430#true} is VALID [2018-11-23 12:17:16,407 INFO L273 TraceCheckUtils]: 83: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:17:16,407 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {5430#true} {5431#false} #74#return; {5431#false} is VALID [2018-11-23 12:17:16,407 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:17:16,407 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:17:16,408 INFO L273 TraceCheckUtils]: 87: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2018-11-23 12:17:16,411 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:17:16,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:16,411 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:17:16,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:16,652 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:17:16,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:16,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:16,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5430#true} is VALID [2018-11-23 12:17:16,775 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:17:16,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2018-11-23 12:17:16,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #66#return; {5430#true} is VALID [2018-11-23 12:17:16,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret12 := main(); {5430#true} is VALID [2018-11-23 12:17:16,776 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:17:16,776 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:17:16,776 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:17:16,777 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:17:16,777 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:17:16,777 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:17:16,777 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:17:16,777 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:17:16,777 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:17:16,777 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:17:16,777 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:17:16,778 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:17:16,778 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:17:16,778 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:17:16,778 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:17:16,778 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:17:16,778 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:17:16,778 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:17:16,779 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:17:16,779 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:17:16,779 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:17:16,779 INFO L273 TraceCheckUtils]: 26: Hoare triple {5430#true} assume !(~i~1 < 10); {5430#true} is VALID [2018-11-23 12:17:16,779 INFO L256 TraceCheckUtils]: 27: Hoare triple {5430#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {5430#true} is VALID [2018-11-23 12:17:16,780 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:16,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {5525#(<= sum_~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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:16,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {5525#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:16,781 INFO L273 TraceCheckUtils]: 31: Hoare triple {5433#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:16,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {5433#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5434#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:16,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {5434#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:16,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {5434#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5435#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:16,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {5435#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:16,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {5435#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5436#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:16,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {5436#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:16,785 INFO L273 TraceCheckUtils]: 38: Hoare triple {5436#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:16,786 INFO L273 TraceCheckUtils]: 39: Hoare triple {5437#(<= sum_~i~0 5)} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:17:16,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {5431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:17:16,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:17:16,786 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5431#false} {5430#true} #70#return; {5431#false} is VALID [2018-11-23 12:17:16,786 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:17:16,787 INFO L256 TraceCheckUtils]: 44: Hoare triple {5431#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {5431#false} is VALID [2018-11-23 12:17:16,787 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:17:16,787 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:17:16,787 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:17:16,787 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:17:16,787 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:17:16,788 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:17:16,788 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:17:16,788 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:17:16,788 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:17:16,788 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:17:16,788 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:17:16,788 INFO L273 TraceCheckUtils]: 56: Hoare triple {5431#false} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:17:16,788 INFO L273 TraceCheckUtils]: 57: Hoare triple {5431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:17:16,789 INFO L273 TraceCheckUtils]: 58: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:17:16,789 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {5431#false} {5431#false} #72#return; {5431#false} is VALID [2018-11-23 12:17:16,789 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:17:16,789 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:17:16,789 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:17:16,789 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:17:16,789 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:17:16,789 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:17:16,789 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:17:16,790 INFO L273 TraceCheckUtils]: 67: Hoare triple {5431#false} assume !(~i~2 < 9); {5431#false} is VALID [2018-11-23 12:17:16,790 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:17:16,790 INFO L256 TraceCheckUtils]: 69: Hoare triple {5431#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {5431#false} is VALID [2018-11-23 12:17:16,790 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:17:16,790 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:17:16,791 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:17:16,791 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:17:16,791 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:17:16,791 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:17:16,791 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:17:16,791 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:17:16,792 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:17:16,792 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:17:16,792 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:17:16,792 INFO L273 TraceCheckUtils]: 81: Hoare triple {5431#false} assume !(~i~0 < 10); {5431#false} is VALID [2018-11-23 12:17:16,792 INFO L273 TraceCheckUtils]: 82: Hoare triple {5431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5431#false} is VALID [2018-11-23 12:17:16,793 INFO L273 TraceCheckUtils]: 83: Hoare triple {5431#false} assume true; {5431#false} is VALID [2018-11-23 12:17:16,793 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {5431#false} {5431#false} #74#return; {5431#false} is VALID [2018-11-23 12:17:16,793 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:17:16,793 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:17:16,793 INFO L273 TraceCheckUtils]: 87: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2018-11-23 12:17:16,797 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:17:16,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:16,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:17:16,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-23 12:17:16,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:16,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:17:16,915 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:17:16,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:17:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:17:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:16,916 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 9 states. [2018-11-23 12:17:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:17,127 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-23 12:17:17,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:17:17,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-11-23 12:17:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 12:17:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 12:17:17,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2018-11-23 12:17:17,702 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:17:17,705 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:17:17,705 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:17:17,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:17:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 12:17:17,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:17,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 12:17:17,735 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 12:17:17,735 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 12:17:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:17,738 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 12:17:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 12:17:17,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:17,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:17,739 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 12:17:17,739 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 12:17:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:17,740 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-11-23 12:17:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-23 12:17:17,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:17,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:17,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:17,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:17:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-11-23 12:17:17,743 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 88 [2018-11-23 12:17:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:17,743 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-23 12:17:17,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:17:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:17:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:17:17,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:17,744 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:17:17,745 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:17,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:17,745 INFO L82 PathProgramCache]: Analyzing trace with hash 338893517, now seen corresponding path program 12 times [2018-11-23 12:17:17,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:17,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:17,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:17,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:17,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:17,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {6053#true} call ULTIMATE.init(); {6053#true} is VALID [2018-11-23 12:17:17,914 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:17:17,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:17:17,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6053#true} {6053#true} #66#return; {6053#true} is VALID [2018-11-23 12:17:17,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {6053#true} call #t~ret12 := main(); {6053#true} is VALID [2018-11-23 12:17:17,915 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:17:17,915 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:17:17,915 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:17:17,915 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:17:17,915 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:17:17,916 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:17:17,916 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:17:17,916 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:17:17,916 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:17:17,916 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:17:17,916 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:17:17,917 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:17:17,917 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:17:17,917 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:17:17,917 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:17:17,917 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:17:17,917 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:17:17,917 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:17:17,917 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:17:17,917 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:17:17,918 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:17:17,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {6053#true} assume !(~i~1 < 10); {6053#true} is VALID [2018-11-23 12:17:17,918 INFO L256 TraceCheckUtils]: 27: Hoare triple {6053#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:17:17,918 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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:17,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {6055#(= sum_~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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:17,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {6055#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6056#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:17,919 INFO L273 TraceCheckUtils]: 31: Hoare triple {6056#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:17,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {6056#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6057#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:17,920 INFO L273 TraceCheckUtils]: 33: Hoare triple {6057#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:17,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {6057#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6058#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:17,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {6058#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:17,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {6058#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6059#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:17,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {6059#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:17,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {6059#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6060#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:17,923 INFO L273 TraceCheckUtils]: 39: Hoare triple {6060#(<= sum_~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#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {6060#(<= sum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6061#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {6061#(<= sum_~i~0 6)} assume !(~i~0 < 10); {6054#false} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 42: Hoare triple {6054#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6054#false} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 43: Hoare triple {6054#false} assume true; {6054#false} is VALID [2018-11-23 12:17:17,925 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6054#false} {6053#true} #70#return; {6054#false} is VALID [2018-11-23 12:17:17,926 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:17:17,926 INFO L256 TraceCheckUtils]: 46: Hoare triple {6054#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:17:17,926 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:17:17,926 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:17:17,927 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:17:17,927 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:17:17,927 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:17:17,927 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:17:17,927 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:17:17,928 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:17:17,928 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:17:17,928 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:17:17,928 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:17:17,928 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:17:17,929 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:17:17,929 INFO L273 TraceCheckUtils]: 60: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:17:17,929 INFO L273 TraceCheckUtils]: 61: Hoare triple {6053#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:17:17,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:17:17,929 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6053#true} {6054#false} #72#return; {6054#false} is VALID [2018-11-23 12:17:17,929 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:17:17,930 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:17:17,930 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:17:17,930 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:17:17,930 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:17:17,930 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:17:17,930 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:17:17,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {6054#false} assume !(~i~2 < 9); {6054#false} is VALID [2018-11-23 12:17:17,930 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:17:17,931 INFO L256 TraceCheckUtils]: 73: Hoare triple {6054#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:17:17,931 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:17:17,931 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:17:17,931 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:17:17,931 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:17:17,931 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:17:17,931 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:17:17,931 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:17:17,931 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:17:17,932 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:17:17,932 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:17:17,932 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:17:17,932 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:17:17,932 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:17:17,932 INFO L273 TraceCheckUtils]: 87: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:17:17,932 INFO L273 TraceCheckUtils]: 88: Hoare triple {6053#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:17:17,932 INFO L273 TraceCheckUtils]: 89: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:17:17,933 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {6053#true} {6054#false} #74#return; {6054#false} is VALID [2018-11-23 12:17:17,933 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:17:17,933 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:17:17,933 INFO L273 TraceCheckUtils]: 93: Hoare triple {6054#false} assume !false; {6054#false} is VALID [2018-11-23 12:17:17,937 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:17:17,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:17,938 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:17:17,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:17:18,083 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:17:18,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:18,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:18,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {6053#true} call ULTIMATE.init(); {6053#true} is VALID [2018-11-23 12:17:18,278 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:17:18,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:17:18,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6053#true} {6053#true} #66#return; {6053#true} is VALID [2018-11-23 12:17:18,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {6053#true} call #t~ret12 := main(); {6053#true} is VALID [2018-11-23 12:17:18,279 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:17:18,279 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:17:18,280 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:17:18,280 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:17:18,280 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:17:18,280 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:17:18,280 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:17:18,280 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:17:18,280 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:17:18,281 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:17:18,281 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:17:18,281 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:17:18,281 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:17:18,281 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:17:18,281 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:17:18,281 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:17:18,281 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:17:18,281 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:17:18,282 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:17:18,282 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:17:18,282 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:17:18,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {6053#true} assume !(~i~1 < 10); {6053#true} is VALID [2018-11-23 12:17:18,282 INFO L256 TraceCheckUtils]: 27: Hoare triple {6053#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:17:18,282 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:17:18,282 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:17:18,282 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:17:18,283 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:17:18,283 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:17:18,283 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:17:18,283 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:17:18,283 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:17:18,283 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:17:18,283 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:17:18,283 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:17:18,284 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:17:18,284 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:17:18,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:17:18,284 INFO L273 TraceCheckUtils]: 42: Hoare triple {6053#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:17:18,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:17:18,284 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6053#true} {6053#true} #70#return; {6053#true} is VALID [2018-11-23 12:17:18,284 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:17:18,284 INFO L256 TraceCheckUtils]: 46: Hoare triple {6053#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {6053#true} is VALID [2018-11-23 12:17:18,284 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:17:18,285 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:17:18,285 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:17:18,285 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:17:18,285 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:17:18,285 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:17:18,285 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:17:18,285 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:17:18,285 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:17:18,286 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:17:18,286 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:17:18,286 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:17:18,286 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:17:18,286 INFO L273 TraceCheckUtils]: 60: Hoare triple {6053#true} assume !(~i~0 < 10); {6053#true} is VALID [2018-11-23 12:17:18,286 INFO L273 TraceCheckUtils]: 61: Hoare triple {6053#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6053#true} is VALID [2018-11-23 12:17:18,286 INFO L273 TraceCheckUtils]: 62: Hoare triple {6053#true} assume true; {6053#true} is VALID [2018-11-23 12:17:18,286 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {6053#true} {6053#true} #72#return; {6053#true} is VALID [2018-11-23 12:17:18,287 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:17:18,287 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:17:18,288 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:17:18,288 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:17:18,289 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:17:18,289 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:17:18,290 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:17:18,291 INFO L273 TraceCheckUtils]: 71: Hoare triple {6278#(<= main_~i~2 3)} assume !(~i~2 < 9); {6054#false} is VALID [2018-11-23 12:17:18,291 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:17:18,291 INFO L256 TraceCheckUtils]: 73: Hoare triple {6054#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {6054#false} is VALID [2018-11-23 12:17:18,291 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:17:18,291 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:17:18,292 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:17:18,292 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:17:18,292 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:17:18,292 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:17:18,292 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:17:18,293 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:17:18,293 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:17:18,293 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:17:18,293 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:17:18,293 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:17:18,294 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:17:18,294 INFO L273 TraceCheckUtils]: 87: Hoare triple {6054#false} assume !(~i~0 < 10); {6054#false} is VALID [2018-11-23 12:17:18,294 INFO L273 TraceCheckUtils]: 88: Hoare triple {6054#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6054#false} is VALID [2018-11-23 12:17:18,294 INFO L273 TraceCheckUtils]: 89: Hoare triple {6054#false} assume true; {6054#false} is VALID [2018-11-23 12:17:18,294 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {6054#false} {6054#false} #74#return; {6054#false} is VALID [2018-11-23 12:17:18,294 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:17:18,294 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:17:18,295 INFO L273 TraceCheckUtils]: 93: Hoare triple {6054#false} assume !false; {6054#false} is VALID [2018-11-23 12:17:18,298 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:17:18,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:18,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 12:17:18,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-23 12:17:18,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:18,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:17:18,378 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:17:18,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:17:18,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:17:18,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:17:18,379 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 13 states. [2018-11-23 12:17:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:18,950 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-23 12:17:18,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:17:18,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-23 12:17:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:17:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-23 12:17:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:17:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-23 12:17:18,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 76 transitions. [2018-11-23 12:17:19,629 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:17:19,631 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:17:19,631 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 12:17:19,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:17:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 12:17:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-23 12:17:19,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:19,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 65 states. [2018-11-23 12:17:19,657 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 65 states. [2018-11-23 12:17:19,657 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 65 states. [2018-11-23 12:17:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:19,660 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 12:17:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:17:19,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:19,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:19,661 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 67 states. [2018-11-23 12:17:19,661 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 67 states. [2018-11-23 12:17:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:19,663 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 12:17:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:17:19,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:19,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:19,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:19,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:17:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-23 12:17:19,666 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 94 [2018-11-23 12:17:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:19,666 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-23 12:17:19,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:17:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:17:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 12:17:19,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:19,667 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:17:19,667 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:19,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash 728112553, now seen corresponding path program 13 times [2018-11-23 12:17:19,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:19,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:19,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:19,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:20,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {6724#true} call ULTIMATE.init(); {6724#true} is VALID [2018-11-23 12:17:20,293 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:17:20,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:17:20,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6724#true} {6724#true} #66#return; {6724#true} is VALID [2018-11-23 12:17:20,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {6724#true} call #t~ret12 := main(); {6724#true} is VALID [2018-11-23 12:17:20,294 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:17:20,294 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:17:20,294 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:17:20,295 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:17:20,295 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:17:20,295 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:17:20,295 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:17:20,295 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:17:20,295 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:17:20,295 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:17:20,295 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:17:20,296 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:17:20,296 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:17:20,296 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:17:20,296 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:17:20,296 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:17:20,296 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:17:20,296 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:17:20,296 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:17:20,297 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:17:20,297 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:17:20,297 INFO L273 TraceCheckUtils]: 26: Hoare triple {6724#true} assume !(~i~1 < 10); {6724#true} is VALID [2018-11-23 12:17:20,297 INFO L256 TraceCheckUtils]: 27: Hoare triple {6724#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:17:20,297 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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:20,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {6726#(= sum_~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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:20,298 INFO L273 TraceCheckUtils]: 30: Hoare triple {6726#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6727#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:20,298 INFO L273 TraceCheckUtils]: 31: Hoare triple {6727#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:20,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {6727#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6728#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:20,299 INFO L273 TraceCheckUtils]: 33: Hoare triple {6728#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:20,300 INFO L273 TraceCheckUtils]: 34: Hoare triple {6728#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6729#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:20,300 INFO L273 TraceCheckUtils]: 35: Hoare triple {6729#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:20,301 INFO L273 TraceCheckUtils]: 36: Hoare triple {6729#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6730#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:20,302 INFO L273 TraceCheckUtils]: 37: Hoare triple {6730#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:20,302 INFO L273 TraceCheckUtils]: 38: Hoare triple {6730#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6731#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:20,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {6731#(<= sum_~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#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:20,304 INFO L273 TraceCheckUtils]: 40: Hoare triple {6731#(<= sum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6732#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:20,304 INFO L273 TraceCheckUtils]: 41: Hoare triple {6732#(<= sum_~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#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:20,305 INFO L273 TraceCheckUtils]: 42: Hoare triple {6732#(<= sum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6733#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:20,306 INFO L273 TraceCheckUtils]: 43: Hoare triple {6733#(<= sum_~i~0 7)} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:17:20,306 INFO L273 TraceCheckUtils]: 44: Hoare triple {6725#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:17:20,306 INFO L273 TraceCheckUtils]: 45: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:17:20,306 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {6725#false} {6724#true} #70#return; {6725#false} is VALID [2018-11-23 12:17:20,306 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:17:20,307 INFO L256 TraceCheckUtils]: 48: Hoare triple {6725#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:17:20,307 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:17:20,307 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:17:20,307 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:17:20,307 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:17:20,308 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:17:20,308 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:17:20,308 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:17:20,308 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:17:20,309 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:17:20,309 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:17:20,309 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:17:20,309 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:17:20,309 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:17:20,309 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:17:20,310 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:17:20,310 INFO L273 TraceCheckUtils]: 64: Hoare triple {6724#true} assume !(~i~0 < 10); {6724#true} is VALID [2018-11-23 12:17:20,310 INFO L273 TraceCheckUtils]: 65: Hoare triple {6724#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6724#true} is VALID [2018-11-23 12:17:20,310 INFO L273 TraceCheckUtils]: 66: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:17:20,311 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {6724#true} {6725#false} #72#return; {6725#false} is VALID [2018-11-23 12:17:20,311 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:17:20,311 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:17:20,311 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:17:20,311 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:17:20,311 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:17:20,311 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:17:20,311 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:17:20,312 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:17:20,312 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:17:20,312 INFO L273 TraceCheckUtils]: 77: Hoare triple {6725#false} assume !(~i~2 < 9); {6725#false} is VALID [2018-11-23 12:17:20,312 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:17:20,312 INFO L256 TraceCheckUtils]: 79: Hoare triple {6725#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:17:20,312 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:17:20,312 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:17:20,312 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:17:20,312 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:17:20,313 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:17:20,313 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:17:20,313 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:17:20,313 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:17:20,313 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:17:20,313 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:17:20,313 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:17:20,313 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:17:20,314 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:17:20,314 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:17:20,314 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:17:20,314 INFO L273 TraceCheckUtils]: 95: Hoare triple {6724#true} assume !(~i~0 < 10); {6724#true} is VALID [2018-11-23 12:17:20,314 INFO L273 TraceCheckUtils]: 96: Hoare triple {6724#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6724#true} is VALID [2018-11-23 12:17:20,314 INFO L273 TraceCheckUtils]: 97: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:17:20,314 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {6724#true} {6725#false} #74#return; {6725#false} is VALID [2018-11-23 12:17:20,314 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:17:20,314 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:17:20,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {6725#false} assume !false; {6725#false} is VALID [2018-11-23 12:17:20,319 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:17:20,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:20,319 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:17:20,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:20,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:20,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {6724#true} call ULTIMATE.init(); {6724#true} is VALID [2018-11-23 12:17:20,728 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:17:20,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {6724#true} assume true; {6724#true} is VALID [2018-11-23 12:17:20,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6724#true} {6724#true} #66#return; {6724#true} is VALID [2018-11-23 12:17:20,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {6724#true} call #t~ret12 := main(); {6724#true} is VALID [2018-11-23 12:17:20,729 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:17:20,729 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:17:20,729 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:17:20,729 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:17:20,730 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:17:20,730 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:17:20,730 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:17:20,730 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:17:20,730 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:17:20,730 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:17:20,730 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:17:20,730 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:17:20,730 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:17:20,731 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:17:20,731 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:17:20,731 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:17:20,731 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:17:20,731 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:17:20,731 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:17:20,731 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:17:20,731 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:17:20,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {6724#true} assume !(~i~1 < 10); {6724#true} is VALID [2018-11-23 12:17:20,732 INFO L256 TraceCheckUtils]: 27: Hoare triple {6724#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {6724#true} is VALID [2018-11-23 12:17:20,732 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:20,732 INFO L273 TraceCheckUtils]: 29: Hoare triple {6821#(<= sum_~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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:20,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {6821#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6727#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:20,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {6727#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:20,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {6727#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6728#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:20,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {6728#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:20,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {6728#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6729#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:20,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {6729#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:20,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {6729#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6730#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:20,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {6730#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:20,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {6730#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6731#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:20,738 INFO L273 TraceCheckUtils]: 39: Hoare triple {6731#(<= sum_~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#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:20,738 INFO L273 TraceCheckUtils]: 40: Hoare triple {6731#(<= sum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6732#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:20,739 INFO L273 TraceCheckUtils]: 41: Hoare triple {6732#(<= sum_~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#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:20,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {6732#(<= sum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6733#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:20,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {6733#(<= sum_~i~0 7)} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:17:20,741 INFO L273 TraceCheckUtils]: 44: Hoare triple {6725#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:17:20,741 INFO L273 TraceCheckUtils]: 45: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:17:20,741 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {6725#false} {6724#true} #70#return; {6725#false} is VALID [2018-11-23 12:17:20,741 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:17:20,742 INFO L256 TraceCheckUtils]: 48: Hoare triple {6725#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {6725#false} is VALID [2018-11-23 12:17:20,742 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:17:20,742 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:17:20,742 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:17:20,742 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:17:20,743 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:17:20,743 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:17:20,743 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:17:20,743 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:17:20,743 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:17:20,744 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:17:20,744 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:17:20,744 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:17:20,744 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:17:20,744 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:17:20,745 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:17:20,745 INFO L273 TraceCheckUtils]: 64: Hoare triple {6725#false} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:17:20,745 INFO L273 TraceCheckUtils]: 65: Hoare triple {6725#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:17:20,745 INFO L273 TraceCheckUtils]: 66: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:17:20,745 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {6725#false} {6725#false} #72#return; {6725#false} is VALID [2018-11-23 12:17:20,746 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:17:20,746 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:17:20,746 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:17:20,746 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:17:20,746 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:17:20,746 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:17:20,746 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:17:20,746 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:17:20,746 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:17:20,747 INFO L273 TraceCheckUtils]: 77: Hoare triple {6725#false} assume !(~i~2 < 9); {6725#false} is VALID [2018-11-23 12:17:20,747 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:17:20,747 INFO L256 TraceCheckUtils]: 79: Hoare triple {6725#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {6725#false} is VALID [2018-11-23 12:17:20,747 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:17:20,747 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:17:20,747 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:17:20,747 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:17:20,747 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:17:20,748 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:17:20,748 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:17:20,748 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:17:20,748 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:17:20,748 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:17:20,748 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:17:20,748 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:17:20,748 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:17:20,748 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:17:20,749 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:17:20,749 INFO L273 TraceCheckUtils]: 95: Hoare triple {6725#false} assume !(~i~0 < 10); {6725#false} is VALID [2018-11-23 12:17:20,749 INFO L273 TraceCheckUtils]: 96: Hoare triple {6725#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6725#false} is VALID [2018-11-23 12:17:20,749 INFO L273 TraceCheckUtils]: 97: Hoare triple {6725#false} assume true; {6725#false} is VALID [2018-11-23 12:17:20,749 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {6725#false} {6725#false} #74#return; {6725#false} is VALID [2018-11-23 12:17:20,749 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:17:20,749 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:17:20,749 INFO L273 TraceCheckUtils]: 101: Hoare triple {6725#false} assume !false; {6725#false} is VALID [2018-11-23 12:17:20,755 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:17:20,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:20,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:17:20,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-11-23 12:17:20,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:20,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:17:20,894 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:17:20,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:17:20,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:17:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:20,895 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 11 states. [2018-11-23 12:17:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:21,176 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-11-23 12:17:21,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:17:21,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-11-23 12:17:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 12:17:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2018-11-23 12:17:21,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2018-11-23 12:17:21,289 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:17:21,292 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:17:21,292 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 12:17:21,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 12:17:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 12:17:21,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:21,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 67 states. [2018-11-23 12:17:21,322 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 67 states. [2018-11-23 12:17:21,322 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 67 states. [2018-11-23 12:17:21,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:21,325 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 12:17:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 12:17:21,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:21,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:21,326 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 68 states. [2018-11-23 12:17:21,326 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 68 states. [2018-11-23 12:17:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:21,328 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-23 12:17:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-23 12:17:21,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:21,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:21,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:21,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:17:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:17:21,332 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 102 [2018-11-23 12:17:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:21,332 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:17:21,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:17:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:17:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:17:21,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:21,334 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:17:21,334 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:21,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:21,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1362260743, now seen corresponding path program 14 times [2018-11-23 12:17:21,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:22,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {7430#true} call ULTIMATE.init(); {7430#true} is VALID [2018-11-23 12:17:22,424 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:17:22,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:17:22,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7430#true} {7430#true} #66#return; {7430#true} is VALID [2018-11-23 12:17:22,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {7430#true} call #t~ret12 := main(); {7430#true} is VALID [2018-11-23 12:17:22,425 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:17:22,425 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:17:22,425 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:17:22,426 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:17:22,426 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:17:22,426 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:17:22,426 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:17:22,427 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:17:22,427 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:17:22,427 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:17:22,427 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:17:22,428 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:17:22,428 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:17:22,428 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:17:22,428 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:17:22,428 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:17:22,428 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:17:22,429 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:17:22,429 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:17:22,429 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:17:22,429 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:17:22,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {7430#true} assume !(~i~1 < 10); {7430#true} is VALID [2018-11-23 12:17:22,429 INFO L256 TraceCheckUtils]: 27: Hoare triple {7430#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:17:22,430 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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:22,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {7432#(= sum_~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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:22,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {7432#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7433#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:22,431 INFO L273 TraceCheckUtils]: 31: Hoare triple {7433#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:22,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {7433#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7434#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:22,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {7434#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:22,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {7434#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7435#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:22,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {7435#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:22,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {7435#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7436#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:22,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {7436#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:22,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {7436#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7437#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:22,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {7437#(<= sum_~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#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:22,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {7437#(<= sum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7438#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:22,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {7438#(<= sum_~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#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:22,437 INFO L273 TraceCheckUtils]: 42: Hoare triple {7438#(<= sum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7439#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:22,438 INFO L273 TraceCheckUtils]: 43: Hoare triple {7439#(<= sum_~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#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:22,439 INFO L273 TraceCheckUtils]: 44: Hoare triple {7439#(<= sum_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7440#(<= sum_~i~0 8)} is VALID [2018-11-23 12:17:22,440 INFO L273 TraceCheckUtils]: 45: Hoare triple {7440#(<= sum_~i~0 8)} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:17:22,440 INFO L273 TraceCheckUtils]: 46: Hoare triple {7431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:17:22,440 INFO L273 TraceCheckUtils]: 47: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:17:22,440 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {7431#false} {7430#true} #70#return; {7431#false} is VALID [2018-11-23 12:17:22,441 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:17:22,441 INFO L256 TraceCheckUtils]: 50: Hoare triple {7431#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:17:22,441 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:17:22,441 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:17:22,442 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:17:22,442 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:17:22,442 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:17:22,442 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:17:22,443 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:17:22,443 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:17:22,443 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:17:22,443 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:17:22,443 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:17:22,443 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:17:22,444 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:17:22,444 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:17:22,444 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:17:22,444 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:17:22,444 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:17:22,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {7430#true} assume !(~i~0 < 10); {7430#true} is VALID [2018-11-23 12:17:22,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {7430#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7430#true} is VALID [2018-11-23 12:17:22,445 INFO L273 TraceCheckUtils]: 70: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:17:22,445 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {7430#true} {7431#false} #72#return; {7431#false} is VALID [2018-11-23 12:17:22,445 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:17:22,445 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:17:22,445 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:17:22,445 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:17:22,446 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:17:22,446 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:17:22,446 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:17:22,446 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:17:22,446 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:17:22,446 INFO L273 TraceCheckUtils]: 81: Hoare triple {7431#false} assume !(~i~2 < 9); {7431#false} is VALID [2018-11-23 12:17:22,446 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:17:22,447 INFO L256 TraceCheckUtils]: 83: Hoare triple {7431#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:17:22,447 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:17:22,447 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:17:22,447 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:17:22,447 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:17:22,447 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:17:22,448 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:17:22,448 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:17:22,448 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:17:22,448 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:17:22,448 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:17:22,448 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:17:22,448 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:17:22,449 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:17:22,449 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:17:22,449 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:17:22,449 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:17:22,449 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:17:22,449 INFO L273 TraceCheckUtils]: 101: Hoare triple {7430#true} assume !(~i~0 < 10); {7430#true} is VALID [2018-11-23 12:17:22,450 INFO L273 TraceCheckUtils]: 102: Hoare triple {7430#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7430#true} is VALID [2018-11-23 12:17:22,450 INFO L273 TraceCheckUtils]: 103: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:17:22,450 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7430#true} {7431#false} #74#return; {7431#false} is VALID [2018-11-23 12:17:22,450 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:17:22,450 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:17:22,450 INFO L273 TraceCheckUtils]: 107: Hoare triple {7431#false} assume !false; {7431#false} is VALID [2018-11-23 12:17:22,461 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:17:22,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:22,461 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:17:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:22,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:22,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:22,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:22,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {7430#true} call ULTIMATE.init(); {7430#true} is VALID [2018-11-23 12:17:22,783 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:17:22,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {7430#true} assume true; {7430#true} is VALID [2018-11-23 12:17:22,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7430#true} {7430#true} #66#return; {7430#true} is VALID [2018-11-23 12:17:22,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {7430#true} call #t~ret12 := main(); {7430#true} is VALID [2018-11-23 12:17:22,784 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:17:22,784 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:17:22,785 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:17:22,785 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:17:22,785 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:17:22,785 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:17:22,785 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:17:22,786 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:17:22,786 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:17:22,786 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:17:22,786 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:17:22,786 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:17:22,786 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:17:22,786 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:17:22,786 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:17:22,786 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:17:22,787 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:17:22,787 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:17:22,787 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:17:22,787 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:17:22,787 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:17:22,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {7430#true} assume !(~i~1 < 10); {7430#true} is VALID [2018-11-23 12:17:22,787 INFO L256 TraceCheckUtils]: 27: Hoare triple {7430#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {7430#true} is VALID [2018-11-23 12:17:22,788 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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:22,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {7528#(<= sum_~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#(<= sum_~i~0 0)} is VALID [2018-11-23 12:17:22,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {7528#(<= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7433#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:22,789 INFO L273 TraceCheckUtils]: 31: Hoare triple {7433#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:22,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {7433#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7434#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:22,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {7434#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:22,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {7434#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7435#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:22,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {7435#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:22,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {7435#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7436#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:22,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {7436#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:22,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {7436#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7437#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:22,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {7437#(<= sum_~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#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:22,795 INFO L273 TraceCheckUtils]: 40: Hoare triple {7437#(<= sum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7438#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:22,795 INFO L273 TraceCheckUtils]: 41: Hoare triple {7438#(<= sum_~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#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:22,796 INFO L273 TraceCheckUtils]: 42: Hoare triple {7438#(<= sum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7439#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:22,796 INFO L273 TraceCheckUtils]: 43: Hoare triple {7439#(<= sum_~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#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:22,796 INFO L273 TraceCheckUtils]: 44: Hoare triple {7439#(<= sum_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7440#(<= sum_~i~0 8)} is VALID [2018-11-23 12:17:22,797 INFO L273 TraceCheckUtils]: 45: Hoare triple {7440#(<= sum_~i~0 8)} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:17:22,797 INFO L273 TraceCheckUtils]: 46: Hoare triple {7431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:17:22,797 INFO L273 TraceCheckUtils]: 47: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:17:22,798 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {7431#false} {7430#true} #70#return; {7431#false} is VALID [2018-11-23 12:17:22,798 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:17:22,798 INFO L256 TraceCheckUtils]: 50: Hoare triple {7431#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {7431#false} is VALID [2018-11-23 12:17:22,798 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:17:22,798 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:17:22,799 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:17:22,799 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:17:22,799 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:17:22,799 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:17:22,799 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:17:22,800 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:17:22,800 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:17:22,800 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:17:22,800 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:17:22,800 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:17:22,801 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:17:22,801 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:17:22,801 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:17:22,801 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:17:22,801 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:17:22,801 INFO L273 TraceCheckUtils]: 68: Hoare triple {7431#false} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:17:22,802 INFO L273 TraceCheckUtils]: 69: Hoare triple {7431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:17:22,802 INFO L273 TraceCheckUtils]: 70: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:17:22,802 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {7431#false} {7431#false} #72#return; {7431#false} is VALID [2018-11-23 12:17:22,802 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:17:22,802 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:17:22,802 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:17:22,802 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:17:22,802 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:17:22,803 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:17:22,803 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:17:22,803 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:17:22,803 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:17:22,803 INFO L273 TraceCheckUtils]: 81: Hoare triple {7431#false} assume !(~i~2 < 9); {7431#false} is VALID [2018-11-23 12:17:22,803 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:17:22,803 INFO L256 TraceCheckUtils]: 83: Hoare triple {7431#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {7431#false} is VALID [2018-11-23 12:17:22,803 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:17:22,803 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:17:22,804 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:17:22,804 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:17:22,804 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:17:22,804 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:17:22,804 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:17:22,804 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:17:22,804 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:17:22,804 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:17:22,804 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:17:22,805 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:17:22,805 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:17:22,805 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:17:22,805 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:17:22,805 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:17:22,805 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:17:22,805 INFO L273 TraceCheckUtils]: 101: Hoare triple {7431#false} assume !(~i~0 < 10); {7431#false} is VALID [2018-11-23 12:17:22,805 INFO L273 TraceCheckUtils]: 102: Hoare triple {7431#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7431#false} is VALID [2018-11-23 12:17:22,805 INFO L273 TraceCheckUtils]: 103: Hoare triple {7431#false} assume true; {7431#false} is VALID [2018-11-23 12:17:22,806 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {7431#false} {7431#false} #74#return; {7431#false} is VALID [2018-11-23 12:17:22,806 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:17:22,806 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:17:22,806 INFO L273 TraceCheckUtils]: 107: Hoare triple {7431#false} assume !false; {7431#false} is VALID [2018-11-23 12:17:22,811 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:17:22,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:17:22,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-11-23 12:17:22,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:22,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:17:22,891 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:17:22,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:17:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:17:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:22,892 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 12 states. [2018-11-23 12:17:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:23,120 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-11-23 12:17:23,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:17:23,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2018-11-23 12:17:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:17:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:17:23,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:17:23,616 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:17:23,618 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:17:23,618 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:17:23,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 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:17:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:17:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:17:23,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:23,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:17:23,702 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:17:23,702 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:17:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:23,704 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:17:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:17:23,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:23,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:23,705 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:17:23,705 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:17:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:23,706 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:17:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:17:23,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:23,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:23,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:23,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:17:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:17:23,708 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 108 [2018-11-23 12:17:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:23,709 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:17:23,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:17:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:17:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 12:17:23,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:23,710 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:17:23,710 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:23,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash 345475557, now seen corresponding path program 15 times [2018-11-23 12:17:23,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:23,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:23,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:23,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:23,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:24,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {8168#true} call ULTIMATE.init(); {8168#true} is VALID [2018-11-23 12:17:24,006 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:17:24,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:17:24,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8168#true} {8168#true} #66#return; {8168#true} is VALID [2018-11-23 12:17:24,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {8168#true} call #t~ret12 := main(); {8168#true} is VALID [2018-11-23 12:17:24,006 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:17:24,007 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:17:24,007 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:17:24,007 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:17:24,007 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:17:24,007 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:17:24,008 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:17:24,008 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:17:24,008 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:17:24,008 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:17:24,008 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:17:24,008 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:17:24,008 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:17:24,009 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:17:24,009 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:17:24,009 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:17:24,009 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:17:24,009 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:17:24,009 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:17:24,009 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:17:24,009 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:17:24,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {8168#true} assume !(~i~1 < 10); {8168#true} is VALID [2018-11-23 12:17:24,010 INFO L256 TraceCheckUtils]: 27: Hoare triple {8168#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:17:24,010 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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:24,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {8170#(= sum_~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#(= sum_~i~0 0)} is VALID [2018-11-23 12:17:24,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {8170#(= sum_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8171#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:24,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {8171#(<= sum_~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#(<= sum_~i~0 1)} is VALID [2018-11-23 12:17:24,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {8171#(<= sum_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8172#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:24,012 INFO L273 TraceCheckUtils]: 33: Hoare triple {8172#(<= sum_~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#(<= sum_~i~0 2)} is VALID [2018-11-23 12:17:24,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {8172#(<= sum_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8173#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:24,013 INFO L273 TraceCheckUtils]: 35: Hoare triple {8173#(<= sum_~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#(<= sum_~i~0 3)} is VALID [2018-11-23 12:17:24,013 INFO L273 TraceCheckUtils]: 36: Hoare triple {8173#(<= sum_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8174#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:24,014 INFO L273 TraceCheckUtils]: 37: Hoare triple {8174#(<= sum_~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#(<= sum_~i~0 4)} is VALID [2018-11-23 12:17:24,015 INFO L273 TraceCheckUtils]: 38: Hoare triple {8174#(<= sum_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8175#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:24,015 INFO L273 TraceCheckUtils]: 39: Hoare triple {8175#(<= sum_~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#(<= sum_~i~0 5)} is VALID [2018-11-23 12:17:24,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {8175#(<= sum_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8176#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:24,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {8176#(<= sum_~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#(<= sum_~i~0 6)} is VALID [2018-11-23 12:17:24,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {8176#(<= sum_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8177#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:24,018 INFO L273 TraceCheckUtils]: 43: Hoare triple {8177#(<= sum_~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#(<= sum_~i~0 7)} is VALID [2018-11-23 12:17:24,019 INFO L273 TraceCheckUtils]: 44: Hoare triple {8177#(<= sum_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8178#(<= sum_~i~0 8)} is VALID [2018-11-23 12:17:24,020 INFO L273 TraceCheckUtils]: 45: Hoare triple {8178#(<= sum_~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#(<= sum_~i~0 8)} is VALID [2018-11-23 12:17:24,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {8178#(<= sum_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8179#(<= sum_~i~0 9)} is VALID [2018-11-23 12:17:24,021 INFO L273 TraceCheckUtils]: 47: Hoare triple {8179#(<= sum_~i~0 9)} assume !(~i~0 < 10); {8169#false} is VALID [2018-11-23 12:17:24,022 INFO L273 TraceCheckUtils]: 48: Hoare triple {8169#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8169#false} is VALID [2018-11-23 12:17:24,022 INFO L273 TraceCheckUtils]: 49: Hoare triple {8169#false} assume true; {8169#false} is VALID [2018-11-23 12:17:24,022 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {8169#false} {8168#true} #70#return; {8169#false} is VALID [2018-11-23 12:17:24,022 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:17:24,022 INFO L256 TraceCheckUtils]: 52: Hoare triple {8169#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:17:24,023 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:17:24,023 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:17:24,023 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:17:24,023 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:17:24,023 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:17:24,024 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:17:24,024 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:17:24,024 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:17:24,024 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:17:24,024 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:17:24,025 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:17:24,025 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:17:24,025 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:17:24,025 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:17:24,025 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:17:24,026 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:17:24,026 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:17:24,026 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:17:24,026 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:17:24,026 INFO L273 TraceCheckUtils]: 72: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:17:24,026 INFO L273 TraceCheckUtils]: 73: Hoare triple {8168#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:17:24,026 INFO L273 TraceCheckUtils]: 74: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:17:24,026 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8168#true} {8169#false} #72#return; {8169#false} is VALID [2018-11-23 12:17:24,027 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:17:24,027 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:17:24,027 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:17:24,027 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:17:24,027 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:17:24,027 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:17:24,027 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:17:24,027 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:17:24,027 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:17:24,028 INFO L273 TraceCheckUtils]: 85: Hoare triple {8169#false} assume !(~i~2 < 9); {8169#false} is VALID [2018-11-23 12:17:24,028 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:17:24,028 INFO L256 TraceCheckUtils]: 87: Hoare triple {8169#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:17:24,028 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:17:24,028 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:17:24,028 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:17:24,028 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:17:24,028 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:17:24,029 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:17:24,029 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:17:24,029 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:17:24,029 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:17:24,029 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:17:24,029 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:17:24,029 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:17:24,029 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:17:24,029 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:17:24,030 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:17:24,030 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:17:24,030 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:17:24,030 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:17:24,030 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:17:24,030 INFO L273 TraceCheckUtils]: 107: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:17:24,030 INFO L273 TraceCheckUtils]: 108: Hoare triple {8168#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:17:24,030 INFO L273 TraceCheckUtils]: 109: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:17:24,030 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {8168#true} {8169#false} #74#return; {8169#false} is VALID [2018-11-23 12:17:24,031 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:17:24,031 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:17:24,031 INFO L273 TraceCheckUtils]: 113: Hoare triple {8169#false} assume !false; {8169#false} is VALID [2018-11-23 12:17:24,036 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:17:24,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:24,036 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:17:24,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:24,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:17:24,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:24,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:24,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {8168#true} call ULTIMATE.init(); {8168#true} is VALID [2018-11-23 12:17:24,394 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:17:24,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:17:24,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8168#true} {8168#true} #66#return; {8168#true} is VALID [2018-11-23 12:17:24,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {8168#true} call #t~ret12 := main(); {8168#true} is VALID [2018-11-23 12:17:24,394 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:17:24,395 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:17:24,395 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:17:24,395 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:17:24,395 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:17:24,395 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:17:24,396 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:17:24,396 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:17:24,396 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:17:24,396 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:17:24,396 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:17:24,396 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:17:24,396 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:17:24,396 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:17:24,396 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:17:24,397 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:17:24,397 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:17:24,397 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:17:24,397 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:17:24,397 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:17:24,397 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:17:24,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {8168#true} assume !(~i~1 < 10); {8168#true} is VALID [2018-11-23 12:17:24,397 INFO L256 TraceCheckUtils]: 27: Hoare triple {8168#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:17:24,397 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:17:24,398 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:17:24,398 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:17:24,398 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:17:24,398 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:17:24,398 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:17:24,398 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:17:24,398 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:17:24,398 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:17:24,398 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:17:24,399 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:17:24,399 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:17:24,399 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:17:24,399 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:17:24,399 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:17:24,399 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:17:24,399 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:17:24,399 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:17:24,400 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:17:24,400 INFO L273 TraceCheckUtils]: 47: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:17:24,400 INFO L273 TraceCheckUtils]: 48: Hoare triple {8168#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:17:24,400 INFO L273 TraceCheckUtils]: 49: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:17:24,400 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {8168#true} {8168#true} #70#return; {8168#true} is VALID [2018-11-23 12:17:24,400 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:17:24,400 INFO L256 TraceCheckUtils]: 52: Hoare triple {8168#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {8168#true} is VALID [2018-11-23 12:17:24,400 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:17:24,400 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:17:24,401 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:17:24,401 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:17:24,401 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:17:24,401 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:17:24,401 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:17:24,401 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:17:24,401 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:17:24,401 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:17:24,401 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:17:24,402 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:17:24,402 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:17:24,402 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:17:24,402 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:17:24,402 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:17:24,402 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:17:24,402 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:17:24,402 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:17:24,403 INFO L273 TraceCheckUtils]: 72: Hoare triple {8168#true} assume !(~i~0 < 10); {8168#true} is VALID [2018-11-23 12:17:24,403 INFO L273 TraceCheckUtils]: 73: Hoare triple {8168#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8168#true} is VALID [2018-11-23 12:17:24,403 INFO L273 TraceCheckUtils]: 74: Hoare triple {8168#true} assume true; {8168#true} is VALID [2018-11-23 12:17:24,403 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8168#true} {8168#true} #72#return; {8168#true} is VALID [2018-11-23 12:17:24,403 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:17:24,404 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:17:24,404 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:17:24,405 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:17:24,405 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:17:24,406 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:17:24,406 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:17:24,406 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:17:24,407 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:17:24,408 INFO L273 TraceCheckUtils]: 85: Hoare triple {8439#(<= main_~i~2 4)} assume !(~i~2 < 9); {8169#false} is VALID [2018-11-23 12:17:24,408 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:17:24,408 INFO L256 TraceCheckUtils]: 87: Hoare triple {8169#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {8169#false} is VALID [2018-11-23 12:17:24,408 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:17:24,409 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:17:24,409 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:17:24,409 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:17:24,409 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:17:24,409 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:17:24,410 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:17:24,410 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:17:24,410 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:17:24,410 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:17:24,410 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:17:24,411 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:17:24,411 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:17:24,411 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:17:24,411 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:17:24,411 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:17:24,411 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:17:24,412 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:17:24,412 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:17:24,412 INFO L273 TraceCheckUtils]: 107: Hoare triple {8169#false} assume !(~i~0 < 10); {8169#false} is VALID [2018-11-23 12:17:24,412 INFO L273 TraceCheckUtils]: 108: Hoare triple {8169#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8169#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 109: Hoare triple {8169#false} assume true; {8169#false} is VALID [2018-11-23 12:17:24,413 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {8169#false} {8169#false} #74#return; {8169#false} is VALID [2018-11-23 12:17:24,413 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:17:24,413 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:17:24,413 INFO L273 TraceCheckUtils]: 113: Hoare triple {8169#false} assume !false; {8169#false} is VALID [2018-11-23 12:17:24,418 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:17:24,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:24,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 12:17:24,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-11-23 12:17:24,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:24,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:17:24,507 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:17:24,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:17:24,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:17:24,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:17:24,509 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 17 states. [2018-11-23 12:17:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:25,151 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-23 12:17:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:17:25,151 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-11-23 12:17:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:17:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2018-11-23 12:17:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:17:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 83 transitions. [2018-11-23 12:17:25,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 83 transitions. [2018-11-23 12:17:25,247 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:17:25,249 INFO L225 Difference]: With dead ends: 115 [2018-11-23 12:17:25,249 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 12:17:25,250 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:17:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 12:17:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 12:17:25,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:25,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-23 12:17:25,275 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-23 12:17:25,275 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-23 12:17:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:25,277 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 12:17:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 12:17:25,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:25,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:25,278 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-23 12:17:25,278 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-23 12:17:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:25,280 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-11-23 12:17:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-23 12:17:25,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:25,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:25,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:25,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:17:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-23 12:17:25,282 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 114 [2018-11-23 12:17:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:25,283 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-23 12:17:25,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:17:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-23 12:17:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:17:25,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:25,284 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:17:25,284 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:25,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1227025345, now seen corresponding path program 16 times [2018-11-23 12:17:25,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:25,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:25,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:25,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:25,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {8952#true} call ULTIMATE.init(); {8952#true} is VALID [2018-11-23 12:17:25,408 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:17:25,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:17:25,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8952#true} {8952#true} #66#return; {8952#true} is VALID [2018-11-23 12:17:25,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {8952#true} call #t~ret12 := main(); {8952#true} is VALID [2018-11-23 12:17:25,409 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:17:25,409 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:17:25,409 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:17:25,409 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:17:25,409 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:17:25,410 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:17:25,410 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:17:25,410 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:17:25,410 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:17:25,410 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:17:25,410 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:17:25,411 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:17:25,411 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:17:25,411 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:17:25,411 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:17:25,411 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:17:25,411 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:17:25,411 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:17:25,411 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:17:25,412 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:17:25,412 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:17:25,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {8952#true} assume !(~i~1 < 10); {8952#true} is VALID [2018-11-23 12:17:25,412 INFO L256 TraceCheckUtils]: 27: Hoare triple {8952#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:17:25,412 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:17:25,412 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:17:25,412 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:17:25,412 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:17:25,412 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:17:25,413 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:17:25,413 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:17:25,413 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:17:25,413 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:17:25,413 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:17:25,413 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:17:25,413 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:17:25,413 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:17:25,413 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:17:25,414 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:17:25,414 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:17:25,414 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:17:25,414 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:17:25,414 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:17:25,414 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:17:25,414 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:17:25,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:17:25,414 INFO L273 TraceCheckUtils]: 50: Hoare triple {8952#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:17:25,415 INFO L273 TraceCheckUtils]: 51: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:17:25,415 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {8952#true} {8952#true} #70#return; {8952#true} is VALID [2018-11-23 12:17:25,415 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:17:25,415 INFO L256 TraceCheckUtils]: 54: Hoare triple {8952#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:17:25,415 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:17:25,415 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:17:25,415 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:17:25,415 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:17:25,416 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:17:25,416 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:17:25,416 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:17:25,416 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:17:25,416 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:17:25,416 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:17:25,416 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:17:25,416 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:17:25,416 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:17:25,417 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:17:25,417 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:17:25,417 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:17:25,417 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:17:25,417 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:17:25,417 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:17:25,417 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:17:25,417 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:17:25,417 INFO L273 TraceCheckUtils]: 76: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:17:25,418 INFO L273 TraceCheckUtils]: 77: Hoare triple {8952#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:17:25,418 INFO L273 TraceCheckUtils]: 78: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:17:25,418 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8952#true} {8952#true} #72#return; {8952#true} is VALID [2018-11-23 12:17:25,419 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:17:25,421 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:17:25,421 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:17:25,423 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:17:25,424 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:17:25,425 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:17:25,425 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:17:25,427 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:17:25,427 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:17:25,429 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:17:25,429 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:17:25,431 INFO L273 TraceCheckUtils]: 91: Hoare triple {8959#(<= main_~i~2 5)} assume !(~i~2 < 9); {8953#false} is VALID [2018-11-23 12:17:25,431 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:17:25,431 INFO L256 TraceCheckUtils]: 93: Hoare triple {8953#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:17:25,431 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:17:25,432 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:17:25,432 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:17:25,432 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:17:25,432 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:17:25,432 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:17:25,433 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:17:25,433 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:17:25,433 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:17:25,433 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:17:25,433 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:17:25,433 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:17:25,434 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:17:25,434 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:17:25,434 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:17:25,434 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:17:25,434 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:17:25,434 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:17:25,434 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:17:25,434 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:17:25,435 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:17:25,435 INFO L273 TraceCheckUtils]: 115: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:17:25,435 INFO L273 TraceCheckUtils]: 116: Hoare triple {8952#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:17:25,435 INFO L273 TraceCheckUtils]: 117: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:17:25,435 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {8952#true} {8953#false} #74#return; {8953#false} is VALID [2018-11-23 12:17:25,435 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:17:25,435 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:17:25,435 INFO L273 TraceCheckUtils]: 121: Hoare triple {8953#false} assume !false; {8953#false} is VALID [2018-11-23 12:17:25,441 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:17:25,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:25,441 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:17:25,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:25,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:25,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:25,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:25,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {8952#true} call ULTIMATE.init(); {8952#true} is VALID [2018-11-23 12:17:25,707 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:17:25,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:17:25,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8952#true} {8952#true} #66#return; {8952#true} is VALID [2018-11-23 12:17:25,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {8952#true} call #t~ret12 := main(); {8952#true} is VALID [2018-11-23 12:17:25,708 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:17:25,708 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:17:25,708 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:17:25,709 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:17:25,709 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:17:25,709 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:17:25,709 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:17:25,709 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:17:25,710 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:17:25,710 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:17:25,710 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:17:25,710 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:17:25,710 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:17:25,710 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:17:25,710 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:17:25,710 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:17:25,711 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:17:25,711 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:17:25,711 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:17:25,711 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:17:25,711 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:17:25,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {8952#true} assume !(~i~1 < 10); {8952#true} is VALID [2018-11-23 12:17:25,711 INFO L256 TraceCheckUtils]: 27: Hoare triple {8952#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:17:25,711 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:17:25,711 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:17:25,712 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:17:25,712 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:17:25,712 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:17:25,712 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:17:25,712 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:17:25,712 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:17:25,712 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:17:25,712 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:17:25,713 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:17:25,713 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:17:25,713 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:17:25,713 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:17:25,713 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:17:25,713 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:17:25,713 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:17:25,713 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:17:25,713 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:17:25,714 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:17:25,714 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:17:25,714 INFO L273 TraceCheckUtils]: 49: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:17:25,714 INFO L273 TraceCheckUtils]: 50: Hoare triple {8952#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:17:25,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:17:25,714 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {8952#true} {8952#true} #70#return; {8952#true} is VALID [2018-11-23 12:17:25,714 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:17:25,714 INFO L256 TraceCheckUtils]: 54: Hoare triple {8952#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {8952#true} is VALID [2018-11-23 12:17:25,714 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:17:25,715 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:17:25,715 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:17:25,715 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:17:25,715 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:17:25,715 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:17:25,715 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:17:25,715 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:17:25,715 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:17:25,715 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:17:25,716 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:17:25,716 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:17:25,716 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:17:25,716 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:17:25,716 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:17:25,716 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:17:25,717 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:17:25,717 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:17:25,717 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:17:25,717 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:17:25,717 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:17:25,717 INFO L273 TraceCheckUtils]: 76: Hoare triple {8952#true} assume !(~i~0 < 10); {8952#true} is VALID [2018-11-23 12:17:25,718 INFO L273 TraceCheckUtils]: 77: Hoare triple {8952#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8952#true} is VALID [2018-11-23 12:17:25,718 INFO L273 TraceCheckUtils]: 78: Hoare triple {8952#true} assume true; {8952#true} is VALID [2018-11-23 12:17:25,718 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8952#true} {8952#true} #72#return; {8952#true} is VALID [2018-11-23 12:17:25,739 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:17:25,745 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:17:25,746 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:17:25,746 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:17:25,746 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:17:25,747 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:17:25,747 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:17:25,748 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:17:25,748 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:17:25,748 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:17:25,749 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:17:25,750 INFO L273 TraceCheckUtils]: 91: Hoare triple {8959#(<= main_~i~2 5)} assume !(~i~2 < 9); {8953#false} is VALID [2018-11-23 12:17:25,750 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:17:25,750 INFO L256 TraceCheckUtils]: 93: Hoare triple {8953#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {8953#false} is VALID [2018-11-23 12:17:25,750 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:17:25,751 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:17:25,751 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:17:25,751 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:17:25,751 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:17:25,751 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:17:25,752 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:17:25,752 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:17:25,752 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:17:25,752 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:17:25,752 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:17:25,752 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:17:25,752 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:17:25,753 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:17:25,753 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:17:25,753 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:17:25,753 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:17:25,753 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:17:25,753 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:17:25,753 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:17:25,753 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:17:25,753 INFO L273 TraceCheckUtils]: 115: Hoare triple {8953#false} assume !(~i~0 < 10); {8953#false} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 116: Hoare triple {8953#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8953#false} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 117: Hoare triple {8953#false} assume true; {8953#false} is VALID [2018-11-23 12:17:25,754 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {8953#false} {8953#false} #74#return; {8953#false} is VALID [2018-11-23 12:17:25,754 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:17:25,754 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:17:25,754 INFO L273 TraceCheckUtils]: 121: Hoare triple {8953#false} assume !false; {8953#false} is VALID [2018-11-23 12:17:25,760 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:17:25,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:25,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:17:25,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-11-23 12:17:25,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:25,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:17:25,821 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:17:25,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:17:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:17:25,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:25,822 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 9 states. [2018-11-23 12:17:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:26,027 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-11-23 12:17:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:17:26,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-11-23 12:17:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2018-11-23 12:17:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2018-11-23 12:17:26,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2018-11-23 12:17:26,223 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:17:26,225 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:17:26,225 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:17:26,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:17:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 12:17:26,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:26,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 12:17:26,256 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 12:17:26,256 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 12:17:26,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:26,258 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 12:17:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 12:17:26,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:26,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:26,259 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 12:17:26,259 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 12:17:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:26,260 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 12:17:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 12:17:26,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:26,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:26,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:26,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:17:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:17:26,263 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 122 [2018-11-23 12:17:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:26,263 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:17:26,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:17:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:17:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:17:26,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:26,265 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:17:26,265 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:26,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1138512449, now seen corresponding path program 17 times [2018-11-23 12:17:26,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:26,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:27,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {9747#true} call ULTIMATE.init(); {9747#true} is VALID [2018-11-23 12:17:27,027 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:17:27,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:17:27,027 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9747#true} {9747#true} #66#return; {9747#true} is VALID [2018-11-23 12:17:27,027 INFO L256 TraceCheckUtils]: 4: Hoare triple {9747#true} call #t~ret12 := main(); {9747#true} is VALID [2018-11-23 12:17:27,028 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:17:27,028 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:17:27,028 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:17:27,029 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:17:27,029 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:17:27,029 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:17:27,029 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:17:27,029 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:17:27,029 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:17:27,030 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:17:27,030 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:17:27,030 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:17:27,030 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:17:27,030 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:17:27,030 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:17:27,030 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:17:27,033 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:17:27,033 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:17:27,033 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:17:27,033 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:17:27,033 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:17:27,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {9747#true} assume !(~i~1 < 10); {9747#true} is VALID [2018-11-23 12:17:27,034 INFO L256 TraceCheckUtils]: 27: Hoare triple {9747#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:17:27,034 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:17:27,034 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:17:27,034 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:17:27,034 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:17:27,034 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:17:27,035 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:17:27,035 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:17:27,035 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:17:27,035 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:17:27,035 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:17:27,035 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:17:27,035 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:17:27,035 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:17:27,035 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:17:27,036 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:17:27,036 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:17:27,036 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:17:27,036 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:17:27,036 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:17:27,036 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:17:27,036 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:17:27,036 INFO L273 TraceCheckUtils]: 49: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:17:27,036 INFO L273 TraceCheckUtils]: 50: Hoare triple {9747#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:17:27,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:17:27,037 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {9747#true} {9747#true} #70#return; {9747#true} is VALID [2018-11-23 12:17:27,037 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:17:27,037 INFO L256 TraceCheckUtils]: 54: Hoare triple {9747#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:17:27,037 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:17:27,037 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:17:27,037 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:17:27,037 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:17:27,038 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:17:27,038 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:17:27,038 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:17:27,038 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:17:27,038 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:17:27,038 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:17:27,038 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:17:27,038 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:17:27,038 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:17:27,039 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:17:27,039 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:17:27,039 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:17:27,039 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:17:27,039 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:17:27,039 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:17:27,040 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:17:27,040 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:17:27,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:17:27,040 INFO L273 TraceCheckUtils]: 77: Hoare triple {9747#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:17:27,040 INFO L273 TraceCheckUtils]: 78: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:17:27,040 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {9747#true} {9747#true} #72#return; {9747#true} is VALID [2018-11-23 12:17:27,043 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:17:27,044 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:17:27,044 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:17:27,046 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:17:27,046 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:17:27,048 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:17:27,048 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:17:27,050 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:17:27,050 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:17:27,052 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:17:27,052 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:17:27,052 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:17:27,053 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:17:27,053 INFO L273 TraceCheckUtils]: 93: Hoare triple {9755#(<= main_~i~2 6)} assume !(~i~2 < 9); {9748#false} is VALID [2018-11-23 12:17:27,054 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:17:27,054 INFO L256 TraceCheckUtils]: 95: Hoare triple {9748#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:17:27,054 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:17:27,054 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:17:27,054 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:17:27,055 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:17:27,055 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:17:27,055 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:17:27,055 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:17:27,055 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:17:27,056 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:17:27,056 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:17:27,056 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:17:27,056 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:17:27,056 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:17:27,056 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:17:27,056 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:17:27,056 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:17:27,056 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:17:27,057 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:17:27,057 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:17:27,057 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:17:27,057 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:17:27,057 INFO L273 TraceCheckUtils]: 117: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:17:27,057 INFO L273 TraceCheckUtils]: 118: Hoare triple {9747#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:17:27,057 INFO L273 TraceCheckUtils]: 119: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:17:27,057 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {9747#true} {9748#false} #74#return; {9748#false} is VALID [2018-11-23 12:17:27,057 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:17:27,058 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:17:27,058 INFO L273 TraceCheckUtils]: 123: Hoare triple {9748#false} assume !false; {9748#false} is VALID [2018-11-23 12:17:27,063 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:17:27,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:27,064 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:17:27,072 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:27,527 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 12:17:27,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:27,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:27,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {9747#true} call ULTIMATE.init(); {9747#true} is VALID [2018-11-23 12:17:27,701 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:17:27,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:17:27,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9747#true} {9747#true} #66#return; {9747#true} is VALID [2018-11-23 12:17:27,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {9747#true} call #t~ret12 := main(); {9747#true} is VALID [2018-11-23 12:17:27,702 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:17:27,702 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:17:27,702 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:17:27,702 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:17:27,702 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:17:27,703 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:17:27,703 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:17:27,703 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:17:27,703 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:17:27,703 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:17:27,704 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:17:27,704 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:17:27,704 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:17:27,704 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:17:27,704 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:17:27,704 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:17:27,704 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:17:27,704 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:17:27,704 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:17:27,705 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:17:27,705 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:17:27,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {9747#true} assume !(~i~1 < 10); {9747#true} is VALID [2018-11-23 12:17:27,705 INFO L256 TraceCheckUtils]: 27: Hoare triple {9747#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:17:27,705 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:17:27,705 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:17:27,705 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:17:27,705 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:17:27,706 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:17:27,706 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:17:27,706 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:17:27,706 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:17:27,706 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:17:27,706 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:17:27,706 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:17:27,706 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:17:27,706 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:17:27,707 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:17:27,707 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:17:27,707 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:17:27,707 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:17:27,707 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:17:27,707 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:17:27,707 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:17:27,707 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:17:27,707 INFO L273 TraceCheckUtils]: 49: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:17:27,708 INFO L273 TraceCheckUtils]: 50: Hoare triple {9747#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:17:27,708 INFO L273 TraceCheckUtils]: 51: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:17:27,708 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {9747#true} {9747#true} #70#return; {9747#true} is VALID [2018-11-23 12:17:27,708 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:17:27,708 INFO L256 TraceCheckUtils]: 54: Hoare triple {9747#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {9747#true} is VALID [2018-11-23 12:17:27,708 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:17:27,708 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:17:27,709 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:17:27,709 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:17:27,709 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:17:27,709 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:17:27,709 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:17:27,709 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:17:27,709 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:17:27,709 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:17:27,710 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:17:27,710 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:17:27,710 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:17:27,710 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:17:27,710 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:17:27,710 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:17:27,710 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:17:27,710 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:17:27,710 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:17:27,711 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:17:27,711 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:17:27,711 INFO L273 TraceCheckUtils]: 76: Hoare triple {9747#true} assume !(~i~0 < 10); {9747#true} is VALID [2018-11-23 12:17:27,711 INFO L273 TraceCheckUtils]: 77: Hoare triple {9747#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9747#true} is VALID [2018-11-23 12:17:27,711 INFO L273 TraceCheckUtils]: 78: Hoare triple {9747#true} assume true; {9747#true} is VALID [2018-11-23 12:17:27,711 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {9747#true} {9747#true} #72#return; {9747#true} is VALID [2018-11-23 12:17:27,712 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:17:27,712 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:17:27,713 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:17:27,713 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:17:27,713 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:17:27,714 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:17:27,714 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:17:27,714 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:17:27,715 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:17:27,715 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:17:27,716 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:17:27,717 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:17:27,718 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:17:27,718 INFO L273 TraceCheckUtils]: 93: Hoare triple {9755#(<= main_~i~2 6)} assume !(~i~2 < 9); {9748#false} is VALID [2018-11-23 12:17:27,718 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:17:27,719 INFO L256 TraceCheckUtils]: 95: Hoare triple {9748#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {9748#false} is VALID [2018-11-23 12:17:27,719 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:17:27,719 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:17:27,719 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:17:27,719 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:17:27,720 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:17:27,720 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:17:27,720 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:17:27,720 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:17:27,720 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:17:27,721 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:17:27,721 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:17:27,721 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:17:27,721 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:17:27,721 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:17:27,722 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:17:27,722 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:17:27,722 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:17:27,722 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:17:27,722 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:17:27,722 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:17:27,723 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:17:27,723 INFO L273 TraceCheckUtils]: 117: Hoare triple {9748#false} assume !(~i~0 < 10); {9748#false} is VALID [2018-11-23 12:17:27,723 INFO L273 TraceCheckUtils]: 118: Hoare triple {9748#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9748#false} is VALID [2018-11-23 12:17:27,723 INFO L273 TraceCheckUtils]: 119: Hoare triple {9748#false} assume true; {9748#false} is VALID [2018-11-23 12:17:27,723 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {9748#false} {9748#false} #74#return; {9748#false} is VALID [2018-11-23 12:17:27,724 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:17:27,724 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:17:27,724 INFO L273 TraceCheckUtils]: 123: Hoare triple {9748#false} assume !false; {9748#false} is VALID [2018-11-23 12:17:27,730 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:17:27,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:27,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:17:27,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-11-23 12:17:27,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:27,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:17:27,799 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:17:27,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:17:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:17:27,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:17:27,800 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-11-23 12:17:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:28,229 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-11-23 12:17:28,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:17:28,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2018-11-23 12:17:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:17:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-11-23 12:17:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:17:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-11-23 12:17:28,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2018-11-23 12:17:28,292 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:17:28,294 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:17:28,294 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:17:28,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:17:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:17:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:17:28,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:28,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:17:28,328 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:17:28,328 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:17:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:28,330 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:17:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:17:28,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:28,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:28,331 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:17:28,331 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:17:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:28,332 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:17:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:17:28,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:28,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:28,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:28,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:17:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:17:28,338 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 124 [2018-11-23 12:17:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:28,339 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:17:28,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:17:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:17:28,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:17:28,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:28,342 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:17:28,342 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:28,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1912334397, now seen corresponding path program 18 times [2018-11-23 12:17:28,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:28,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:28,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:28,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:28,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {10559#true} call ULTIMATE.init(); {10559#true} is VALID [2018-11-23 12:17:28,583 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:17:28,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:17:28,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10559#true} {10559#true} #66#return; {10559#true} is VALID [2018-11-23 12:17:28,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {10559#true} call #t~ret12 := main(); {10559#true} is VALID [2018-11-23 12:17:28,584 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:17:28,584 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:17:28,584 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:17:28,585 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:17:28,585 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:17:28,585 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:17:28,585 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:17:28,585 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:17:28,586 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:17:28,586 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:17:28,586 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:17:28,586 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:17:28,586 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:17:28,586 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:17:28,586 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:17:28,586 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:17:28,586 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:17:28,587 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:17:28,587 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:17:28,587 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:17:28,587 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:17:28,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {10559#true} assume !(~i~1 < 10); {10559#true} is VALID [2018-11-23 12:17:28,587 INFO L256 TraceCheckUtils]: 27: Hoare triple {10559#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:17:28,587 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:17:28,587 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:17:28,587 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:17:28,588 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:17:28,588 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:17:28,588 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:17:28,588 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:17:28,588 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:17:28,588 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:17:28,588 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:17:28,588 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:17:28,588 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:17:28,589 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:17:28,589 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:17:28,589 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:17:28,589 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:17:28,589 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:17:28,589 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:17:28,589 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:17:28,589 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:17:28,589 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:17:28,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:17:28,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {10559#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:17:28,590 INFO L273 TraceCheckUtils]: 51: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:17:28,590 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {10559#true} {10559#true} #70#return; {10559#true} is VALID [2018-11-23 12:17:28,590 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:17:28,590 INFO L256 TraceCheckUtils]: 54: Hoare triple {10559#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:17:28,590 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:17:28,590 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:17:28,591 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:17:28,591 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:17:28,591 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:17:28,591 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:17:28,591 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:17:28,591 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:17:28,591 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:17:28,591 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:17:28,591 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:17:28,592 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:17:28,592 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:17:28,592 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:17:28,592 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:17:28,592 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:17:28,592 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:17:28,592 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:17:28,592 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:17:28,592 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:17:28,593 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:17:28,593 INFO L273 TraceCheckUtils]: 76: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:17:28,593 INFO L273 TraceCheckUtils]: 77: Hoare triple {10559#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:17:28,593 INFO L273 TraceCheckUtils]: 78: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:17:28,593 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10559#true} {10559#true} #72#return; {10559#true} is VALID [2018-11-23 12:17:28,610 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:17:28,619 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:17:28,624 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:17:28,624 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:17:28,625 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:17:28,625 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:17:28,626 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:17:28,626 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:17:28,626 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:17:28,627 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:17:28,627 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:17:28,627 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:17:28,628 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:17:28,629 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:17:28,630 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:17:28,630 INFO L273 TraceCheckUtils]: 95: Hoare triple {10568#(<= main_~i~2 7)} assume !(~i~2 < 9); {10560#false} is VALID [2018-11-23 12:17:28,630 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:17:28,631 INFO L256 TraceCheckUtils]: 97: Hoare triple {10560#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:17:28,631 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:17:28,631 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:17:28,631 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:17:28,631 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:17:28,632 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:17:28,632 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:17:28,632 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:17:28,632 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:17:28,632 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:17:28,633 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:17:28,633 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:17:28,633 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:17:28,633 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:17:28,633 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:17:28,633 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:17:28,633 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:17:28,633 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:17:28,633 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:17:28,634 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:17:28,634 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:17:28,634 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:17:28,634 INFO L273 TraceCheckUtils]: 119: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:17:28,634 INFO L273 TraceCheckUtils]: 120: Hoare triple {10559#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:17:28,634 INFO L273 TraceCheckUtils]: 121: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:17:28,634 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {10559#true} {10560#false} #74#return; {10560#false} is VALID [2018-11-23 12:17:28,634 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:17:28,635 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:17:28,635 INFO L273 TraceCheckUtils]: 125: Hoare triple {10560#false} assume !false; {10560#false} is VALID [2018-11-23 12:17:28,641 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:17:28,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:28,641 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:17:28,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:17:28,940 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 12:17:28,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:28,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:29,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {10559#true} call ULTIMATE.init(); {10559#true} is VALID [2018-11-23 12:17:29,207 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:17:29,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:17:29,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10559#true} {10559#true} #66#return; {10559#true} is VALID [2018-11-23 12:17:29,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {10559#true} call #t~ret12 := main(); {10559#true} is VALID [2018-11-23 12:17:29,208 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:17:29,208 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:17:29,208 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:17:29,208 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:17:29,209 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:17:29,209 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:17:29,209 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:17:29,209 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:17:29,209 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:17:29,209 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:17:29,209 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:17:29,209 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:17:29,209 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:17:29,210 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:17:29,210 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:17:29,210 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:17:29,210 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:17:29,210 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:17:29,210 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:17:29,210 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:17:29,210 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:17:29,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {10559#true} assume !(~i~1 < 10); {10559#true} is VALID [2018-11-23 12:17:29,211 INFO L256 TraceCheckUtils]: 27: Hoare triple {10559#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:17:29,211 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:17:29,211 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:17:29,211 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:17:29,211 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:17:29,211 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:17:29,211 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:17:29,211 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:17:29,211 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:17:29,212 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:17:29,212 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:17:29,212 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:17:29,212 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:17:29,212 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:17:29,212 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:17:29,212 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:17:29,212 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:17:29,212 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:17:29,213 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:17:29,213 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:17:29,213 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:17:29,213 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:17:29,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:17:29,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {10559#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:17:29,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:17:29,213 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {10559#true} {10559#true} #70#return; {10559#true} is VALID [2018-11-23 12:17:29,213 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:17:29,214 INFO L256 TraceCheckUtils]: 54: Hoare triple {10559#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {10559#true} is VALID [2018-11-23 12:17:29,214 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:17:29,214 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:17:29,214 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:17:29,214 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:17:29,214 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:17:29,214 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:17:29,214 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:17:29,214 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:17:29,215 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:17:29,215 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:17:29,215 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:17:29,215 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:17:29,215 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:17:29,215 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:17:29,215 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:17:29,215 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:17:29,215 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:17:29,216 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:17:29,216 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:17:29,216 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:17:29,216 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:17:29,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {10559#true} assume !(~i~0 < 10); {10559#true} is VALID [2018-11-23 12:17:29,216 INFO L273 TraceCheckUtils]: 77: Hoare triple {10559#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10559#true} is VALID [2018-11-23 12:17:29,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {10559#true} assume true; {10559#true} is VALID [2018-11-23 12:17:29,216 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10559#true} {10559#true} #72#return; {10559#true} is VALID [2018-11-23 12:17:29,217 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:17:29,217 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:17:29,218 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:17:29,218 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:17:29,218 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:17:29,219 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:17:29,219 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:17:29,220 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:17:29,220 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:17:29,220 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:17:29,221 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:17:29,221 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:17:29,222 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:17:29,223 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:17:29,223 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:17:29,224 INFO L273 TraceCheckUtils]: 95: Hoare triple {10568#(<= main_~i~2 7)} assume !(~i~2 < 9); {10560#false} is VALID [2018-11-23 12:17:29,224 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:17:29,224 INFO L256 TraceCheckUtils]: 97: Hoare triple {10560#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {10560#false} is VALID [2018-11-23 12:17:29,225 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:17:29,225 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:17:29,225 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:17:29,225 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:17:29,225 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:17:29,226 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:17:29,226 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:17:29,226 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:17:29,226 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:17:29,226 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:17:29,227 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:17:29,227 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:17:29,227 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:17:29,227 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:17:29,227 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:17:29,228 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:17:29,228 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:17:29,228 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:17:29,228 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:17:29,228 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:17:29,229 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:17:29,229 INFO L273 TraceCheckUtils]: 119: Hoare triple {10560#false} assume !(~i~0 < 10); {10560#false} is VALID [2018-11-23 12:17:29,229 INFO L273 TraceCheckUtils]: 120: Hoare triple {10560#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10560#false} is VALID [2018-11-23 12:17:29,229 INFO L273 TraceCheckUtils]: 121: Hoare triple {10560#false} assume true; {10560#false} is VALID [2018-11-23 12:17:29,229 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {10560#false} {10560#false} #74#return; {10560#false} is VALID [2018-11-23 12:17:29,229 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:17:29,230 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:17:29,230 INFO L273 TraceCheckUtils]: 125: Hoare triple {10560#false} assume !false; {10560#false} is VALID [2018-11-23 12:17:29,253 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:17:29,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:29,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:17:29,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-11-23 12:17:29,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:29,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:17:29,326 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:17:29,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:17:29,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:17:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:29,327 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 11 states. [2018-11-23 12:17:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:29,586 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-11-23 12:17:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:17:29,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-11-23 12:17:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2018-11-23 12:17:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2018-11-23 12:17:29,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2018-11-23 12:17:29,644 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:17:29,646 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:17:29,646 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:17:29,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:17:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-23 12:17:29,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:29,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 79 states. [2018-11-23 12:17:29,673 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 79 states. [2018-11-23 12:17:29,674 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 79 states. [2018-11-23 12:17:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:29,676 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:17:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:17:29,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:29,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:29,677 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 80 states. [2018-11-23 12:17:29,677 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 80 states. [2018-11-23 12:17:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:29,679 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-11-23 12:17:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-23 12:17:29,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:29,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:29,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:29,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:17:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-11-23 12:17:29,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 126 [2018-11-23 12:17:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:29,682 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-23 12:17:29,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:17:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-11-23 12:17:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-23 12:17:29,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:29,683 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:17:29,683 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:29,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:29,684 INFO L82 PathProgramCache]: Analyzing trace with hash 313490235, now seen corresponding path program 19 times [2018-11-23 12:17:29,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:29,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:29,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:29,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:29,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:29,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {11388#true} call ULTIMATE.init(); {11388#true} is VALID [2018-11-23 12:17:29,886 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:17:29,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:17:29,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11388#true} {11388#true} #66#return; {11388#true} is VALID [2018-11-23 12:17:29,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {11388#true} call #t~ret12 := main(); {11388#true} is VALID [2018-11-23 12:17:29,887 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:17:29,887 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:17:29,887 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:17:29,887 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:17:29,887 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:17:29,888 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:17:29,888 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:17:29,888 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:17:29,888 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:17:29,888 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:17:29,888 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:17:29,888 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:17:29,888 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:17:29,889 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:17:29,889 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:17:29,889 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:17:29,889 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:17:29,889 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:17:29,889 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:17:29,889 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:17:29,889 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:17:29,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {11388#true} assume !(~i~1 < 10); {11388#true} is VALID [2018-11-23 12:17:29,890 INFO L256 TraceCheckUtils]: 27: Hoare triple {11388#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:17:29,890 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:17:29,890 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:17:29,890 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:17:29,890 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:17:29,890 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:17:29,890 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:17:29,890 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:17:29,890 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:17:29,891 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:17:29,891 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:17:29,891 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:17:29,891 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:17:29,891 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:17:29,891 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:17:29,891 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:17:29,891 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:17:29,891 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:17:29,892 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:17:29,892 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:17:29,892 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:17:29,892 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:17:29,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:17:29,892 INFO L273 TraceCheckUtils]: 50: Hoare triple {11388#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:17:29,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:17:29,892 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {11388#true} {11388#true} #70#return; {11388#true} is VALID [2018-11-23 12:17:29,893 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:17:29,893 INFO L256 TraceCheckUtils]: 54: Hoare triple {11388#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:17:29,893 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:17:29,893 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:17:29,893 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:17:29,893 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:17:29,893 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:17:29,893 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:17:29,893 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:17:29,894 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:17:29,894 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:17:29,894 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:17:29,894 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:17:29,894 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:17:29,894 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:17:29,894 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:17:29,894 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:17:29,894 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:17:29,895 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:17:29,895 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:17:29,895 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:17:29,895 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:17:29,895 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:17:29,895 INFO L273 TraceCheckUtils]: 76: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:17:29,895 INFO L273 TraceCheckUtils]: 77: Hoare triple {11388#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:17:29,895 INFO L273 TraceCheckUtils]: 78: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:17:29,895 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {11388#true} {11388#true} #72#return; {11388#true} is VALID [2018-11-23 12:17:29,896 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:17:29,896 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:17:29,897 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:17:29,897 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:17:29,897 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:17:29,898 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:17:29,898 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:17:29,898 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:17:29,899 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:17:29,899 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:17:29,900 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:17:29,900 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:17:29,901 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:17:29,901 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:17:29,902 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:17:29,902 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:17:29,903 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:17:29,904 INFO L273 TraceCheckUtils]: 97: Hoare triple {11398#(<= main_~i~2 8)} assume !(~i~2 < 9); {11389#false} is VALID [2018-11-23 12:17:29,904 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:17:29,904 INFO L256 TraceCheckUtils]: 99: Hoare triple {11389#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:17:29,904 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:17:29,905 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:17:29,905 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:17:29,905 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:17:29,905 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:17:29,905 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:17:29,905 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:17:29,906 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:17:29,906 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:17:29,906 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:17:29,906 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:17:29,906 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:17:29,907 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:17:29,907 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:17:29,907 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:17:29,907 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:17:29,907 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:17:29,908 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:17:29,908 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:17:29,908 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:17:29,908 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:17:29,908 INFO L273 TraceCheckUtils]: 121: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:17:29,909 INFO L273 TraceCheckUtils]: 122: Hoare triple {11388#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:17:29,909 INFO L273 TraceCheckUtils]: 123: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:17:29,909 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {11388#true} {11389#false} #74#return; {11389#false} is VALID [2018-11-23 12:17:29,909 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:17:29,909 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:17:29,909 INFO L273 TraceCheckUtils]: 127: Hoare triple {11389#false} assume !false; {11389#false} is VALID [2018-11-23 12:17:29,915 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:17:29,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:29,916 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:17:29,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:30,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:30,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {11388#true} call ULTIMATE.init(); {11388#true} is VALID [2018-11-23 12:17:30,163 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:17:30,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:17:30,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11388#true} {11388#true} #66#return; {11388#true} is VALID [2018-11-23 12:17:30,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {11388#true} call #t~ret12 := main(); {11388#true} is VALID [2018-11-23 12:17:30,163 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:17:30,163 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:17:30,164 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:17:30,164 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:17:30,164 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:17:30,164 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:17:30,164 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:17:30,164 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:17:30,164 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:17:30,164 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:17:30,164 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:17:30,165 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:17:30,165 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:17:30,165 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:17:30,165 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:17:30,165 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:17:30,165 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:17:30,165 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:17:30,165 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:17:30,165 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:17:30,166 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:17:30,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {11388#true} assume !(~i~1 < 10); {11388#true} is VALID [2018-11-23 12:17:30,166 INFO L256 TraceCheckUtils]: 27: Hoare triple {11388#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:17:30,166 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:17:30,166 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:17:30,166 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:17:30,166 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:17:30,166 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:17:30,166 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:17:30,167 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:17:30,167 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:17:30,167 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:17:30,167 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:17:30,167 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:17:30,167 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:17:30,167 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:17:30,167 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:17:30,168 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:17:30,168 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:17:30,168 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:17:30,168 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:17:30,168 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:17:30,168 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:17:30,168 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:17:30,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:17:30,168 INFO L273 TraceCheckUtils]: 50: Hoare triple {11388#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:17:30,169 INFO L273 TraceCheckUtils]: 51: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:17:30,169 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {11388#true} {11388#true} #70#return; {11388#true} is VALID [2018-11-23 12:17:30,169 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:17:30,169 INFO L256 TraceCheckUtils]: 54: Hoare triple {11388#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {11388#true} is VALID [2018-11-23 12:17:30,169 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:17:30,169 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:17:30,169 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:17:30,169 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:17:30,169 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:17:30,170 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:17:30,170 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:17:30,170 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:17:30,170 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:17:30,170 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:17:30,170 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:17:30,170 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:17:30,170 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:17:30,170 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:17:30,171 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:17:30,171 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:17:30,171 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:17:30,171 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:17:30,171 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:17:30,171 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:17:30,171 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:17:30,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {11388#true} assume !(~i~0 < 10); {11388#true} is VALID [2018-11-23 12:17:30,171 INFO L273 TraceCheckUtils]: 77: Hoare triple {11388#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11388#true} is VALID [2018-11-23 12:17:30,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {11388#true} assume true; {11388#true} is VALID [2018-11-23 12:17:30,172 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {11388#true} {11388#true} #72#return; {11388#true} is VALID [2018-11-23 12:17:30,172 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:17:30,173 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:17:30,173 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:17:30,174 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:17:30,174 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:17:30,174 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:17:30,175 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:17:30,175 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:17:30,176 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:17:30,176 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:17:30,177 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:17:30,177 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:17:30,178 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:17:30,179 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:17:30,180 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:17:30,180 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:17:30,181 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:17:30,182 INFO L273 TraceCheckUtils]: 97: Hoare triple {11398#(<= main_~i~2 8)} assume !(~i~2 < 9); {11389#false} is VALID [2018-11-23 12:17:30,182 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:17:30,182 INFO L256 TraceCheckUtils]: 99: Hoare triple {11389#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {11389#false} is VALID [2018-11-23 12:17:30,182 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:17:30,182 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:17:30,183 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:17:30,183 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:17:30,183 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:17:30,183 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:17:30,183 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:17:30,184 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:17:30,184 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:17:30,184 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:17:30,184 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:17:30,184 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:17:30,184 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:17:30,185 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:17:30,185 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:17:30,185 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:17:30,185 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:17:30,185 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:17:30,186 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:17:30,186 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:17:30,186 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:17:30,186 INFO L273 TraceCheckUtils]: 121: Hoare triple {11389#false} assume !(~i~0 < 10); {11389#false} is VALID [2018-11-23 12:17:30,186 INFO L273 TraceCheckUtils]: 122: Hoare triple {11389#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11389#false} is VALID [2018-11-23 12:17:30,187 INFO L273 TraceCheckUtils]: 123: Hoare triple {11389#false} assume true; {11389#false} is VALID [2018-11-23 12:17:30,187 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {11389#false} {11389#false} #74#return; {11389#false} is VALID [2018-11-23 12:17:30,187 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:17:30,187 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:17:30,187 INFO L273 TraceCheckUtils]: 127: Hoare triple {11389#false} assume !false; {11389#false} is VALID [2018-11-23 12:17:30,194 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:17:30,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:30,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:17:30,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2018-11-23 12:17:30,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:30,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:17:30,267 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:17:30,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:17:30,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:17:30,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:30,268 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2018-11-23 12:17:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:30,507 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-23 12:17:30,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:17:30,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2018-11-23 12:17:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 12:17:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 12:17:30,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2018-11-23 12:17:30,562 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:17:30,564 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:17:30,564 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:17:30,565 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:17:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:17:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 12:17:30,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:30,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2018-11-23 12:17:30,591 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:17:30,592 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:17:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:30,593 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 12:17:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:17:30,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:30,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:30,594 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2018-11-23 12:17:30,594 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2018-11-23 12:17:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:30,596 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-11-23 12:17:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:17:30,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:30,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:30,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:30,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:17:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:17:30,598 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 128 [2018-11-23 12:17:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:30,598 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:17:30,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:17:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:17:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:17:30,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:30,600 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:17:30,600 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:30,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1422542521, now seen corresponding path program 20 times [2018-11-23 12:17:30,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:30,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:34,590 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 3 [2018-11-23 12:17:39,149 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 7 [2018-11-23 12:17:40,071 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:17:40,076 INFO L168 Benchmark]: Toolchain (without parser) took 42899.52 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.1 MB). Peak memory consumption was 292.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:17:40,077 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:17:40,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.07 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:17:40,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.69 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:17:40,078 INFO L168 Benchmark]: Boogie Preprocessor took 43.75 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:17:40,079 INFO L168 Benchmark]: RCFGBuilder took 805.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:17:40,079 INFO L168 Benchmark]: TraceAbstraction took 41622.81 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 369.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -50.2 MB). Peak memory consumption was 319.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:17:40,083 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 398.07 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 23.69 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 43.75 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 805.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41622.81 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 369.6 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -50.2 MB). Peak memory consumption was 319.4 MB. 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...