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/max10_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:15:43,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:15:43,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:15:43,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:15:43,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:15:43,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:15:43,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:15:43,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:15:43,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:15:43,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:15:43,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:15:43,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:15:43,816 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:15:43,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:15:43,818 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:15:43,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:15:43,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:15:43,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:15:43,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:15:43,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:15:43,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:15:43,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:15:43,850 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:15:43,850 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:15:43,851 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:15:43,852 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:15:43,853 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:15:43,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:15:43,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:15:43,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:15:43,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:15:43,860 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:15:43,860 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:15:43,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:15:43,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:15:43,862 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:15:43,863 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:15:43,893 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:15:43,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:15:43,894 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:15:43,895 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:15:43,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:15:43,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:15:43,897 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:15:43,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:15:43,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:15:43,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:15:43,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:15:43,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:15:43,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:15:43,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:15:43,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:15:43,899 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:15:43,899 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:15:43,900 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:15:43,900 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:15:43,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:15:43,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:15:43,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:15:43,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:15:43,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:15:43,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:15:43,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:15:43,903 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:15:43,903 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:15:43,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:15:43,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:15:43,903 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:15:43,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:15:43,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:15:43,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:15:43,985 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:15:43,985 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:15:43,986 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-11-23 12:15:44,049 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcdf435d/a9bb1964b553419a975f11bbd884b8ed/FLAGdfca324d7 [2018-11-23 12:15:44,515 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:15:44,516 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max10_true-unreach-call_true-termination.i [2018-11-23 12:15:44,524 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcdf435d/a9bb1964b553419a975f11bbd884b8ed/FLAGdfca324d7 [2018-11-23 12:15:44,873 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcdf435d/a9bb1964b553419a975f11bbd884b8ed [2018-11-23 12:15:44,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:15:44,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:15:44,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:15:44,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:15:44,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:15:44,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:44" (1/1) ... [2018-11-23 12:15:44,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b15a6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:44, skipping insertion in model container [2018-11-23 12:15:44,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:44" (1/1) ... [2018-11-23 12:15:44,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:15:44,933 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:15:45,219 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:15:45,235 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:15:45,264 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:15:45,286 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:15:45,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45 WrapperNode [2018-11-23 12:15:45,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:15:45,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:15:45,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:15:45,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:15:45,296 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:15:45" (1/1) ... [2018-11-23 12:15:45,304 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:15:45" (1/1) ... [2018-11-23 12:15:45,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:15:45,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:15:45,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:15:45,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:15:45,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (1/1) ... [2018-11-23 12:15:45,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (1/1) ... [2018-11-23 12:15:45,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (1/1) ... [2018-11-23 12:15:45,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (1/1) ... [2018-11-23 12:15:45,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (1/1) ... [2018-11-23 12:15:45,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (1/1) ... [2018-11-23 12:15:45,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (1/1) ... [2018-11-23 12:15:45,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:15:45,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:15:45,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:15:45,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:15:45,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (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:15:45,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:15:45,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:15:45,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:15:45,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:15:45,481 INFO L130 BoogieDeclarations]: Found specification of procedure max [2018-11-23 12:15:45,481 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2018-11-23 12:15:45,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:15:45,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:15:45,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:15:45,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:15:45,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:15:45,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:15:46,236 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:15:46,236 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:15:46,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:46 BoogieIcfgContainer [2018-11-23 12:15:46,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:15:46,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:15:46,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:15:46,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:15:46,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:15:44" (1/3) ... [2018-11-23 12:15:46,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d79299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:15:46, skipping insertion in model container [2018-11-23 12:15:46,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:45" (2/3) ... [2018-11-23 12:15:46,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d79299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:15:46, skipping insertion in model container [2018-11-23 12:15:46,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:46" (3/3) ... [2018-11-23 12:15:46,249 INFO L112 eAbstractionObserver]: Analyzing ICFG max10_true-unreach-call_true-termination.i [2018-11-23 12:15:46,260 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:15:46,271 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:15:46,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:15:46,345 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:15:46,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:15:46,346 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:15:46,347 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:15:46,347 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:15:46,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:15:46,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:15:46,348 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:15:46,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:15:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 12:15:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:15:46,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:46,393 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:15:46,398 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:46,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1379671032, now seen corresponding path program 1 times [2018-11-23 12:15:46,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:46,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:46,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:46,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:46,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 12:15:46,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-23 12:15:46,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:15:46,680 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #73#return; {36#true} is VALID [2018-11-23 12:15:46,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret14 := main(); {36#true} is VALID [2018-11-23 12:15:46,691 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#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; {38#(= main_~i~1 0)} is VALID [2018-11-23 12:15:46,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#(= main_~i~1 0)} assume !(~i~1 < 10); {37#false} is VALID [2018-11-23 12:15:46,692 INFO L256 TraceCheckUtils]: 7: Hoare triple {37#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 12:15:46,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-23 12:15:46,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-23 12:15:46,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#true} is VALID [2018-11-23 12:15:46,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:15:46,694 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {36#true} {37#false} #77#return; {37#false} is VALID [2018-11-23 12:15:46,694 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37#false} is VALID [2018-11-23 12:15:46,695 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 12:15:46,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-23 12:15:46,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-23 12:15:46,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {36#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#true} is VALID [2018-11-23 12:15:46,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:15:46,696 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {36#true} {37#false} #79#return; {37#false} is VALID [2018-11-23 12:15:46,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {37#false} is VALID [2018-11-23 12:15:46,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !(~i~2 < 9); {37#false} is VALID [2018-11-23 12:15:46,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {37#false} is VALID [2018-11-23 12:15:46,698 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 12:15:46,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {36#true} is VALID [2018-11-23 12:15:46,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {36#true} assume !true; {36#true} is VALID [2018-11-23 12:15:46,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {36#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36#true} is VALID [2018-11-23 12:15:46,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 12:15:46,699 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {36#true} {37#false} #81#return; {37#false} is VALID [2018-11-23 12:15:46,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {37#false} is VALID [2018-11-23 12:15:46,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-23 12:15:46,700 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 12:15:46,706 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:15:46,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:15:46,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:15:46,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:15:46,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:46,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:15:46,858 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:15:46,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:15:46,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:15:46,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:15:46,872 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-11-23 12:15:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:47,280 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2018-11-23 12:15:47,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:15:47,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:15:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:15:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-23 12:15:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:15:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-23 12:15:47,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2018-11-23 12:15:47,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:47,563 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:15:47,564 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:15:47,568 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:15:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:15:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:15:47,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:47,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:15:47,687 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:15:47,687 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:15:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:47,702 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 12:15:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:15:47,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:47,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:47,706 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:15:47,707 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:15:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:47,719 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 12:15:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:15:47,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:47,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:47,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:47,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:15:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:15:47,732 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2018-11-23 12:15:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:47,732 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:15:47,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:15:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:15:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:15:47,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:47,735 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:15:47,735 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:47,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash 551744077, now seen corresponding path program 1 times [2018-11-23 12:15:47,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:47,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:48,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-23 12:15:48,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {220#true} is VALID [2018-11-23 12:15:48,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 12:15:48,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #73#return; {220#true} is VALID [2018-11-23 12:15:48,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret14 := main(); {220#true} is VALID [2018-11-23 12:15:48,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {220#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; {220#true} is VALID [2018-11-23 12:15:48,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {220#true} is VALID [2018-11-23 12:15:48,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {220#true} is VALID [2018-11-23 12:15:48,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {220#true} assume !(~i~1 < 10); {220#true} is VALID [2018-11-23 12:15:48,003 INFO L256 TraceCheckUtils]: 9: Hoare triple {220#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {220#true} is VALID [2018-11-23 12:15:48,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {222#(= max_~i~0 0)} is VALID [2018-11-23 12:15:48,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {222#(= max_~i~0 0)} assume !(~i~0 < 10); {221#false} is VALID [2018-11-23 12:15:48,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {221#false} is VALID [2018-11-23 12:15:48,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume true; {221#false} is VALID [2018-11-23 12:15:48,022 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {221#false} {220#true} #77#return; {221#false} is VALID [2018-11-23 12:15:48,023 INFO L273 TraceCheckUtils]: 15: Hoare triple {221#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {221#false} is VALID [2018-11-23 12:15:48,023 INFO L256 TraceCheckUtils]: 16: Hoare triple {221#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {220#true} is VALID [2018-11-23 12:15:48,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {220#true} is VALID [2018-11-23 12:15:48,024 INFO L273 TraceCheckUtils]: 18: Hoare triple {220#true} assume !(~i~0 < 10); {220#true} is VALID [2018-11-23 12:15:48,025 INFO L273 TraceCheckUtils]: 19: Hoare triple {220#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {220#true} is VALID [2018-11-23 12:15:48,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 12:15:48,026 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {220#true} {221#false} #79#return; {221#false} is VALID [2018-11-23 12:15:48,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {221#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {221#false} is VALID [2018-11-23 12:15:48,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {221#false} assume !(~i~2 < 9); {221#false} is VALID [2018-11-23 12:15:48,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {221#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {221#false} is VALID [2018-11-23 12:15:48,028 INFO L256 TraceCheckUtils]: 25: Hoare triple {221#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {220#true} is VALID [2018-11-23 12:15:48,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {220#true} is VALID [2018-11-23 12:15:48,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {220#true} assume !(~i~0 < 10); {220#true} is VALID [2018-11-23 12:15:48,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {220#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {220#true} is VALID [2018-11-23 12:15:48,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 12:15:48,031 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {220#true} {221#false} #81#return; {221#false} is VALID [2018-11-23 12:15:48,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {221#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {221#false} is VALID [2018-11-23 12:15:48,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {221#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {221#false} is VALID [2018-11-23 12:15:48,035 INFO L273 TraceCheckUtils]: 33: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-23 12:15:48,037 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:15:48,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:48,038 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:15:48,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:48,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:48,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-23 12:15:48,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {220#true} is VALID [2018-11-23 12:15:48,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 12:15:48,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #73#return; {220#true} is VALID [2018-11-23 12:15:48,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret14 := main(); {220#true} is VALID [2018-11-23 12:15:48,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {220#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; {220#true} is VALID [2018-11-23 12:15:48,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {220#true} is VALID [2018-11-23 12:15:48,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {220#true} is VALID [2018-11-23 12:15:48,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {220#true} assume !(~i~1 < 10); {220#true} is VALID [2018-11-23 12:15:48,345 INFO L256 TraceCheckUtils]: 9: Hoare triple {220#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {220#true} is VALID [2018-11-23 12:15:48,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {256#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:48,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#(<= max_~i~0 0)} assume !(~i~0 < 10); {221#false} is VALID [2018-11-23 12:15:48,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {221#false} is VALID [2018-11-23 12:15:48,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume true; {221#false} is VALID [2018-11-23 12:15:48,369 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {221#false} {220#true} #77#return; {221#false} is VALID [2018-11-23 12:15:48,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {221#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {221#false} is VALID [2018-11-23 12:15:48,370 INFO L256 TraceCheckUtils]: 16: Hoare triple {221#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {221#false} is VALID [2018-11-23 12:15:48,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {221#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {221#false} is VALID [2018-11-23 12:15:48,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {221#false} assume !(~i~0 < 10); {221#false} is VALID [2018-11-23 12:15:48,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {221#false} is VALID [2018-11-23 12:15:48,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {221#false} assume true; {221#false} is VALID [2018-11-23 12:15:48,371 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {221#false} {221#false} #79#return; {221#false} is VALID [2018-11-23 12:15:48,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {221#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {221#false} is VALID [2018-11-23 12:15:48,372 INFO L273 TraceCheckUtils]: 23: Hoare triple {221#false} assume !(~i~2 < 9); {221#false} is VALID [2018-11-23 12:15:48,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {221#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {221#false} is VALID [2018-11-23 12:15:48,375 INFO L256 TraceCheckUtils]: 25: Hoare triple {221#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {221#false} is VALID [2018-11-23 12:15:48,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {221#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {221#false} is VALID [2018-11-23 12:15:48,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {221#false} assume !(~i~0 < 10); {221#false} is VALID [2018-11-23 12:15:48,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {221#false} is VALID [2018-11-23 12:15:48,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {221#false} assume true; {221#false} is VALID [2018-11-23 12:15:48,377 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {221#false} {221#false} #81#return; {221#false} is VALID [2018-11-23 12:15:48,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {221#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {221#false} is VALID [2018-11-23 12:15:48,377 INFO L273 TraceCheckUtils]: 32: Hoare triple {221#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {221#false} is VALID [2018-11-23 12:15:48,378 INFO L273 TraceCheckUtils]: 33: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-23 12:15:48,380 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:15:48,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:15:48,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:15:48,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:15:48,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:48,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:15:48,603 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:15:48,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:15:48,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:15:48,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:15:48,604 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2018-11-23 12:15:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:48,790 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-11-23 12:15:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:15:48,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:15:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:15:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 12:15:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:15:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 12:15:48,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-23 12:15:48,962 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:15:48,965 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:15:48,965 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:15:48,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:15:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:15:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 12:15:48,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:48,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2018-11-23 12:15:48,992 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2018-11-23 12:15:48,992 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2018-11-23 12:15:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:48,996 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 12:15:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:15:48,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:48,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:48,998 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2018-11-23 12:15:48,998 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2018-11-23 12:15:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:49,002 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 12:15:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 12:15:49,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:49,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:49,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:49,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:15:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:15:49,007 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2018-11-23 12:15:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:49,007 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:15:49,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:15:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:15:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:15:49,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:49,010 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:15:49,010 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:49,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash 727331048, now seen corresponding path program 1 times [2018-11-23 12:15:49,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:49,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {504#true} call ULTIMATE.init(); {504#true} is VALID [2018-11-23 12:15:49,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {504#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {504#true} is VALID [2018-11-23 12:15:49,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-23 12:15:49,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {504#true} {504#true} #73#return; {504#true} is VALID [2018-11-23 12:15:49,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {504#true} call #t~ret14 := main(); {504#true} is VALID [2018-11-23 12:15:49,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {504#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; {504#true} is VALID [2018-11-23 12:15:49,137 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {504#true} is VALID [2018-11-23 12:15:49,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {504#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {504#true} is VALID [2018-11-23 12:15:49,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {504#true} assume !(~i~1 < 10); {504#true} is VALID [2018-11-23 12:15:49,138 INFO L256 TraceCheckUtils]: 9: Hoare triple {504#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {504#true} is VALID [2018-11-23 12:15:49,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {504#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {504#true} is VALID [2018-11-23 12:15:49,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {504#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {504#true} is VALID [2018-11-23 12:15:49,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {504#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {504#true} is VALID [2018-11-23 12:15:49,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {504#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {504#true} is VALID [2018-11-23 12:15:49,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {504#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {504#true} is VALID [2018-11-23 12:15:49,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {504#true} assume !(~i~0 < 10); {504#true} is VALID [2018-11-23 12:15:49,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {504#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {504#true} is VALID [2018-11-23 12:15:49,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-23 12:15:49,141 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {504#true} {504#true} #77#return; {504#true} is VALID [2018-11-23 12:15:49,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {504#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {504#true} is VALID [2018-11-23 12:15:49,142 INFO L256 TraceCheckUtils]: 20: Hoare triple {504#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {504#true} is VALID [2018-11-23 12:15:49,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {504#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {504#true} is VALID [2018-11-23 12:15:49,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {504#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {504#true} is VALID [2018-11-23 12:15:49,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {504#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {504#true} is VALID [2018-11-23 12:15:49,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {504#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {504#true} is VALID [2018-11-23 12:15:49,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {504#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {504#true} is VALID [2018-11-23 12:15:49,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {504#true} assume !(~i~0 < 10); {504#true} is VALID [2018-11-23 12:15:49,144 INFO L273 TraceCheckUtils]: 27: Hoare triple {504#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {504#true} is VALID [2018-11-23 12:15:49,144 INFO L273 TraceCheckUtils]: 28: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-23 12:15:49,145 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {504#true} {504#true} #79#return; {504#true} is VALID [2018-11-23 12:15:49,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {504#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {506#(= main_~i~2 0)} is VALID [2018-11-23 12:15:49,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {506#(= main_~i~2 0)} assume !(~i~2 < 9); {505#false} is VALID [2018-11-23 12:15:49,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {505#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {505#false} is VALID [2018-11-23 12:15:49,152 INFO L256 TraceCheckUtils]: 33: Hoare triple {505#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {504#true} is VALID [2018-11-23 12:15:49,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {504#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {504#true} is VALID [2018-11-23 12:15:49,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {504#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {504#true} is VALID [2018-11-23 12:15:49,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {504#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {504#true} is VALID [2018-11-23 12:15:49,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {504#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {504#true} is VALID [2018-11-23 12:15:49,153 INFO L273 TraceCheckUtils]: 38: Hoare triple {504#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {504#true} is VALID [2018-11-23 12:15:49,154 INFO L273 TraceCheckUtils]: 39: Hoare triple {504#true} assume !(~i~0 < 10); {504#true} is VALID [2018-11-23 12:15:49,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {504#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {504#true} is VALID [2018-11-23 12:15:49,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-23 12:15:49,154 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {504#true} {505#false} #81#return; {505#false} is VALID [2018-11-23 12:15:49,155 INFO L273 TraceCheckUtils]: 43: Hoare triple {505#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {505#false} is VALID [2018-11-23 12:15:49,155 INFO L273 TraceCheckUtils]: 44: Hoare triple {505#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {505#false} is VALID [2018-11-23 12:15:49,155 INFO L273 TraceCheckUtils]: 45: Hoare triple {505#false} assume !false; {505#false} is VALID [2018-11-23 12:15:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 12:15:49,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:15:49,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:15:49,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-23 12:15:49,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:49,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:15:49,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:49,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:15:49,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:15:49,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:15:49,230 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 3 states. [2018-11-23 12:15:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:49,339 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 12:15:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:15:49,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-23 12:15:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:15:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 12:15:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:15:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 12:15:49,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2018-11-23 12:15:49,454 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:15:49,456 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:15:49,457 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:15:49,457 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:15:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:15:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:15:49,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:49,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:15:49,476 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:15:49,477 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:15:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:49,482 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 12:15:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:15:49,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:49,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:49,483 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:15:49,483 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:15:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:49,486 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-23 12:15:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:15:49,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:49,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:49,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:49,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:15:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 12:15:49,491 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 46 [2018-11-23 12:15:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:49,491 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 12:15:49,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:15:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:15:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:15:49,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:49,494 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, 1, 1] [2018-11-23 12:15:49,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:49,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash -270429754, now seen corresponding path program 1 times [2018-11-23 12:15:49,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:49,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:49,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:49,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2018-11-23 12:15:49,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {683#true} is VALID [2018-11-23 12:15:49,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:15:49,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #73#return; {683#true} is VALID [2018-11-23 12:15:49,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret14 := main(); {683#true} is VALID [2018-11-23 12:15:49,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {683#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; {685#(= main_~i~1 0)} is VALID [2018-11-23 12:15:49,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {685#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {685#(= main_~i~1 0)} is VALID [2018-11-23 12:15:49,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {685#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {686#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:49,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {686#(<= main_~i~1 1)} assume !(~i~1 < 10); {684#false} is VALID [2018-11-23 12:15:49,631 INFO L256 TraceCheckUtils]: 9: Hoare triple {684#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {683#true} is VALID [2018-11-23 12:15:49,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {683#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {683#true} is VALID [2018-11-23 12:15:49,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {683#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {683#true} is VALID [2018-11-23 12:15:49,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {683#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {683#true} is VALID [2018-11-23 12:15:49,631 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {683#true} is VALID [2018-11-23 12:15:49,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {683#true} is VALID [2018-11-23 12:15:49,632 INFO L273 TraceCheckUtils]: 15: Hoare triple {683#true} assume !(~i~0 < 10); {683#true} is VALID [2018-11-23 12:15:49,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {683#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {683#true} is VALID [2018-11-23 12:15:49,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:15:49,633 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {683#true} {684#false} #77#return; {684#false} is VALID [2018-11-23 12:15:49,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {684#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {684#false} is VALID [2018-11-23 12:15:49,633 INFO L256 TraceCheckUtils]: 20: Hoare triple {684#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {683#true} is VALID [2018-11-23 12:15:49,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {683#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {683#true} is VALID [2018-11-23 12:15:49,634 INFO L273 TraceCheckUtils]: 22: Hoare triple {683#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {683#true} is VALID [2018-11-23 12:15:49,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {683#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {683#true} is VALID [2018-11-23 12:15:49,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {683#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {683#true} is VALID [2018-11-23 12:15:49,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {683#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {683#true} is VALID [2018-11-23 12:15:49,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {683#true} assume !(~i~0 < 10); {683#true} is VALID [2018-11-23 12:15:49,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {683#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {683#true} is VALID [2018-11-23 12:15:49,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:15:49,636 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {683#true} {684#false} #79#return; {684#false} is VALID [2018-11-23 12:15:49,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {684#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {684#false} is VALID [2018-11-23 12:15:49,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {684#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {684#false} is VALID [2018-11-23 12:15:49,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {684#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {684#false} is VALID [2018-11-23 12:15:49,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {684#false} assume !(~i~2 < 9); {684#false} is VALID [2018-11-23 12:15:49,637 INFO L273 TraceCheckUtils]: 34: Hoare triple {684#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {684#false} is VALID [2018-11-23 12:15:49,638 INFO L256 TraceCheckUtils]: 35: Hoare triple {684#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {683#true} is VALID [2018-11-23 12:15:49,638 INFO L273 TraceCheckUtils]: 36: Hoare triple {683#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {683#true} is VALID [2018-11-23 12:15:49,638 INFO L273 TraceCheckUtils]: 37: Hoare triple {683#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {683#true} is VALID [2018-11-23 12:15:49,639 INFO L273 TraceCheckUtils]: 38: Hoare triple {683#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {683#true} is VALID [2018-11-23 12:15:49,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {683#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {683#true} is VALID [2018-11-23 12:15:49,639 INFO L273 TraceCheckUtils]: 40: Hoare triple {683#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {683#true} is VALID [2018-11-23 12:15:49,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {683#true} assume !(~i~0 < 10); {683#true} is VALID [2018-11-23 12:15:49,640 INFO L273 TraceCheckUtils]: 42: Hoare triple {683#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {683#true} is VALID [2018-11-23 12:15:49,640 INFO L273 TraceCheckUtils]: 43: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:15:49,640 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {683#true} {684#false} #81#return; {684#false} is VALID [2018-11-23 12:15:49,641 INFO L273 TraceCheckUtils]: 45: Hoare triple {684#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {684#false} is VALID [2018-11-23 12:15:49,641 INFO L273 TraceCheckUtils]: 46: Hoare triple {684#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {684#false} is VALID [2018-11-23 12:15:49,641 INFO L273 TraceCheckUtils]: 47: Hoare triple {684#false} assume !false; {684#false} is VALID [2018-11-23 12:15:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 12:15:49,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:49,645 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:15:49,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:49,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:49,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2018-11-23 12:15:49,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {683#true} is VALID [2018-11-23 12:15:49,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2018-11-23 12:15:49,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #73#return; {683#true} is VALID [2018-11-23 12:15:49,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret14 := main(); {683#true} is VALID [2018-11-23 12:15:49,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {683#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; {705#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:49,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {705#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:49,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {686#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:49,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {686#(<= main_~i~1 1)} assume !(~i~1 < 10); {684#false} is VALID [2018-11-23 12:15:49,863 INFO L256 TraceCheckUtils]: 9: Hoare triple {684#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {684#false} is VALID [2018-11-23 12:15:49,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {684#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {684#false} is VALID [2018-11-23 12:15:49,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {684#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {684#false} is VALID [2018-11-23 12:15:49,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {684#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {684#false} is VALID [2018-11-23 12:15:49,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {684#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {684#false} is VALID [2018-11-23 12:15:49,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {684#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {684#false} is VALID [2018-11-23 12:15:49,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {684#false} assume !(~i~0 < 10); {684#false} is VALID [2018-11-23 12:15:49,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {684#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {684#false} is VALID [2018-11-23 12:15:49,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-23 12:15:49,865 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {684#false} {684#false} #77#return; {684#false} is VALID [2018-11-23 12:15:49,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {684#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {684#false} is VALID [2018-11-23 12:15:49,866 INFO L256 TraceCheckUtils]: 20: Hoare triple {684#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {684#false} is VALID [2018-11-23 12:15:49,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {684#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {684#false} is VALID [2018-11-23 12:15:49,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {684#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {684#false} is VALID [2018-11-23 12:15:49,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {684#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {684#false} is VALID [2018-11-23 12:15:49,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {684#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {684#false} is VALID [2018-11-23 12:15:49,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {684#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {684#false} is VALID [2018-11-23 12:15:49,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {684#false} assume !(~i~0 < 10); {684#false} is VALID [2018-11-23 12:15:49,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {684#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {684#false} is VALID [2018-11-23 12:15:49,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-23 12:15:49,868 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {684#false} {684#false} #79#return; {684#false} is VALID [2018-11-23 12:15:49,869 INFO L273 TraceCheckUtils]: 30: Hoare triple {684#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {684#false} is VALID [2018-11-23 12:15:49,869 INFO L273 TraceCheckUtils]: 31: Hoare triple {684#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {684#false} is VALID [2018-11-23 12:15:49,869 INFO L273 TraceCheckUtils]: 32: Hoare triple {684#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {684#false} is VALID [2018-11-23 12:15:49,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {684#false} assume !(~i~2 < 9); {684#false} is VALID [2018-11-23 12:15:49,870 INFO L273 TraceCheckUtils]: 34: Hoare triple {684#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {684#false} is VALID [2018-11-23 12:15:49,870 INFO L256 TraceCheckUtils]: 35: Hoare triple {684#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {684#false} is VALID [2018-11-23 12:15:49,870 INFO L273 TraceCheckUtils]: 36: Hoare triple {684#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {684#false} is VALID [2018-11-23 12:15:49,870 INFO L273 TraceCheckUtils]: 37: Hoare triple {684#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {684#false} is VALID [2018-11-23 12:15:49,871 INFO L273 TraceCheckUtils]: 38: Hoare triple {684#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {684#false} is VALID [2018-11-23 12:15:49,871 INFO L273 TraceCheckUtils]: 39: Hoare triple {684#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {684#false} is VALID [2018-11-23 12:15:49,871 INFO L273 TraceCheckUtils]: 40: Hoare triple {684#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {684#false} is VALID [2018-11-23 12:15:49,871 INFO L273 TraceCheckUtils]: 41: Hoare triple {684#false} assume !(~i~0 < 10); {684#false} is VALID [2018-11-23 12:15:49,872 INFO L273 TraceCheckUtils]: 42: Hoare triple {684#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {684#false} is VALID [2018-11-23 12:15:49,872 INFO L273 TraceCheckUtils]: 43: Hoare triple {684#false} assume true; {684#false} is VALID [2018-11-23 12:15:49,872 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {684#false} {684#false} #81#return; {684#false} is VALID [2018-11-23 12:15:49,873 INFO L273 TraceCheckUtils]: 45: Hoare triple {684#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {684#false} is VALID [2018-11-23 12:15:49,873 INFO L273 TraceCheckUtils]: 46: Hoare triple {684#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {684#false} is VALID [2018-11-23 12:15:49,873 INFO L273 TraceCheckUtils]: 47: Hoare triple {684#false} assume !false; {684#false} is VALID [2018-11-23 12:15:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 12:15:49,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:49,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:15:49,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:15:49,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:49,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:15:50,020 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:15:50,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:15:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:15:50,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:15:50,022 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2018-11-23 12:15:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:50,152 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:15:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:15:50,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:15:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:15:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 12:15:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:15:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 12:15:50,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2018-11-23 12:15:50,294 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:15:50,296 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:15:50,296 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:15:50,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:15:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:15:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:15:50,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:50,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:15:50,316 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:15:50,316 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:15:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:50,319 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:15:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:15:50,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:50,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:50,320 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:15:50,320 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:15:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:50,323 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:15:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:15:50,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:50,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:50,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:50,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:15:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-23 12:15:50,327 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 48 [2018-11-23 12:15:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:50,327 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-23 12:15:50,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:15:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:15:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:15:50,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:50,329 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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:15:50,329 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:50,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1585951496, now seen corresponding path program 2 times [2018-11-23 12:15:50,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:50,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:50,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:50,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:50,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2018-11-23 12:15:50,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {1026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1026#true} is VALID [2018-11-23 12:15:50,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-23 12:15:50,495 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #73#return; {1026#true} is VALID [2018-11-23 12:15:50,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret14 := main(); {1026#true} is VALID [2018-11-23 12:15:50,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {1026#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; {1028#(= main_~i~1 0)} is VALID [2018-11-23 12:15:50,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {1028#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1028#(= main_~i~1 0)} is VALID [2018-11-23 12:15:50,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {1028#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1029#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:50,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {1029#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1029#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:50,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {1029#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1030#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:50,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#(<= main_~i~1 2)} assume !(~i~1 < 10); {1027#false} is VALID [2018-11-23 12:15:50,503 INFO L256 TraceCheckUtils]: 11: Hoare triple {1027#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {1026#true} is VALID [2018-11-23 12:15:50,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {1026#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1026#true} is VALID [2018-11-23 12:15:50,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {1026#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1026#true} is VALID [2018-11-23 12:15:50,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1026#true} is VALID [2018-11-23 12:15:50,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {1026#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1026#true} is VALID [2018-11-23 12:15:50,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {1026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1026#true} is VALID [2018-11-23 12:15:50,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {1026#true} assume !(~i~0 < 10); {1026#true} is VALID [2018-11-23 12:15:50,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {1026#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1026#true} is VALID [2018-11-23 12:15:50,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-23 12:15:50,507 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1026#true} {1027#false} #77#return; {1027#false} is VALID [2018-11-23 12:15:50,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {1027#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1027#false} is VALID [2018-11-23 12:15:50,508 INFO L256 TraceCheckUtils]: 22: Hoare triple {1027#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {1026#true} is VALID [2018-11-23 12:15:50,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {1026#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1026#true} is VALID [2018-11-23 12:15:50,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {1026#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1026#true} is VALID [2018-11-23 12:15:50,509 INFO L273 TraceCheckUtils]: 25: Hoare triple {1026#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1026#true} is VALID [2018-11-23 12:15:50,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {1026#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1026#true} is VALID [2018-11-23 12:15:50,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {1026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1026#true} is VALID [2018-11-23 12:15:50,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {1026#true} assume !(~i~0 < 10); {1026#true} is VALID [2018-11-23 12:15:50,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {1026#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1026#true} is VALID [2018-11-23 12:15:50,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-23 12:15:50,510 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1026#true} {1027#false} #79#return; {1027#false} is VALID [2018-11-23 12:15:50,511 INFO L273 TraceCheckUtils]: 32: Hoare triple {1027#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1027#false} is VALID [2018-11-23 12:15:50,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {1027#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1027#false} is VALID [2018-11-23 12:15:50,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {1027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1027#false} is VALID [2018-11-23 12:15:50,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {1027#false} assume !(~i~2 < 9); {1027#false} is VALID [2018-11-23 12:15:50,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {1027#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1027#false} is VALID [2018-11-23 12:15:50,512 INFO L256 TraceCheckUtils]: 37: Hoare triple {1027#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {1026#true} is VALID [2018-11-23 12:15:50,512 INFO L273 TraceCheckUtils]: 38: Hoare triple {1026#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1026#true} is VALID [2018-11-23 12:15:50,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {1026#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1026#true} is VALID [2018-11-23 12:15:50,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {1026#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1026#true} is VALID [2018-11-23 12:15:50,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {1026#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1026#true} is VALID [2018-11-23 12:15:50,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {1026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1026#true} is VALID [2018-11-23 12:15:50,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {1026#true} assume !(~i~0 < 10); {1026#true} is VALID [2018-11-23 12:15:50,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {1026#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1026#true} is VALID [2018-11-23 12:15:50,514 INFO L273 TraceCheckUtils]: 45: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-23 12:15:50,515 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1026#true} {1027#false} #81#return; {1027#false} is VALID [2018-11-23 12:15:50,515 INFO L273 TraceCheckUtils]: 47: Hoare triple {1027#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1027#false} is VALID [2018-11-23 12:15:50,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {1027#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1027#false} is VALID [2018-11-23 12:15:50,515 INFO L273 TraceCheckUtils]: 49: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2018-11-23 12:15:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 12:15:50,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:50,519 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:15:50,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:15:50,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:15:50,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:15:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:50,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:50,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1026#true} is VALID [2018-11-23 12:15:50,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {1026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1026#true} is VALID [2018-11-23 12:15:50,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2018-11-23 12:15:50,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #73#return; {1026#true} is VALID [2018-11-23 12:15:50,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret14 := main(); {1026#true} is VALID [2018-11-23 12:15:50,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {1026#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; {1049#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:50,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {1049#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1049#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:50,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {1049#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1029#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:50,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {1029#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1029#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:50,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {1029#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1030#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:50,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#(<= main_~i~1 2)} assume !(~i~1 < 10); {1027#false} is VALID [2018-11-23 12:15:50,757 INFO L256 TraceCheckUtils]: 11: Hoare triple {1027#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {1027#false} is VALID [2018-11-23 12:15:50,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {1027#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1027#false} is VALID [2018-11-23 12:15:50,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {1027#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1027#false} is VALID [2018-11-23 12:15:50,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {1027#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1027#false} is VALID [2018-11-23 12:15:50,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1027#false} is VALID [2018-11-23 12:15:50,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {1027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1027#false} is VALID [2018-11-23 12:15:50,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {1027#false} assume !(~i~0 < 10); {1027#false} is VALID [2018-11-23 12:15:50,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {1027#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1027#false} is VALID [2018-11-23 12:15:50,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-23 12:15:50,760 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1027#false} {1027#false} #77#return; {1027#false} is VALID [2018-11-23 12:15:50,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {1027#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1027#false} is VALID [2018-11-23 12:15:50,760 INFO L256 TraceCheckUtils]: 22: Hoare triple {1027#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {1027#false} is VALID [2018-11-23 12:15:50,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {1027#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1027#false} is VALID [2018-11-23 12:15:50,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {1027#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1027#false} is VALID [2018-11-23 12:15:50,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {1027#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1027#false} is VALID [2018-11-23 12:15:50,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {1027#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1027#false} is VALID [2018-11-23 12:15:50,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {1027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1027#false} is VALID [2018-11-23 12:15:50,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {1027#false} assume !(~i~0 < 10); {1027#false} is VALID [2018-11-23 12:15:50,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {1027#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1027#false} is VALID [2018-11-23 12:15:50,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-23 12:15:50,762 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1027#false} {1027#false} #79#return; {1027#false} is VALID [2018-11-23 12:15:50,762 INFO L273 TraceCheckUtils]: 32: Hoare triple {1027#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1027#false} is VALID [2018-11-23 12:15:50,762 INFO L273 TraceCheckUtils]: 33: Hoare triple {1027#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1027#false} is VALID [2018-11-23 12:15:50,762 INFO L273 TraceCheckUtils]: 34: Hoare triple {1027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1027#false} is VALID [2018-11-23 12:15:50,763 INFO L273 TraceCheckUtils]: 35: Hoare triple {1027#false} assume !(~i~2 < 9); {1027#false} is VALID [2018-11-23 12:15:50,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {1027#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1027#false} is VALID [2018-11-23 12:15:50,763 INFO L256 TraceCheckUtils]: 37: Hoare triple {1027#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {1027#false} is VALID [2018-11-23 12:15:50,763 INFO L273 TraceCheckUtils]: 38: Hoare triple {1027#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1027#false} is VALID [2018-11-23 12:15:50,764 INFO L273 TraceCheckUtils]: 39: Hoare triple {1027#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1027#false} is VALID [2018-11-23 12:15:50,764 INFO L273 TraceCheckUtils]: 40: Hoare triple {1027#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1027#false} is VALID [2018-11-23 12:15:50,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {1027#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1027#false} is VALID [2018-11-23 12:15:50,764 INFO L273 TraceCheckUtils]: 42: Hoare triple {1027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1027#false} is VALID [2018-11-23 12:15:50,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {1027#false} assume !(~i~0 < 10); {1027#false} is VALID [2018-11-23 12:15:50,765 INFO L273 TraceCheckUtils]: 44: Hoare triple {1027#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1027#false} is VALID [2018-11-23 12:15:50,765 INFO L273 TraceCheckUtils]: 45: Hoare triple {1027#false} assume true; {1027#false} is VALID [2018-11-23 12:15:50,765 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1027#false} {1027#false} #81#return; {1027#false} is VALID [2018-11-23 12:15:50,765 INFO L273 TraceCheckUtils]: 47: Hoare triple {1027#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1027#false} is VALID [2018-11-23 12:15:50,766 INFO L273 TraceCheckUtils]: 48: Hoare triple {1027#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1027#false} is VALID [2018-11-23 12:15:50,766 INFO L273 TraceCheckUtils]: 49: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2018-11-23 12:15:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 12:15:50,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:50,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:15:50,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-23 12:15:50,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:50,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:15:50,848 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:15:50,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:15:50,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:15:50,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:15:50,849 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 6 states. [2018-11-23 12:15:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:51,029 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-23 12:15:51,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:15:51,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-23 12:15:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:15:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:15:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:15:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 12:15:51,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 12:15:51,127 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:15:51,129 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:15:51,129 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:15:51,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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:15:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:15:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 12:15:51,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:51,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 12:15:51,168 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 12:15:51,168 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 12:15:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:51,171 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 12:15:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:15:51,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:51,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:51,172 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 12:15:51,172 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 12:15:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:51,174 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 12:15:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 12:15:51,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:51,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:51,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:51,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:15:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 12:15:51,178 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 50 [2018-11-23 12:15:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:51,178 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 12:15:51,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:15:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:15:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:15:51,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:51,180 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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:15:51,180 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:51,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:51,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1138062390, now seen corresponding path program 3 times [2018-11-23 12:15:51,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:51,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:51,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:51,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:15:51,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:51,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2018-11-23 12:15:51,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {1386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1386#true} is VALID [2018-11-23 12:15:51,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 12:15:51,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} #73#return; {1386#true} is VALID [2018-11-23 12:15:51,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {1386#true} call #t~ret14 := main(); {1386#true} is VALID [2018-11-23 12:15:51,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {1386#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; {1388#(= main_~i~1 0)} is VALID [2018-11-23 12:15:51,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1388#(= main_~i~1 0)} is VALID [2018-11-23 12:15:51,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {1388#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1389#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:51,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {1389#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1389#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:51,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {1389#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1390#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:51,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {1390#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1390#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:51,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {1390#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1391#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:51,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {1391#(<= main_~i~1 3)} assume !(~i~1 < 10); {1387#false} is VALID [2018-11-23 12:15:51,315 INFO L256 TraceCheckUtils]: 13: Hoare triple {1387#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {1386#true} is VALID [2018-11-23 12:15:51,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {1386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1386#true} is VALID [2018-11-23 12:15:51,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {1386#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1386#true} is VALID [2018-11-23 12:15:51,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1386#true} is VALID [2018-11-23 12:15:51,316 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1386#true} is VALID [2018-11-23 12:15:51,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {1386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#true} is VALID [2018-11-23 12:15:51,317 INFO L273 TraceCheckUtils]: 19: Hoare triple {1386#true} assume !(~i~0 < 10); {1386#true} is VALID [2018-11-23 12:15:51,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {1386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1386#true} is VALID [2018-11-23 12:15:51,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 12:15:51,318 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1386#true} {1387#false} #77#return; {1387#false} is VALID [2018-11-23 12:15:51,318 INFO L273 TraceCheckUtils]: 23: Hoare triple {1387#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1387#false} is VALID [2018-11-23 12:15:51,318 INFO L256 TraceCheckUtils]: 24: Hoare triple {1387#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {1386#true} is VALID [2018-11-23 12:15:51,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {1386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1386#true} is VALID [2018-11-23 12:15:51,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {1386#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1386#true} is VALID [2018-11-23 12:15:51,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {1386#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1386#true} is VALID [2018-11-23 12:15:51,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {1386#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1386#true} is VALID [2018-11-23 12:15:51,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {1386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#true} is VALID [2018-11-23 12:15:51,320 INFO L273 TraceCheckUtils]: 30: Hoare triple {1386#true} assume !(~i~0 < 10); {1386#true} is VALID [2018-11-23 12:15:51,320 INFO L273 TraceCheckUtils]: 31: Hoare triple {1386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1386#true} is VALID [2018-11-23 12:15:51,320 INFO L273 TraceCheckUtils]: 32: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 12:15:51,321 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1386#true} {1387#false} #79#return; {1387#false} is VALID [2018-11-23 12:15:51,321 INFO L273 TraceCheckUtils]: 34: Hoare triple {1387#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1387#false} is VALID [2018-11-23 12:15:51,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {1387#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1387#false} is VALID [2018-11-23 12:15:51,322 INFO L273 TraceCheckUtils]: 36: Hoare triple {1387#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1387#false} is VALID [2018-11-23 12:15:51,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {1387#false} assume !(~i~2 < 9); {1387#false} is VALID [2018-11-23 12:15:51,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {1387#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1387#false} is VALID [2018-11-23 12:15:51,322 INFO L256 TraceCheckUtils]: 39: Hoare triple {1387#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {1386#true} is VALID [2018-11-23 12:15:51,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {1386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1386#true} is VALID [2018-11-23 12:15:51,323 INFO L273 TraceCheckUtils]: 41: Hoare triple {1386#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1386#true} is VALID [2018-11-23 12:15:51,323 INFO L273 TraceCheckUtils]: 42: Hoare triple {1386#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1386#true} is VALID [2018-11-23 12:15:51,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {1386#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1386#true} is VALID [2018-11-23 12:15:51,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {1386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#true} is VALID [2018-11-23 12:15:51,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {1386#true} assume !(~i~0 < 10); {1386#true} is VALID [2018-11-23 12:15:51,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {1386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1386#true} is VALID [2018-11-23 12:15:51,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 12:15:51,325 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {1386#true} {1387#false} #81#return; {1387#false} is VALID [2018-11-23 12:15:51,325 INFO L273 TraceCheckUtils]: 49: Hoare triple {1387#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1387#false} is VALID [2018-11-23 12:15:51,325 INFO L273 TraceCheckUtils]: 50: Hoare triple {1387#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1387#false} is VALID [2018-11-23 12:15:51,325 INFO L273 TraceCheckUtils]: 51: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2018-11-23 12:15:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 12:15:51,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:51,329 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:15:51,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:15:51,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:15:51,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:15:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:51,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:52,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2018-11-23 12:15:52,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {1386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1386#true} is VALID [2018-11-23 12:15:52,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 12:15:52,178 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1386#true} {1386#true} #73#return; {1386#true} is VALID [2018-11-23 12:15:52,178 INFO L256 TraceCheckUtils]: 4: Hoare triple {1386#true} call #t~ret14 := main(); {1386#true} is VALID [2018-11-23 12:15:52,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {1386#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; {1386#true} is VALID [2018-11-23 12:15:52,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {1386#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1386#true} is VALID [2018-11-23 12:15:52,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {1386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1386#true} is VALID [2018-11-23 12:15:52,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {1386#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1386#true} is VALID [2018-11-23 12:15:52,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {1386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1386#true} is VALID [2018-11-23 12:15:52,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {1386#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1386#true} is VALID [2018-11-23 12:15:52,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {1386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1386#true} is VALID [2018-11-23 12:15:52,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {1386#true} assume !(~i~1 < 10); {1386#true} is VALID [2018-11-23 12:15:52,181 INFO L256 TraceCheckUtils]: 13: Hoare triple {1386#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {1386#true} is VALID [2018-11-23 12:15:52,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {1386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1386#true} is VALID [2018-11-23 12:15:52,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {1386#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1386#true} is VALID [2018-11-23 12:15:52,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1386#true} is VALID [2018-11-23 12:15:52,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1386#true} is VALID [2018-11-23 12:15:52,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {1386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#true} is VALID [2018-11-23 12:15:52,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {1386#true} assume !(~i~0 < 10); {1386#true} is VALID [2018-11-23 12:15:52,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {1386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1386#true} is VALID [2018-11-23 12:15:52,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 12:15:52,183 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1386#true} {1386#true} #77#return; {1386#true} is VALID [2018-11-23 12:15:52,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {1386#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1386#true} is VALID [2018-11-23 12:15:52,184 INFO L256 TraceCheckUtils]: 24: Hoare triple {1386#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {1386#true} is VALID [2018-11-23 12:15:52,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {1386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1386#true} is VALID [2018-11-23 12:15:52,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {1386#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1386#true} is VALID [2018-11-23 12:15:52,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {1386#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1386#true} is VALID [2018-11-23 12:15:52,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {1386#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1386#true} is VALID [2018-11-23 12:15:52,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {1386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1386#true} is VALID [2018-11-23 12:15:52,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {1386#true} assume !(~i~0 < 10); {1386#true} is VALID [2018-11-23 12:15:52,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {1386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1386#true} is VALID [2018-11-23 12:15:52,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {1386#true} assume true; {1386#true} is VALID [2018-11-23 12:15:52,186 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1386#true} {1386#true} #79#return; {1386#true} is VALID [2018-11-23 12:15:52,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {1386#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1386#true} is VALID [2018-11-23 12:15:52,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {1386#true} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1386#true} is VALID [2018-11-23 12:15:52,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {1386#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1386#true} is VALID [2018-11-23 12:15:52,187 INFO L273 TraceCheckUtils]: 37: Hoare triple {1386#true} assume !(~i~2 < 9); {1386#true} is VALID [2018-11-23 12:15:52,187 INFO L273 TraceCheckUtils]: 38: Hoare triple {1386#true} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1386#true} is VALID [2018-11-23 12:15:52,187 INFO L256 TraceCheckUtils]: 39: Hoare triple {1386#true} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {1386#true} is VALID [2018-11-23 12:15:52,188 INFO L273 TraceCheckUtils]: 40: Hoare triple {1386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1515#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:52,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {1515#(<= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1515#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:52,192 INFO L273 TraceCheckUtils]: 42: Hoare triple {1515#(<= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1515#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:52,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {1515#(<= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1515#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:52,196 INFO L273 TraceCheckUtils]: 44: Hoare triple {1515#(<= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1528#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:52,198 INFO L273 TraceCheckUtils]: 45: Hoare triple {1528#(<= max_~i~0 1)} assume !(~i~0 < 10); {1387#false} is VALID [2018-11-23 12:15:52,198 INFO L273 TraceCheckUtils]: 46: Hoare triple {1387#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1387#false} is VALID [2018-11-23 12:15:52,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {1387#false} assume true; {1387#false} is VALID [2018-11-23 12:15:52,198 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {1387#false} {1386#true} #81#return; {1387#false} is VALID [2018-11-23 12:15:52,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {1387#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1387#false} is VALID [2018-11-23 12:15:52,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {1387#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1387#false} is VALID [2018-11-23 12:15:52,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2018-11-23 12:15:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:15:52,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:52,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:15:52,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-23 12:15:52,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:52,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:15:52,362 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:15:52,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:15:52,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:15:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:15:52,363 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 8 states. [2018-11-23 12:15:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:52,790 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2018-11-23 12:15:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:15:52,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-23 12:15:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:15:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2018-11-23 12:15:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:15:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2018-11-23 12:15:52,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2018-11-23 12:15:52,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:52,941 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:15:52,942 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:15:52,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:15:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:15:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-23 12:15:52,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:52,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2018-11-23 12:15:52,962 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2018-11-23 12:15:52,963 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2018-11-23 12:15:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:52,966 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:15:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:15:52,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:52,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:52,967 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2018-11-23 12:15:52,967 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2018-11-23 12:15:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:52,970 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:15:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 12:15:52,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:52,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:52,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:52,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:15:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 12:15:52,973 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 52 [2018-11-23 12:15:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:52,974 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 12:15:52,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:15:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:15:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:15:52,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:52,975 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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:15:52,975 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:52,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:52,976 INFO L82 PathProgramCache]: Analyzing trace with hash 454933031, now seen corresponding path program 4 times [2018-11-23 12:15:52,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:52,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:52,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:15:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:53,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {1791#true} call ULTIMATE.init(); {1791#true} is VALID [2018-11-23 12:15:53,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {1791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1791#true} is VALID [2018-11-23 12:15:53,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {1791#true} assume true; {1791#true} is VALID [2018-11-23 12:15:53,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1791#true} {1791#true} #73#return; {1791#true} is VALID [2018-11-23 12:15:53,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {1791#true} call #t~ret14 := main(); {1791#true} is VALID [2018-11-23 12:15:53,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {1791#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; {1793#(= main_~i~1 0)} is VALID [2018-11-23 12:15:53,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {1793#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1793#(= main_~i~1 0)} is VALID [2018-11-23 12:15:53,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {1793#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1794#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:53,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {1794#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1794#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:53,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {1794#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1795#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:53,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {1795#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1795#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:53,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {1795#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1796#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:53,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {1796#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1796#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:53,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {1796#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1797#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:53,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {1797#(<= main_~i~1 4)} assume !(~i~1 < 10); {1792#false} is VALID [2018-11-23 12:15:53,149 INFO L256 TraceCheckUtils]: 15: Hoare triple {1792#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {1791#true} is VALID [2018-11-23 12:15:53,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {1791#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1791#true} is VALID [2018-11-23 12:15:53,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {1791#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1791#true} is VALID [2018-11-23 12:15:53,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {1791#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1791#true} is VALID [2018-11-23 12:15:53,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {1791#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1791#true} is VALID [2018-11-23 12:15:53,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {1791#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1791#true} is VALID [2018-11-23 12:15:53,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {1791#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1791#true} is VALID [2018-11-23 12:15:53,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {1791#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1791#true} is VALID [2018-11-23 12:15:53,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {1791#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1791#true} is VALID [2018-11-23 12:15:53,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {1791#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1791#true} is VALID [2018-11-23 12:15:53,151 INFO L273 TraceCheckUtils]: 25: Hoare triple {1791#true} assume !(~i~0 < 10); {1791#true} is VALID [2018-11-23 12:15:53,151 INFO L273 TraceCheckUtils]: 26: Hoare triple {1791#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1791#true} is VALID [2018-11-23 12:15:53,152 INFO L273 TraceCheckUtils]: 27: Hoare triple {1791#true} assume true; {1791#true} is VALID [2018-11-23 12:15:53,152 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1791#true} {1792#false} #77#return; {1792#false} is VALID [2018-11-23 12:15:53,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {1792#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1792#false} is VALID [2018-11-23 12:15:53,152 INFO L256 TraceCheckUtils]: 30: Hoare triple {1792#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {1791#true} is VALID [2018-11-23 12:15:53,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {1791#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1791#true} is VALID [2018-11-23 12:15:53,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {1791#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1791#true} is VALID [2018-11-23 12:15:53,153 INFO L273 TraceCheckUtils]: 33: Hoare triple {1791#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1791#true} is VALID [2018-11-23 12:15:53,153 INFO L273 TraceCheckUtils]: 34: Hoare triple {1791#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1791#true} is VALID [2018-11-23 12:15:53,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {1791#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1791#true} is VALID [2018-11-23 12:15:53,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {1791#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1791#true} is VALID [2018-11-23 12:15:53,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {1791#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1791#true} is VALID [2018-11-23 12:15:53,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {1791#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1791#true} is VALID [2018-11-23 12:15:53,154 INFO L273 TraceCheckUtils]: 39: Hoare triple {1791#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1791#true} is VALID [2018-11-23 12:15:53,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {1791#true} assume !(~i~0 < 10); {1791#true} is VALID [2018-11-23 12:15:53,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {1791#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1791#true} is VALID [2018-11-23 12:15:53,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {1791#true} assume true; {1791#true} is VALID [2018-11-23 12:15:53,154 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1791#true} {1792#false} #79#return; {1792#false} is VALID [2018-11-23 12:15:53,155 INFO L273 TraceCheckUtils]: 44: Hoare triple {1792#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1792#false} is VALID [2018-11-23 12:15:53,155 INFO L273 TraceCheckUtils]: 45: Hoare triple {1792#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1792#false} is VALID [2018-11-23 12:15:53,155 INFO L273 TraceCheckUtils]: 46: Hoare triple {1792#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1792#false} is VALID [2018-11-23 12:15:53,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {1792#false} assume !(~i~2 < 9); {1792#false} is VALID [2018-11-23 12:15:53,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {1792#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1792#false} is VALID [2018-11-23 12:15:53,155 INFO L256 TraceCheckUtils]: 49: Hoare triple {1792#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {1791#true} is VALID [2018-11-23 12:15:53,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {1791#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1791#true} is VALID [2018-11-23 12:15:53,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {1791#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1791#true} is VALID [2018-11-23 12:15:53,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {1791#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1791#true} is VALID [2018-11-23 12:15:53,156 INFO L273 TraceCheckUtils]: 53: Hoare triple {1791#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1791#true} is VALID [2018-11-23 12:15:53,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {1791#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1791#true} is VALID [2018-11-23 12:15:53,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {1791#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1791#true} is VALID [2018-11-23 12:15:53,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {1791#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1791#true} is VALID [2018-11-23 12:15:53,157 INFO L273 TraceCheckUtils]: 57: Hoare triple {1791#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1791#true} is VALID [2018-11-23 12:15:53,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {1791#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1791#true} is VALID [2018-11-23 12:15:53,157 INFO L273 TraceCheckUtils]: 59: Hoare triple {1791#true} assume !(~i~0 < 10); {1791#true} is VALID [2018-11-23 12:15:53,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {1791#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1791#true} is VALID [2018-11-23 12:15:53,157 INFO L273 TraceCheckUtils]: 61: Hoare triple {1791#true} assume true; {1791#true} is VALID [2018-11-23 12:15:53,158 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {1791#true} {1792#false} #81#return; {1792#false} is VALID [2018-11-23 12:15:53,158 INFO L273 TraceCheckUtils]: 63: Hoare triple {1792#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1792#false} is VALID [2018-11-23 12:15:53,158 INFO L273 TraceCheckUtils]: 64: Hoare triple {1792#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1792#false} is VALID [2018-11-23 12:15:53,158 INFO L273 TraceCheckUtils]: 65: Hoare triple {1792#false} assume !false; {1792#false} is VALID [2018-11-23 12:15:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-23 12:15:53,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:53,164 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:15:53,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:15:53,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:15:53,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:15:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:53,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:53,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1791#true} call ULTIMATE.init(); {1791#true} is VALID [2018-11-23 12:15:53,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {1791#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1791#true} is VALID [2018-11-23 12:15:53,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {1791#true} assume true; {1791#true} is VALID [2018-11-23 12:15:53,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1791#true} {1791#true} #73#return; {1791#true} is VALID [2018-11-23 12:15:53,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {1791#true} call #t~ret14 := main(); {1791#true} is VALID [2018-11-23 12:15:53,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {1791#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; {1791#true} is VALID [2018-11-23 12:15:53,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {1791#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1791#true} is VALID [2018-11-23 12:15:53,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {1791#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1791#true} is VALID [2018-11-23 12:15:53,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {1791#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1791#true} is VALID [2018-11-23 12:15:53,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {1791#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1791#true} is VALID [2018-11-23 12:15:53,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {1791#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1791#true} is VALID [2018-11-23 12:15:53,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {1791#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1791#true} is VALID [2018-11-23 12:15:53,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {1791#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1791#true} is VALID [2018-11-23 12:15:53,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {1791#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1791#true} is VALID [2018-11-23 12:15:53,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {1791#true} assume !(~i~1 < 10); {1791#true} is VALID [2018-11-23 12:15:53,402 INFO L256 TraceCheckUtils]: 15: Hoare triple {1791#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {1791#true} is VALID [2018-11-23 12:15:53,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {1791#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1849#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:53,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {1849#(<= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1849#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:53,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {1849#(<= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1849#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:53,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {1849#(<= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1849#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:53,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {1849#(<= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1862#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:53,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {1862#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1862#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:53,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {1862#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1862#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:53,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {1862#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1862#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:53,420 INFO L273 TraceCheckUtils]: 24: Hoare triple {1862#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1875#(<= max_~i~0 2)} is VALID [2018-11-23 12:15:53,421 INFO L273 TraceCheckUtils]: 25: Hoare triple {1875#(<= max_~i~0 2)} assume !(~i~0 < 10); {1792#false} is VALID [2018-11-23 12:15:53,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {1792#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1792#false} is VALID [2018-11-23 12:15:53,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {1792#false} assume true; {1792#false} is VALID [2018-11-23 12:15:53,422 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1792#false} {1791#true} #77#return; {1792#false} is VALID [2018-11-23 12:15:53,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {1792#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1792#false} is VALID [2018-11-23 12:15:53,423 INFO L256 TraceCheckUtils]: 30: Hoare triple {1792#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {1792#false} is VALID [2018-11-23 12:15:53,423 INFO L273 TraceCheckUtils]: 31: Hoare triple {1792#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1792#false} is VALID [2018-11-23 12:15:53,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {1792#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1792#false} is VALID [2018-11-23 12:15:53,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {1792#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1792#false} is VALID [2018-11-23 12:15:53,424 INFO L273 TraceCheckUtils]: 34: Hoare triple {1792#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1792#false} is VALID [2018-11-23 12:15:53,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {1792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1792#false} is VALID [2018-11-23 12:15:53,424 INFO L273 TraceCheckUtils]: 36: Hoare triple {1792#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1792#false} is VALID [2018-11-23 12:15:53,424 INFO L273 TraceCheckUtils]: 37: Hoare triple {1792#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1792#false} is VALID [2018-11-23 12:15:53,424 INFO L273 TraceCheckUtils]: 38: Hoare triple {1792#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1792#false} is VALID [2018-11-23 12:15:53,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {1792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1792#false} is VALID [2018-11-23 12:15:53,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {1792#false} assume !(~i~0 < 10); {1792#false} is VALID [2018-11-23 12:15:53,425 INFO L273 TraceCheckUtils]: 41: Hoare triple {1792#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1792#false} is VALID [2018-11-23 12:15:53,425 INFO L273 TraceCheckUtils]: 42: Hoare triple {1792#false} assume true; {1792#false} is VALID [2018-11-23 12:15:53,425 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1792#false} {1792#false} #79#return; {1792#false} is VALID [2018-11-23 12:15:53,425 INFO L273 TraceCheckUtils]: 44: Hoare triple {1792#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1792#false} is VALID [2018-11-23 12:15:53,425 INFO L273 TraceCheckUtils]: 45: Hoare triple {1792#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1792#false} is VALID [2018-11-23 12:15:53,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {1792#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1792#false} is VALID [2018-11-23 12:15:53,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {1792#false} assume !(~i~2 < 9); {1792#false} is VALID [2018-11-23 12:15:53,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {1792#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1792#false} is VALID [2018-11-23 12:15:53,426 INFO L256 TraceCheckUtils]: 49: Hoare triple {1792#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {1792#false} is VALID [2018-11-23 12:15:53,426 INFO L273 TraceCheckUtils]: 50: Hoare triple {1792#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {1792#false} is VALID [2018-11-23 12:15:53,426 INFO L273 TraceCheckUtils]: 51: Hoare triple {1792#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1792#false} is VALID [2018-11-23 12:15:53,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {1792#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1792#false} is VALID [2018-11-23 12:15:53,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {1792#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1792#false} is VALID [2018-11-23 12:15:53,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {1792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1792#false} is VALID [2018-11-23 12:15:53,427 INFO L273 TraceCheckUtils]: 55: Hoare triple {1792#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1792#false} is VALID [2018-11-23 12:15:53,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {1792#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {1792#false} is VALID [2018-11-23 12:15:53,427 INFO L273 TraceCheckUtils]: 57: Hoare triple {1792#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {1792#false} is VALID [2018-11-23 12:15:53,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {1792#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1792#false} is VALID [2018-11-23 12:15:53,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {1792#false} assume !(~i~0 < 10); {1792#false} is VALID [2018-11-23 12:15:53,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {1792#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1792#false} is VALID [2018-11-23 12:15:53,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {1792#false} assume true; {1792#false} is VALID [2018-11-23 12:15:53,428 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {1792#false} {1792#false} #81#return; {1792#false} is VALID [2018-11-23 12:15:53,428 INFO L273 TraceCheckUtils]: 63: Hoare triple {1792#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1792#false} is VALID [2018-11-23 12:15:53,429 INFO L273 TraceCheckUtils]: 64: Hoare triple {1792#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1792#false} is VALID [2018-11-23 12:15:53,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {1792#false} assume !false; {1792#false} is VALID [2018-11-23 12:15:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 12:15:53,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:53,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-23 12:15:53,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-23 12:15:53,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:53,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:15:53,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:53,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:15:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:15:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:15:53,561 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 10 states. [2018-11-23 12:15:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:54,030 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-11-23 12:15:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:15:54,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-23 12:15:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:15:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2018-11-23 12:15:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:15:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2018-11-23 12:15:54,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 87 transitions. [2018-11-23 12:15:54,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:54,245 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:15:54,245 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:15:54,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:15:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:15:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-23 12:15:54,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:54,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-23 12:15:54,272 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-23 12:15:54,272 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-23 12:15:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:54,275 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 12:15:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 12:15:54,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:54,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:54,276 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-23 12:15:54,276 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-23 12:15:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:54,278 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 12:15:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 12:15:54,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:54,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:54,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:54,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:15:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-23 12:15:54,281 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 66 [2018-11-23 12:15:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:54,282 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-23 12:15:54,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:15:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 12:15:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 12:15:54,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:54,283 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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:15:54,283 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:54,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1150375548, now seen corresponding path program 5 times [2018-11-23 12:15:54,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:54,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:54,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:15:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:54,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {2273#true} call ULTIMATE.init(); {2273#true} is VALID [2018-11-23 12:15:54,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {2273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2273#true} is VALID [2018-11-23 12:15:54,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {2273#true} assume true; {2273#true} is VALID [2018-11-23 12:15:54,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2273#true} {2273#true} #73#return; {2273#true} is VALID [2018-11-23 12:15:54,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {2273#true} call #t~ret14 := main(); {2273#true} is VALID [2018-11-23 12:15:54,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {2273#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; {2275#(= main_~i~1 0)} is VALID [2018-11-23 12:15:54,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {2275#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2275#(= main_~i~1 0)} is VALID [2018-11-23 12:15:54,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {2275#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2276#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:54,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {2276#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2276#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:54,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {2276#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2277#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:54,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {2277#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2277#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:54,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {2277#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2278#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:54,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {2278#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2278#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:54,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {2278#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2279#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:54,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {2279#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2279#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:54,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {2279#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2280#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:54,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {2280#(<= main_~i~1 5)} assume !(~i~1 < 10); {2274#false} is VALID [2018-11-23 12:15:54,858 INFO L256 TraceCheckUtils]: 17: Hoare triple {2274#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {2273#true} is VALID [2018-11-23 12:15:54,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {2273#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 22: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 24: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 25: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L273 TraceCheckUtils]: 27: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L273 TraceCheckUtils]: 29: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L273 TraceCheckUtils]: 30: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L273 TraceCheckUtils]: 31: Hoare triple {2273#true} assume !(~i~0 < 10); {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L273 TraceCheckUtils]: 32: Hoare triple {2273#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L273 TraceCheckUtils]: 33: Hoare triple {2273#true} assume true; {2273#true} is VALID [2018-11-23 12:15:54,860 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2273#true} {2274#false} #77#return; {2274#false} is VALID [2018-11-23 12:15:54,861 INFO L273 TraceCheckUtils]: 35: Hoare triple {2274#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2274#false} is VALID [2018-11-23 12:15:54,861 INFO L256 TraceCheckUtils]: 36: Hoare triple {2274#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {2273#true} is VALID [2018-11-23 12:15:54,861 INFO L273 TraceCheckUtils]: 37: Hoare triple {2273#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2273#true} is VALID [2018-11-23 12:15:54,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 43: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 45: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 48: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 49: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,862 INFO L273 TraceCheckUtils]: 50: Hoare triple {2273#true} assume !(~i~0 < 10); {2273#true} is VALID [2018-11-23 12:15:54,863 INFO L273 TraceCheckUtils]: 51: Hoare triple {2273#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2273#true} is VALID [2018-11-23 12:15:54,863 INFO L273 TraceCheckUtils]: 52: Hoare triple {2273#true} assume true; {2273#true} is VALID [2018-11-23 12:15:54,863 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {2273#true} {2274#false} #79#return; {2274#false} is VALID [2018-11-23 12:15:54,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {2274#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2274#false} is VALID [2018-11-23 12:15:54,863 INFO L273 TraceCheckUtils]: 55: Hoare triple {2274#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2274#false} is VALID [2018-11-23 12:15:54,863 INFO L273 TraceCheckUtils]: 56: Hoare triple {2274#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2274#false} is VALID [2018-11-23 12:15:54,863 INFO L273 TraceCheckUtils]: 57: Hoare triple {2274#false} assume !(~i~2 < 9); {2274#false} is VALID [2018-11-23 12:15:54,864 INFO L273 TraceCheckUtils]: 58: Hoare triple {2274#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2274#false} is VALID [2018-11-23 12:15:54,864 INFO L256 TraceCheckUtils]: 59: Hoare triple {2274#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {2273#true} is VALID [2018-11-23 12:15:54,864 INFO L273 TraceCheckUtils]: 60: Hoare triple {2273#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2273#true} is VALID [2018-11-23 12:15:54,864 INFO L273 TraceCheckUtils]: 61: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,864 INFO L273 TraceCheckUtils]: 63: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,864 INFO L273 TraceCheckUtils]: 64: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,865 INFO L273 TraceCheckUtils]: 65: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,865 INFO L273 TraceCheckUtils]: 66: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,865 INFO L273 TraceCheckUtils]: 67: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,865 INFO L273 TraceCheckUtils]: 68: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,865 INFO L273 TraceCheckUtils]: 69: Hoare triple {2273#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2273#true} is VALID [2018-11-23 12:15:54,866 INFO L273 TraceCheckUtils]: 70: Hoare triple {2273#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2273#true} is VALID [2018-11-23 12:15:54,866 INFO L273 TraceCheckUtils]: 71: Hoare triple {2273#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2273#true} is VALID [2018-11-23 12:15:54,866 INFO L273 TraceCheckUtils]: 72: Hoare triple {2273#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2273#true} is VALID [2018-11-23 12:15:54,866 INFO L273 TraceCheckUtils]: 73: Hoare triple {2273#true} assume !(~i~0 < 10); {2273#true} is VALID [2018-11-23 12:15:54,866 INFO L273 TraceCheckUtils]: 74: Hoare triple {2273#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2273#true} is VALID [2018-11-23 12:15:54,867 INFO L273 TraceCheckUtils]: 75: Hoare triple {2273#true} assume true; {2273#true} is VALID [2018-11-23 12:15:54,867 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {2273#true} {2274#false} #81#return; {2274#false} is VALID [2018-11-23 12:15:54,867 INFO L273 TraceCheckUtils]: 77: Hoare triple {2274#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2274#false} is VALID [2018-11-23 12:15:54,867 INFO L273 TraceCheckUtils]: 78: Hoare triple {2274#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2274#false} is VALID [2018-11-23 12:15:54,867 INFO L273 TraceCheckUtils]: 79: Hoare triple {2274#false} assume !false; {2274#false} is VALID [2018-11-23 12:15:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-23 12:15:54,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:54,871 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:15:54,882 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:15:54,930 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:15:54,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:15:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:54,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:55,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {2273#true} call ULTIMATE.init(); {2273#true} is VALID [2018-11-23 12:15:55,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {2273#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2273#true} is VALID [2018-11-23 12:15:55,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {2273#true} assume true; {2273#true} is VALID [2018-11-23 12:15:55,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2273#true} {2273#true} #73#return; {2273#true} is VALID [2018-11-23 12:15:55,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {2273#true} call #t~ret14 := main(); {2273#true} is VALID [2018-11-23 12:15:55,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {2273#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; {2273#true} is VALID [2018-11-23 12:15:55,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {2273#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2273#true} is VALID [2018-11-23 12:15:55,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {2273#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2273#true} is VALID [2018-11-23 12:15:55,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {2273#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2273#true} is VALID [2018-11-23 12:15:55,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {2273#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2273#true} is VALID [2018-11-23 12:15:55,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {2273#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2273#true} is VALID [2018-11-23 12:15:55,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {2273#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2273#true} is VALID [2018-11-23 12:15:55,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {2273#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2273#true} is VALID [2018-11-23 12:15:55,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {2273#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2273#true} is VALID [2018-11-23 12:15:55,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {2273#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2273#true} is VALID [2018-11-23 12:15:55,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {2273#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2273#true} is VALID [2018-11-23 12:15:55,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {2273#true} assume !(~i~1 < 10); {2273#true} is VALID [2018-11-23 12:15:55,223 INFO L256 TraceCheckUtils]: 17: Hoare triple {2273#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {2273#true} is VALID [2018-11-23 12:15:55,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {2273#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2338#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:55,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {2338#(<= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2338#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:55,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {2338#(<= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2338#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:55,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {2338#(<= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2338#(<= max_~i~0 0)} is VALID [2018-11-23 12:15:55,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {2338#(<= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2351#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:55,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {2351#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2351#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:55,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {2351#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2351#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:55,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {2351#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2351#(<= max_~i~0 1)} is VALID [2018-11-23 12:15:55,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {2351#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2364#(<= max_~i~0 2)} is VALID [2018-11-23 12:15:55,250 INFO L273 TraceCheckUtils]: 27: Hoare triple {2364#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2364#(<= max_~i~0 2)} is VALID [2018-11-23 12:15:55,250 INFO L273 TraceCheckUtils]: 28: Hoare triple {2364#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2364#(<= max_~i~0 2)} is VALID [2018-11-23 12:15:55,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {2364#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2364#(<= max_~i~0 2)} is VALID [2018-11-23 12:15:55,251 INFO L273 TraceCheckUtils]: 30: Hoare triple {2364#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2377#(<= max_~i~0 3)} is VALID [2018-11-23 12:15:55,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {2377#(<= max_~i~0 3)} assume !(~i~0 < 10); {2274#false} is VALID [2018-11-23 12:15:55,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {2274#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2274#false} is VALID [2018-11-23 12:15:55,252 INFO L273 TraceCheckUtils]: 33: Hoare triple {2274#false} assume true; {2274#false} is VALID [2018-11-23 12:15:55,252 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2274#false} {2273#true} #77#return; {2274#false} is VALID [2018-11-23 12:15:55,253 INFO L273 TraceCheckUtils]: 35: Hoare triple {2274#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2274#false} is VALID [2018-11-23 12:15:55,253 INFO L256 TraceCheckUtils]: 36: Hoare triple {2274#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {2274#false} is VALID [2018-11-23 12:15:55,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {2274#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2274#false} is VALID [2018-11-23 12:15:55,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {2274#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2274#false} is VALID [2018-11-23 12:15:55,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {2274#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2274#false} is VALID [2018-11-23 12:15:55,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {2274#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {2274#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {2274#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 43: Hoare triple {2274#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {2274#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 45: Hoare triple {2274#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {2274#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {2274#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2274#false} is VALID [2018-11-23 12:15:55,254 INFO L273 TraceCheckUtils]: 48: Hoare triple {2274#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L273 TraceCheckUtils]: 49: Hoare triple {2274#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L273 TraceCheckUtils]: 50: Hoare triple {2274#false} assume !(~i~0 < 10); {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {2274#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L273 TraceCheckUtils]: 52: Hoare triple {2274#false} assume true; {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {2274#false} {2274#false} #79#return; {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {2274#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {2274#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2274#false} is VALID [2018-11-23 12:15:55,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {2274#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {2274#false} assume !(~i~2 < 9); {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L273 TraceCheckUtils]: 58: Hoare triple {2274#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L256 TraceCheckUtils]: 59: Hoare triple {2274#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {2274#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L273 TraceCheckUtils]: 61: Hoare triple {2274#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {2274#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {2274#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2274#false} is VALID [2018-11-23 12:15:55,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {2274#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 65: Hoare triple {2274#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 66: Hoare triple {2274#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 67: Hoare triple {2274#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {2274#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 69: Hoare triple {2274#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 70: Hoare triple {2274#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 71: Hoare triple {2274#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2274#false} is VALID [2018-11-23 12:15:55,257 INFO L273 TraceCheckUtils]: 72: Hoare triple {2274#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2274#false} is VALID [2018-11-23 12:15:55,258 INFO L273 TraceCheckUtils]: 73: Hoare triple {2274#false} assume !(~i~0 < 10); {2274#false} is VALID [2018-11-23 12:15:55,258 INFO L273 TraceCheckUtils]: 74: Hoare triple {2274#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2274#false} is VALID [2018-11-23 12:15:55,258 INFO L273 TraceCheckUtils]: 75: Hoare triple {2274#false} assume true; {2274#false} is VALID [2018-11-23 12:15:55,258 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {2274#false} {2274#false} #81#return; {2274#false} is VALID [2018-11-23 12:15:55,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {2274#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2274#false} is VALID [2018-11-23 12:15:55,258 INFO L273 TraceCheckUtils]: 78: Hoare triple {2274#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2274#false} is VALID [2018-11-23 12:15:55,258 INFO L273 TraceCheckUtils]: 79: Hoare triple {2274#false} assume !false; {2274#false} is VALID [2018-11-23 12:15:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-23 12:15:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 12:15:55,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-11-23 12:15:55,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:55,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:15:55,377 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:15:55,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:15:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:15:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:15:55,378 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 12 states. [2018-11-23 12:15:55,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:55,832 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2018-11-23 12:15:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:15:55,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-11-23 12:15:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:15:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2018-11-23 12:15:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:15:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2018-11-23 12:15:55,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 94 transitions. [2018-11-23 12:15:56,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:56,045 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:15:56,046 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:15:56,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 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:15:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:15:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-23 12:15:56,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:56,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-23 12:15:56,079 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-23 12:15:56,079 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-23 12:15:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:56,083 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:15:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 12:15:56,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:56,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:56,084 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-23 12:15:56,084 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-23 12:15:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:56,086 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:15:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 12:15:56,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:56,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:56,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:56,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:15:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 12:15:56,090 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 80 [2018-11-23 12:15:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:56,091 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 12:15:56,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:15:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 12:15:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:15:56,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:56,092 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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:15:56,093 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:56,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash -493553183, now seen corresponding path program 6 times [2018-11-23 12:15:56,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:56,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:15:56,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:56,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {2832#true} call ULTIMATE.init(); {2832#true} is VALID [2018-11-23 12:15:56,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {2832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2832#true} is VALID [2018-11-23 12:15:56,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {2832#true} assume true; {2832#true} is VALID [2018-11-23 12:15:56,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2832#true} {2832#true} #73#return; {2832#true} is VALID [2018-11-23 12:15:56,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {2832#true} call #t~ret14 := main(); {2832#true} is VALID [2018-11-23 12:15:56,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {2832#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; {2834#(= main_~i~1 0)} is VALID [2018-11-23 12:15:56,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {2834#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2834#(= main_~i~1 0)} is VALID [2018-11-23 12:15:56,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {2834#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2835#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:56,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {2835#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2835#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:56,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {2835#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2836#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:56,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {2836#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2836#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:56,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {2836#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2837#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:56,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {2837#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2837#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:56,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {2837#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2838#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:56,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {2838#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2838#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:56,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {2838#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2839#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:56,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {2839#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2839#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:56,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {2839#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2840#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:56,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {2840#(<= main_~i~1 6)} assume !(~i~1 < 10); {2833#false} is VALID [2018-11-23 12:15:56,399 INFO L256 TraceCheckUtils]: 19: Hoare triple {2833#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {2832#true} is VALID [2018-11-23 12:15:56,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {2832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2832#true} is VALID [2018-11-23 12:15:56,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,401 INFO L273 TraceCheckUtils]: 28: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,401 INFO L273 TraceCheckUtils]: 31: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {2832#true} assume !(~i~0 < 10); {2832#true} is VALID [2018-11-23 12:15:56,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {2832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2832#true} is VALID [2018-11-23 12:15:56,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {2832#true} assume true; {2832#true} is VALID [2018-11-23 12:15:56,403 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2832#true} {2833#false} #77#return; {2833#false} is VALID [2018-11-23 12:15:56,404 INFO L273 TraceCheckUtils]: 41: Hoare triple {2833#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2833#false} is VALID [2018-11-23 12:15:56,404 INFO L256 TraceCheckUtils]: 42: Hoare triple {2833#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {2832#true} is VALID [2018-11-23 12:15:56,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {2832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2832#true} is VALID [2018-11-23 12:15:56,404 INFO L273 TraceCheckUtils]: 44: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,405 INFO L273 TraceCheckUtils]: 47: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,405 INFO L273 TraceCheckUtils]: 49: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,405 INFO L273 TraceCheckUtils]: 50: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,405 INFO L273 TraceCheckUtils]: 51: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,406 INFO L273 TraceCheckUtils]: 52: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,406 INFO L273 TraceCheckUtils]: 53: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,406 INFO L273 TraceCheckUtils]: 54: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,406 INFO L273 TraceCheckUtils]: 55: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,406 INFO L273 TraceCheckUtils]: 56: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,407 INFO L273 TraceCheckUtils]: 57: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,407 INFO L273 TraceCheckUtils]: 58: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,407 INFO L273 TraceCheckUtils]: 59: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,407 INFO L273 TraceCheckUtils]: 60: Hoare triple {2832#true} assume !(~i~0 < 10); {2832#true} is VALID [2018-11-23 12:15:56,407 INFO L273 TraceCheckUtils]: 61: Hoare triple {2832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2832#true} is VALID [2018-11-23 12:15:56,407 INFO L273 TraceCheckUtils]: 62: Hoare triple {2832#true} assume true; {2832#true} is VALID [2018-11-23 12:15:56,408 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2832#true} {2833#false} #79#return; {2833#false} is VALID [2018-11-23 12:15:56,408 INFO L273 TraceCheckUtils]: 64: Hoare triple {2833#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2833#false} is VALID [2018-11-23 12:15:56,408 INFO L273 TraceCheckUtils]: 65: Hoare triple {2833#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2833#false} is VALID [2018-11-23 12:15:56,408 INFO L273 TraceCheckUtils]: 66: Hoare triple {2833#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2833#false} is VALID [2018-11-23 12:15:56,408 INFO L273 TraceCheckUtils]: 67: Hoare triple {2833#false} assume !(~i~2 < 9); {2833#false} is VALID [2018-11-23 12:15:56,408 INFO L273 TraceCheckUtils]: 68: Hoare triple {2833#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2833#false} is VALID [2018-11-23 12:15:56,409 INFO L256 TraceCheckUtils]: 69: Hoare triple {2833#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {2832#true} is VALID [2018-11-23 12:15:56,409 INFO L273 TraceCheckUtils]: 70: Hoare triple {2832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2832#true} is VALID [2018-11-23 12:15:56,409 INFO L273 TraceCheckUtils]: 71: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,409 INFO L273 TraceCheckUtils]: 72: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,409 INFO L273 TraceCheckUtils]: 73: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,409 INFO L273 TraceCheckUtils]: 74: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,410 INFO L273 TraceCheckUtils]: 75: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,410 INFO L273 TraceCheckUtils]: 76: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,410 INFO L273 TraceCheckUtils]: 77: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,410 INFO L273 TraceCheckUtils]: 78: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,410 INFO L273 TraceCheckUtils]: 79: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,411 INFO L273 TraceCheckUtils]: 80: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,411 INFO L273 TraceCheckUtils]: 81: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,411 INFO L273 TraceCheckUtils]: 82: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,411 INFO L273 TraceCheckUtils]: 83: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,411 INFO L273 TraceCheckUtils]: 84: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,411 INFO L273 TraceCheckUtils]: 85: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,412 INFO L273 TraceCheckUtils]: 86: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,412 INFO L273 TraceCheckUtils]: 87: Hoare triple {2832#true} assume !(~i~0 < 10); {2832#true} is VALID [2018-11-23 12:15:56,412 INFO L273 TraceCheckUtils]: 88: Hoare triple {2832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2832#true} is VALID [2018-11-23 12:15:56,412 INFO L273 TraceCheckUtils]: 89: Hoare triple {2832#true} assume true; {2832#true} is VALID [2018-11-23 12:15:56,412 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {2832#true} {2833#false} #81#return; {2833#false} is VALID [2018-11-23 12:15:56,412 INFO L273 TraceCheckUtils]: 91: Hoare triple {2833#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2833#false} is VALID [2018-11-23 12:15:56,413 INFO L273 TraceCheckUtils]: 92: Hoare triple {2833#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2833#false} is VALID [2018-11-23 12:15:56,413 INFO L273 TraceCheckUtils]: 93: Hoare triple {2833#false} assume !false; {2833#false} is VALID [2018-11-23 12:15:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-11-23 12:15:56,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:56,418 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:15:56,437 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:15:56,530 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:15:56,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:15:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:56,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:56,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {2832#true} call ULTIMATE.init(); {2832#true} is VALID [2018-11-23 12:15:56,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {2832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2832#true} is VALID [2018-11-23 12:15:56,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {2832#true} assume true; {2832#true} is VALID [2018-11-23 12:15:56,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2832#true} {2832#true} #73#return; {2832#true} is VALID [2018-11-23 12:15:56,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {2832#true} call #t~ret14 := main(); {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {2832#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; {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {2832#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {2832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {2832#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {2832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {2832#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {2832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2832#true} is VALID [2018-11-23 12:15:56,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {2832#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {2832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {2832#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {2832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {2832#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {2832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {2832#true} assume !(~i~1 < 10); {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L256 TraceCheckUtils]: 19: Hoare triple {2832#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {2832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2832#true} is VALID [2018-11-23 12:15:56,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 24: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 31: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 32: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 35: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {2832#true} assume !(~i~0 < 10); {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {2832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {2832#true} assume true; {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2832#true} {2832#true} #77#return; {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L273 TraceCheckUtils]: 41: Hoare triple {2832#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L256 TraceCheckUtils]: 42: Hoare triple {2832#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {2832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L273 TraceCheckUtils]: 45: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,810 INFO L273 TraceCheckUtils]: 46: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 47: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 48: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 49: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 50: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 51: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 52: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 53: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,811 INFO L273 TraceCheckUtils]: 54: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 55: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 56: Hoare triple {2832#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 57: Hoare triple {2832#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 58: Hoare triple {2832#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 59: Hoare triple {2832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 60: Hoare triple {2832#true} assume !(~i~0 < 10); {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 61: Hoare triple {2832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2832#true} is VALID [2018-11-23 12:15:56,812 INFO L273 TraceCheckUtils]: 62: Hoare triple {2832#true} assume true; {2832#true} is VALID [2018-11-23 12:15:56,813 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {2832#true} {2832#true} #79#return; {2832#true} is VALID [2018-11-23 12:15:56,813 INFO L273 TraceCheckUtils]: 64: Hoare triple {2832#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3036#(<= main_~i~2 0)} is VALID [2018-11-23 12:15:56,813 INFO L273 TraceCheckUtils]: 65: Hoare triple {3036#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3036#(<= main_~i~2 0)} is VALID [2018-11-23 12:15:56,815 INFO L273 TraceCheckUtils]: 66: Hoare triple {3036#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3043#(<= main_~i~2 1)} is VALID [2018-11-23 12:15:56,815 INFO L273 TraceCheckUtils]: 67: Hoare triple {3043#(<= main_~i~2 1)} assume !(~i~2 < 9); {2833#false} is VALID [2018-11-23 12:15:56,815 INFO L273 TraceCheckUtils]: 68: Hoare triple {2833#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2833#false} is VALID [2018-11-23 12:15:56,815 INFO L256 TraceCheckUtils]: 69: Hoare triple {2833#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {2833#false} is VALID [2018-11-23 12:15:56,815 INFO L273 TraceCheckUtils]: 70: Hoare triple {2833#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 71: Hoare triple {2833#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 72: Hoare triple {2833#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 73: Hoare triple {2833#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 74: Hoare triple {2833#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 75: Hoare triple {2833#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 76: Hoare triple {2833#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 77: Hoare triple {2833#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2833#false} is VALID [2018-11-23 12:15:56,816 INFO L273 TraceCheckUtils]: 78: Hoare triple {2833#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 79: Hoare triple {2833#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 80: Hoare triple {2833#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 81: Hoare triple {2833#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 82: Hoare triple {2833#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 83: Hoare triple {2833#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 84: Hoare triple {2833#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 85: Hoare triple {2833#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {2833#false} is VALID [2018-11-23 12:15:56,817 INFO L273 TraceCheckUtils]: 86: Hoare triple {2833#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2833#false} is VALID [2018-11-23 12:15:56,818 INFO L273 TraceCheckUtils]: 87: Hoare triple {2833#false} assume !(~i~0 < 10); {2833#false} is VALID [2018-11-23 12:15:56,818 INFO L273 TraceCheckUtils]: 88: Hoare triple {2833#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2833#false} is VALID [2018-11-23 12:15:56,818 INFO L273 TraceCheckUtils]: 89: Hoare triple {2833#false} assume true; {2833#false} is VALID [2018-11-23 12:15:56,818 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {2833#false} {2833#false} #81#return; {2833#false} is VALID [2018-11-23 12:15:56,818 INFO L273 TraceCheckUtils]: 91: Hoare triple {2833#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2833#false} is VALID [2018-11-23 12:15:56,818 INFO L273 TraceCheckUtils]: 92: Hoare triple {2833#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2833#false} is VALID [2018-11-23 12:15:56,818 INFO L273 TraceCheckUtils]: 93: Hoare triple {2833#false} assume !false; {2833#false} is VALID [2018-11-23 12:15:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 154 proven. 1 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-11-23 12:15:56,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:15:56,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-23 12:15:56,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:56,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:15:56,935 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:15:56,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:15:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:15:56,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:15:56,936 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 11 states. [2018-11-23 12:15:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:57,421 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2018-11-23 12:15:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:15:57,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-11-23 12:15:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:15:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2018-11-23 12:15:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:15:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2018-11-23 12:15:57,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2018-11-23 12:15:57,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:57,511 INFO L225 Difference]: With dead ends: 93 [2018-11-23 12:15:57,511 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:15:57,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 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:15:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:15:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 12:15:57,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:57,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 12:15:57,554 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 12:15:57,554 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 12:15:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:57,556 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-23 12:15:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 12:15:57,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:57,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:57,557 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 12:15:57,557 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 12:15:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:57,565 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-23 12:15:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 12:15:57,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:57,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:57,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:57,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:15:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-23 12:15:57,569 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 94 [2018-11-23 12:15:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:57,569 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-23 12:15:57,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:15:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 12:15:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:15:57,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:57,571 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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:15:57,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:57,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash 729555201, now seen corresponding path program 7 times [2018-11-23 12:15:57,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:57,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:57,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:15:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:57,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2018-11-23 12:15:57,774 INFO L273 TraceCheckUtils]: 1: Hoare triple {3451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3451#true} is VALID [2018-11-23 12:15:57,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2018-11-23 12:15:57,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #73#return; {3451#true} is VALID [2018-11-23 12:15:57,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret14 := main(); {3451#true} is VALID [2018-11-23 12:15:57,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {3451#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; {3453#(= main_~i~1 0)} is VALID [2018-11-23 12:15:57,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {3453#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3453#(= main_~i~1 0)} is VALID [2018-11-23 12:15:57,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {3453#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3454#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:57,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {3454#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3454#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:57,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {3454#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3455#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:57,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {3455#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3455#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:57,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {3455#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3456#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:57,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {3456#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3456#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:57,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {3456#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3457#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:57,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {3457#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3457#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:57,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {3457#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3458#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:57,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {3458#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3458#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:57,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {3458#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3459#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:57,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {3459#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3459#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:57,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {3459#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3460#(<= main_~i~1 7)} is VALID [2018-11-23 12:15:57,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {3460#(<= main_~i~1 7)} assume !(~i~1 < 10); {3452#false} is VALID [2018-11-23 12:15:57,786 INFO L256 TraceCheckUtils]: 21: Hoare triple {3452#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {3451#true} is VALID [2018-11-23 12:15:57,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {3451#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3451#true} is VALID [2018-11-23 12:15:57,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,788 INFO L273 TraceCheckUtils]: 28: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,788 INFO L273 TraceCheckUtils]: 29: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,789 INFO L273 TraceCheckUtils]: 30: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,789 INFO L273 TraceCheckUtils]: 31: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,789 INFO L273 TraceCheckUtils]: 32: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,789 INFO L273 TraceCheckUtils]: 33: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,790 INFO L273 TraceCheckUtils]: 34: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,790 INFO L273 TraceCheckUtils]: 35: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,790 INFO L273 TraceCheckUtils]: 36: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,790 INFO L273 TraceCheckUtils]: 37: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,791 INFO L273 TraceCheckUtils]: 38: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,791 INFO L273 TraceCheckUtils]: 39: Hoare triple {3451#true} assume !(~i~0 < 10); {3451#true} is VALID [2018-11-23 12:15:57,791 INFO L273 TraceCheckUtils]: 40: Hoare triple {3451#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3451#true} is VALID [2018-11-23 12:15:57,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {3451#true} assume true; {3451#true} is VALID [2018-11-23 12:15:57,791 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3451#true} {3452#false} #77#return; {3452#false} is VALID [2018-11-23 12:15:57,791 INFO L273 TraceCheckUtils]: 43: Hoare triple {3452#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3452#false} is VALID [2018-11-23 12:15:57,792 INFO L256 TraceCheckUtils]: 44: Hoare triple {3452#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {3451#true} is VALID [2018-11-23 12:15:57,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {3451#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3451#true} is VALID [2018-11-23 12:15:57,792 INFO L273 TraceCheckUtils]: 46: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,792 INFO L273 TraceCheckUtils]: 47: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,792 INFO L273 TraceCheckUtils]: 48: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,793 INFO L273 TraceCheckUtils]: 50: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,794 INFO L273 TraceCheckUtils]: 56: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,794 INFO L273 TraceCheckUtils]: 57: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,794 INFO L273 TraceCheckUtils]: 58: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,794 INFO L273 TraceCheckUtils]: 59: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,794 INFO L273 TraceCheckUtils]: 60: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,794 INFO L273 TraceCheckUtils]: 61: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,795 INFO L273 TraceCheckUtils]: 62: Hoare triple {3451#true} assume !(~i~0 < 10); {3451#true} is VALID [2018-11-23 12:15:57,795 INFO L273 TraceCheckUtils]: 63: Hoare triple {3451#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3451#true} is VALID [2018-11-23 12:15:57,795 INFO L273 TraceCheckUtils]: 64: Hoare triple {3451#true} assume true; {3451#true} is VALID [2018-11-23 12:15:57,795 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3451#true} {3452#false} #79#return; {3452#false} is VALID [2018-11-23 12:15:57,795 INFO L273 TraceCheckUtils]: 66: Hoare triple {3452#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3452#false} is VALID [2018-11-23 12:15:57,795 INFO L273 TraceCheckUtils]: 67: Hoare triple {3452#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3452#false} is VALID [2018-11-23 12:15:57,795 INFO L273 TraceCheckUtils]: 68: Hoare triple {3452#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3452#false} is VALID [2018-11-23 12:15:57,795 INFO L273 TraceCheckUtils]: 69: Hoare triple {3452#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3452#false} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 70: Hoare triple {3452#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3452#false} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 71: Hoare triple {3452#false} assume !(~i~2 < 9); {3452#false} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 72: Hoare triple {3452#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3452#false} is VALID [2018-11-23 12:15:57,796 INFO L256 TraceCheckUtils]: 73: Hoare triple {3452#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {3451#true} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 74: Hoare triple {3451#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3451#true} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 75: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 76: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 77: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 79: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 80: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 81: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 82: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 83: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 84: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 85: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,797 INFO L273 TraceCheckUtils]: 86: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L273 TraceCheckUtils]: 87: Hoare triple {3451#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L273 TraceCheckUtils]: 88: Hoare triple {3451#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L273 TraceCheckUtils]: 89: Hoare triple {3451#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L273 TraceCheckUtils]: 90: Hoare triple {3451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L273 TraceCheckUtils]: 91: Hoare triple {3451#true} assume !(~i~0 < 10); {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L273 TraceCheckUtils]: 92: Hoare triple {3451#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L273 TraceCheckUtils]: 93: Hoare triple {3451#true} assume true; {3451#true} is VALID [2018-11-23 12:15:57,798 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3451#true} {3452#false} #81#return; {3452#false} is VALID [2018-11-23 12:15:57,799 INFO L273 TraceCheckUtils]: 95: Hoare triple {3452#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3452#false} is VALID [2018-11-23 12:15:57,799 INFO L273 TraceCheckUtils]: 96: Hoare triple {3452#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3452#false} is VALID [2018-11-23 12:15:57,799 INFO L273 TraceCheckUtils]: 97: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2018-11-23 12:15:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 12:15:57,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:57,804 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:15:57,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:57,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:58,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2018-11-23 12:15:58,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {3451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3451#true} is VALID [2018-11-23 12:15:58,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2018-11-23 12:15:58,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #73#return; {3451#true} is VALID [2018-11-23 12:15:58,243 INFO L256 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret14 := main(); {3451#true} is VALID [2018-11-23 12:15:58,244 INFO L273 TraceCheckUtils]: 5: Hoare triple {3451#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; {3479#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:58,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {3479#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3479#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:58,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {3479#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3454#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:58,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {3454#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3454#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:58,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {3454#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3455#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:58,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {3455#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3455#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:58,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {3455#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3456#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:58,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {3456#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3456#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:58,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {3456#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3457#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:58,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {3457#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3457#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:58,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {3457#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3458#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:58,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {3458#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3458#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:58,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {3458#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3459#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:58,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {3459#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3459#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:58,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {3459#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3460#(<= main_~i~1 7)} is VALID [2018-11-23 12:15:58,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {3460#(<= main_~i~1 7)} assume !(~i~1 < 10); {3452#false} is VALID [2018-11-23 12:15:58,253 INFO L256 TraceCheckUtils]: 21: Hoare triple {3452#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {3452#false} is VALID [2018-11-23 12:15:58,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {3452#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3452#false} is VALID [2018-11-23 12:15:58,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,256 INFO L273 TraceCheckUtils]: 36: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {3452#false} assume !(~i~0 < 10); {3452#false} is VALID [2018-11-23 12:15:58,257 INFO L273 TraceCheckUtils]: 40: Hoare triple {3452#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3452#false} is VALID [2018-11-23 12:15:58,257 INFO L273 TraceCheckUtils]: 41: Hoare triple {3452#false} assume true; {3452#false} is VALID [2018-11-23 12:15:58,257 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3452#false} {3452#false} #77#return; {3452#false} is VALID [2018-11-23 12:15:58,258 INFO L273 TraceCheckUtils]: 43: Hoare triple {3452#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3452#false} is VALID [2018-11-23 12:15:58,258 INFO L256 TraceCheckUtils]: 44: Hoare triple {3452#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {3452#false} is VALID [2018-11-23 12:15:58,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {3452#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3452#false} is VALID [2018-11-23 12:15:58,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,258 INFO L273 TraceCheckUtils]: 47: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 48: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 49: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 50: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 51: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 52: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 54: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,259 INFO L273 TraceCheckUtils]: 55: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 56: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 57: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 58: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 59: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 60: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 61: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 62: Hoare triple {3452#false} assume !(~i~0 < 10); {3452#false} is VALID [2018-11-23 12:15:58,260 INFO L273 TraceCheckUtils]: 63: Hoare triple {3452#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L273 TraceCheckUtils]: 64: Hoare triple {3452#false} assume true; {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3452#false} {3452#false} #79#return; {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L273 TraceCheckUtils]: 66: Hoare triple {3452#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L273 TraceCheckUtils]: 67: Hoare triple {3452#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L273 TraceCheckUtils]: 68: Hoare triple {3452#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L273 TraceCheckUtils]: 69: Hoare triple {3452#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L273 TraceCheckUtils]: 70: Hoare triple {3452#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3452#false} is VALID [2018-11-23 12:15:58,261 INFO L273 TraceCheckUtils]: 71: Hoare triple {3452#false} assume !(~i~2 < 9); {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 72: Hoare triple {3452#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L256 TraceCheckUtils]: 73: Hoare triple {3452#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 74: Hoare triple {3452#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 75: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 76: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 77: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 78: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 79: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,262 INFO L273 TraceCheckUtils]: 80: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 82: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 83: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 84: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 85: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 86: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 87: Hoare triple {3452#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3452#false} is VALID [2018-11-23 12:15:58,263 INFO L273 TraceCheckUtils]: 88: Hoare triple {3452#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L273 TraceCheckUtils]: 89: Hoare triple {3452#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L273 TraceCheckUtils]: 90: Hoare triple {3452#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L273 TraceCheckUtils]: 91: Hoare triple {3452#false} assume !(~i~0 < 10); {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L273 TraceCheckUtils]: 92: Hoare triple {3452#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L273 TraceCheckUtils]: 93: Hoare triple {3452#false} assume true; {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {3452#false} {3452#false} #81#return; {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L273 TraceCheckUtils]: 95: Hoare triple {3452#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3452#false} is VALID [2018-11-23 12:15:58,264 INFO L273 TraceCheckUtils]: 96: Hoare triple {3452#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3452#false} is VALID [2018-11-23 12:15:58,265 INFO L273 TraceCheckUtils]: 97: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2018-11-23 12:15:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 12:15:58,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:58,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:15:58,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-23 12:15:58,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:58,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:15:58,347 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:15:58,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:15:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:15:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:15:58,349 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 11 states. [2018-11-23 12:15:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:58,596 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2018-11-23 12:15:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:15:58,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-11-23 12:15:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:15:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2018-11-23 12:15:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:15:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2018-11-23 12:15:58,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2018-11-23 12:15:58,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:15:58,729 INFO L225 Difference]: With dead ends: 96 [2018-11-23 12:15:58,729 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:15:58,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:15:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:15:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 12:15:58,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:58,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 12:15:58,758 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 12:15:58,758 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 12:15:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:58,761 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:15:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:15:58,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:58,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:58,762 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 12:15:58,762 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 12:15:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:58,764 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 12:15:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-23 12:15:58,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:58,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:58,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:58,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:15:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-23 12:15:58,767 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 98 [2018-11-23 12:15:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:58,767 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-23 12:15:58,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:15:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 12:15:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:15:58,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:58,769 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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:15:58,769 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:58,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:58,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1118458429, now seen corresponding path program 8 times [2018-11-23 12:15:58,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:58,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:58,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:15:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:58,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {4092#true} call ULTIMATE.init(); {4092#true} is VALID [2018-11-23 12:15:58,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {4092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4092#true} is VALID [2018-11-23 12:15:58,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {4092#true} assume true; {4092#true} is VALID [2018-11-23 12:15:58,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4092#true} {4092#true} #73#return; {4092#true} is VALID [2018-11-23 12:15:58,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {4092#true} call #t~ret14 := main(); {4092#true} is VALID [2018-11-23 12:15:58,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {4092#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; {4094#(= main_~i~1 0)} is VALID [2018-11-23 12:15:58,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {4094#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4094#(= main_~i~1 0)} is VALID [2018-11-23 12:15:58,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {4094#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4095#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:58,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {4095#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4095#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:58,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {4095#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4096#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:58,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {4096#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4096#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:58,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {4096#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4097#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:58,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {4097#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4097#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:58,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {4097#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4098#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:58,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {4098#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4098#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:58,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {4098#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4099#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:58,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {4099#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4099#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:58,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {4099#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4100#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:58,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {4100#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4100#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:58,955 INFO L273 TraceCheckUtils]: 19: Hoare triple {4100#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4101#(<= main_~i~1 7)} is VALID [2018-11-23 12:15:58,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {4101#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4101#(<= main_~i~1 7)} is VALID [2018-11-23 12:15:58,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {4101#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4102#(<= main_~i~1 8)} is VALID [2018-11-23 12:15:58,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {4102#(<= main_~i~1 8)} assume !(~i~1 < 10); {4093#false} is VALID [2018-11-23 12:15:58,957 INFO L256 TraceCheckUtils]: 23: Hoare triple {4093#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {4092#true} is VALID [2018-11-23 12:15:58,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {4092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4092#true} is VALID [2018-11-23 12:15:58,958 INFO L273 TraceCheckUtils]: 25: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,958 INFO L273 TraceCheckUtils]: 26: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,958 INFO L273 TraceCheckUtils]: 28: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,959 INFO L273 TraceCheckUtils]: 31: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,960 INFO L273 TraceCheckUtils]: 33: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,960 INFO L273 TraceCheckUtils]: 34: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,961 INFO L273 TraceCheckUtils]: 38: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,961 INFO L273 TraceCheckUtils]: 39: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,962 INFO L273 TraceCheckUtils]: 40: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,962 INFO L273 TraceCheckUtils]: 41: Hoare triple {4092#true} assume !(~i~0 < 10); {4092#true} is VALID [2018-11-23 12:15:58,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {4092#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4092#true} is VALID [2018-11-23 12:15:58,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {4092#true} assume true; {4092#true} is VALID [2018-11-23 12:15:58,962 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4092#true} {4093#false} #77#return; {4093#false} is VALID [2018-11-23 12:15:58,963 INFO L273 TraceCheckUtils]: 45: Hoare triple {4093#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4093#false} is VALID [2018-11-23 12:15:58,963 INFO L256 TraceCheckUtils]: 46: Hoare triple {4093#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {4092#true} is VALID [2018-11-23 12:15:58,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {4092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4092#true} is VALID [2018-11-23 12:15:58,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,963 INFO L273 TraceCheckUtils]: 49: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,963 INFO L273 TraceCheckUtils]: 50: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,963 INFO L273 TraceCheckUtils]: 51: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,964 INFO L273 TraceCheckUtils]: 52: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,964 INFO L273 TraceCheckUtils]: 53: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,964 INFO L273 TraceCheckUtils]: 54: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,964 INFO L273 TraceCheckUtils]: 55: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,964 INFO L273 TraceCheckUtils]: 56: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,964 INFO L273 TraceCheckUtils]: 57: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,965 INFO L273 TraceCheckUtils]: 58: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,965 INFO L273 TraceCheckUtils]: 59: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,965 INFO L273 TraceCheckUtils]: 60: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,965 INFO L273 TraceCheckUtils]: 62: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,965 INFO L273 TraceCheckUtils]: 63: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,965 INFO L273 TraceCheckUtils]: 64: Hoare triple {4092#true} assume !(~i~0 < 10); {4092#true} is VALID [2018-11-23 12:15:58,966 INFO L273 TraceCheckUtils]: 65: Hoare triple {4092#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4092#true} is VALID [2018-11-23 12:15:58,966 INFO L273 TraceCheckUtils]: 66: Hoare triple {4092#true} assume true; {4092#true} is VALID [2018-11-23 12:15:58,966 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4092#true} {4093#false} #79#return; {4093#false} is VALID [2018-11-23 12:15:58,966 INFO L273 TraceCheckUtils]: 68: Hoare triple {4093#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4093#false} is VALID [2018-11-23 12:15:58,966 INFO L273 TraceCheckUtils]: 69: Hoare triple {4093#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4093#false} is VALID [2018-11-23 12:15:58,966 INFO L273 TraceCheckUtils]: 70: Hoare triple {4093#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4093#false} is VALID [2018-11-23 12:15:58,967 INFO L273 TraceCheckUtils]: 71: Hoare triple {4093#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4093#false} is VALID [2018-11-23 12:15:58,967 INFO L273 TraceCheckUtils]: 72: Hoare triple {4093#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4093#false} is VALID [2018-11-23 12:15:58,967 INFO L273 TraceCheckUtils]: 73: Hoare triple {4093#false} assume !(~i~2 < 9); {4093#false} is VALID [2018-11-23 12:15:58,967 INFO L273 TraceCheckUtils]: 74: Hoare triple {4093#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4093#false} is VALID [2018-11-23 12:15:58,967 INFO L256 TraceCheckUtils]: 75: Hoare triple {4093#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {4092#true} is VALID [2018-11-23 12:15:58,967 INFO L273 TraceCheckUtils]: 76: Hoare triple {4092#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4092#true} is VALID [2018-11-23 12:15:58,967 INFO L273 TraceCheckUtils]: 77: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,968 INFO L273 TraceCheckUtils]: 78: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,968 INFO L273 TraceCheckUtils]: 79: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,968 INFO L273 TraceCheckUtils]: 80: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,968 INFO L273 TraceCheckUtils]: 81: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,968 INFO L273 TraceCheckUtils]: 82: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,968 INFO L273 TraceCheckUtils]: 83: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,969 INFO L273 TraceCheckUtils]: 84: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,969 INFO L273 TraceCheckUtils]: 85: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,969 INFO L273 TraceCheckUtils]: 86: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,969 INFO L273 TraceCheckUtils]: 87: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,969 INFO L273 TraceCheckUtils]: 88: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,969 INFO L273 TraceCheckUtils]: 89: Hoare triple {4092#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4092#true} is VALID [2018-11-23 12:15:58,970 INFO L273 TraceCheckUtils]: 90: Hoare triple {4092#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4092#true} is VALID [2018-11-23 12:15:58,970 INFO L273 TraceCheckUtils]: 91: Hoare triple {4092#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4092#true} is VALID [2018-11-23 12:15:58,970 INFO L273 TraceCheckUtils]: 92: Hoare triple {4092#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4092#true} is VALID [2018-11-23 12:15:58,970 INFO L273 TraceCheckUtils]: 93: Hoare triple {4092#true} assume !(~i~0 < 10); {4092#true} is VALID [2018-11-23 12:15:58,970 INFO L273 TraceCheckUtils]: 94: Hoare triple {4092#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4092#true} is VALID [2018-11-23 12:15:58,970 INFO L273 TraceCheckUtils]: 95: Hoare triple {4092#true} assume true; {4092#true} is VALID [2018-11-23 12:15:58,970 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {4092#true} {4093#false} #81#return; {4093#false} is VALID [2018-11-23 12:15:58,971 INFO L273 TraceCheckUtils]: 97: Hoare triple {4093#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4093#false} is VALID [2018-11-23 12:15:58,971 INFO L273 TraceCheckUtils]: 98: Hoare triple {4093#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4093#false} is VALID [2018-11-23 12:15:58,971 INFO L273 TraceCheckUtils]: 99: Hoare triple {4093#false} assume !false; {4093#false} is VALID [2018-11-23 12:15:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 12:15:58,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:15:58,980 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:15:58,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:15:59,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:15:59,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:15:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:15:59,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:15:59,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {4092#true} call ULTIMATE.init(); {4092#true} is VALID [2018-11-23 12:15:59,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {4092#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4092#true} is VALID [2018-11-23 12:15:59,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {4092#true} assume true; {4092#true} is VALID [2018-11-23 12:15:59,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4092#true} {4092#true} #73#return; {4092#true} is VALID [2018-11-23 12:15:59,240 INFO L256 TraceCheckUtils]: 4: Hoare triple {4092#true} call #t~ret14 := main(); {4092#true} is VALID [2018-11-23 12:15:59,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {4092#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; {4121#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:59,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {4121#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4121#(<= main_~i~1 0)} is VALID [2018-11-23 12:15:59,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {4121#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4095#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:59,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {4095#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4095#(<= main_~i~1 1)} is VALID [2018-11-23 12:15:59,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {4095#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4096#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:59,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {4096#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4096#(<= main_~i~1 2)} is VALID [2018-11-23 12:15:59,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {4096#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4097#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:59,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {4097#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4097#(<= main_~i~1 3)} is VALID [2018-11-23 12:15:59,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {4097#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4098#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:59,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {4098#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4098#(<= main_~i~1 4)} is VALID [2018-11-23 12:15:59,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {4098#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4099#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:59,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {4099#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4099#(<= main_~i~1 5)} is VALID [2018-11-23 12:15:59,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {4099#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4100#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:59,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {4100#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4100#(<= main_~i~1 6)} is VALID [2018-11-23 12:15:59,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {4100#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4101#(<= main_~i~1 7)} is VALID [2018-11-23 12:15:59,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {4101#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4101#(<= main_~i~1 7)} is VALID [2018-11-23 12:15:59,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {4101#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4102#(<= main_~i~1 8)} is VALID [2018-11-23 12:15:59,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {4102#(<= main_~i~1 8)} assume !(~i~1 < 10); {4093#false} is VALID [2018-11-23 12:15:59,254 INFO L256 TraceCheckUtils]: 23: Hoare triple {4093#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {4093#false} is VALID [2018-11-23 12:15:59,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {4093#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4093#false} is VALID [2018-11-23 12:15:59,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,256 INFO L273 TraceCheckUtils]: 32: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,257 INFO L273 TraceCheckUtils]: 36: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,258 INFO L273 TraceCheckUtils]: 40: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,258 INFO L273 TraceCheckUtils]: 41: Hoare triple {4093#false} assume !(~i~0 < 10); {4093#false} is VALID [2018-11-23 12:15:59,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {4093#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4093#false} is VALID [2018-11-23 12:15:59,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {4093#false} assume true; {4093#false} is VALID [2018-11-23 12:15:59,259 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4093#false} {4093#false} #77#return; {4093#false} is VALID [2018-11-23 12:15:59,259 INFO L273 TraceCheckUtils]: 45: Hoare triple {4093#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4093#false} is VALID [2018-11-23 12:15:59,259 INFO L256 TraceCheckUtils]: 46: Hoare triple {4093#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {4093#false} is VALID [2018-11-23 12:15:59,259 INFO L273 TraceCheckUtils]: 47: Hoare triple {4093#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4093#false} is VALID [2018-11-23 12:15:59,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,260 INFO L273 TraceCheckUtils]: 49: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,260 INFO L273 TraceCheckUtils]: 52: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,260 INFO L273 TraceCheckUtils]: 53: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,260 INFO L273 TraceCheckUtils]: 54: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,261 INFO L273 TraceCheckUtils]: 55: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,261 INFO L273 TraceCheckUtils]: 56: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,261 INFO L273 TraceCheckUtils]: 57: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,261 INFO L273 TraceCheckUtils]: 58: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,261 INFO L273 TraceCheckUtils]: 59: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,261 INFO L273 TraceCheckUtils]: 60: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,262 INFO L273 TraceCheckUtils]: 61: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,262 INFO L273 TraceCheckUtils]: 62: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,262 INFO L273 TraceCheckUtils]: 63: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,262 INFO L273 TraceCheckUtils]: 64: Hoare triple {4093#false} assume !(~i~0 < 10); {4093#false} is VALID [2018-11-23 12:15:59,262 INFO L273 TraceCheckUtils]: 65: Hoare triple {4093#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4093#false} is VALID [2018-11-23 12:15:59,262 INFO L273 TraceCheckUtils]: 66: Hoare triple {4093#false} assume true; {4093#false} is VALID [2018-11-23 12:15:59,263 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4093#false} {4093#false} #79#return; {4093#false} is VALID [2018-11-23 12:15:59,263 INFO L273 TraceCheckUtils]: 68: Hoare triple {4093#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4093#false} is VALID [2018-11-23 12:15:59,263 INFO L273 TraceCheckUtils]: 69: Hoare triple {4093#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4093#false} is VALID [2018-11-23 12:15:59,263 INFO L273 TraceCheckUtils]: 70: Hoare triple {4093#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4093#false} is VALID [2018-11-23 12:15:59,263 INFO L273 TraceCheckUtils]: 71: Hoare triple {4093#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4093#false} is VALID [2018-11-23 12:15:59,263 INFO L273 TraceCheckUtils]: 72: Hoare triple {4093#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4093#false} is VALID [2018-11-23 12:15:59,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {4093#false} assume !(~i~2 < 9); {4093#false} is VALID [2018-11-23 12:15:59,264 INFO L273 TraceCheckUtils]: 74: Hoare triple {4093#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4093#false} is VALID [2018-11-23 12:15:59,264 INFO L256 TraceCheckUtils]: 75: Hoare triple {4093#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {4093#false} is VALID [2018-11-23 12:15:59,264 INFO L273 TraceCheckUtils]: 76: Hoare triple {4093#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4093#false} is VALID [2018-11-23 12:15:59,264 INFO L273 TraceCheckUtils]: 77: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,264 INFO L273 TraceCheckUtils]: 79: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,265 INFO L273 TraceCheckUtils]: 80: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,265 INFO L273 TraceCheckUtils]: 82: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,265 INFO L273 TraceCheckUtils]: 83: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,265 INFO L273 TraceCheckUtils]: 84: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,265 INFO L273 TraceCheckUtils]: 85: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,265 INFO L273 TraceCheckUtils]: 86: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {4093#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4093#false} is VALID [2018-11-23 12:15:59,266 INFO L273 TraceCheckUtils]: 90: Hoare triple {4093#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4093#false} is VALID [2018-11-23 12:15:59,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {4093#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4093#false} is VALID [2018-11-23 12:15:59,266 INFO L273 TraceCheckUtils]: 92: Hoare triple {4093#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4093#false} is VALID [2018-11-23 12:15:59,267 INFO L273 TraceCheckUtils]: 93: Hoare triple {4093#false} assume !(~i~0 < 10); {4093#false} is VALID [2018-11-23 12:15:59,267 INFO L273 TraceCheckUtils]: 94: Hoare triple {4093#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4093#false} is VALID [2018-11-23 12:15:59,267 INFO L273 TraceCheckUtils]: 95: Hoare triple {4093#false} assume true; {4093#false} is VALID [2018-11-23 12:15:59,267 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {4093#false} {4093#false} #81#return; {4093#false} is VALID [2018-11-23 12:15:59,267 INFO L273 TraceCheckUtils]: 97: Hoare triple {4093#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4093#false} is VALID [2018-11-23 12:15:59,267 INFO L273 TraceCheckUtils]: 98: Hoare triple {4093#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4093#false} is VALID [2018-11-23 12:15:59,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {4093#false} assume !false; {4093#false} is VALID [2018-11-23 12:15:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 12:15:59,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:15:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:15:59,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2018-11-23 12:15:59,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:15:59,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:15:59,370 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:15:59,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:15:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:15:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:15:59,371 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 12 states. [2018-11-23 12:15:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:59,716 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2018-11-23 12:15:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:15:59,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2018-11-23 12:15:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:15:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:15:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2018-11-23 12:15:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:15:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2018-11-23 12:15:59,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2018-11-23 12:15:59,796 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:15:59,798 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:15:59,798 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:15:59,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 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:15:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:15:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 12:15:59,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:15:59,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 12:15:59,829 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 12:15:59,829 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 12:15:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:59,832 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:15:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:15:59,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:59,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:59,833 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 12:15:59,833 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 12:15:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:15:59,835 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:15:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:15:59,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:15:59,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:15:59,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:15:59,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:15:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:15:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2018-11-23 12:15:59,838 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 100 [2018-11-23 12:15:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:15:59,838 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2018-11-23 12:15:59,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:15:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 12:15:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 12:15:59,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:15:59,840 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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:15:59,840 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:15:59,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:15:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1056903685, now seen corresponding path program 9 times [2018-11-23 12:15:59,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:15:59,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:15:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:59,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:15:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:15:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:00,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {4750#true} call ULTIMATE.init(); {4750#true} is VALID [2018-11-23 12:16:00,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {4750#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4750#true} is VALID [2018-11-23 12:16:00,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {4750#true} assume true; {4750#true} is VALID [2018-11-23 12:16:00,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4750#true} {4750#true} #73#return; {4750#true} is VALID [2018-11-23 12:16:00,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {4750#true} call #t~ret14 := main(); {4750#true} is VALID [2018-11-23 12:16:00,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {4750#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; {4752#(= main_~i~1 0)} is VALID [2018-11-23 12:16:00,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {4752#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4752#(= main_~i~1 0)} is VALID [2018-11-23 12:16:00,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {4752#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4753#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:00,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {4753#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4753#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:00,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {4753#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4754#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:00,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {4754#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4754#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:00,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {4754#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4755#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:00,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {4755#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4755#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:00,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {4755#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4756#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:00,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {4756#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4756#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:00,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {4756#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4757#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:00,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {4757#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4757#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:00,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {4757#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4758#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:00,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {4758#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4758#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:00,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {4758#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4759#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:00,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {4759#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4759#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:00,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {4759#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4760#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:00,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {4760#(<= main_~i~1 8)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4760#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:00,209 INFO L273 TraceCheckUtils]: 23: Hoare triple {4760#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4761#(<= main_~i~1 9)} is VALID [2018-11-23 12:16:00,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {4761#(<= main_~i~1 9)} assume !(~i~1 < 10); {4751#false} is VALID [2018-11-23 12:16:00,210 INFO L256 TraceCheckUtils]: 25: Hoare triple {4751#false} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {4750#true} is VALID [2018-11-23 12:16:00,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {4750#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4750#true} is VALID [2018-11-23 12:16:00,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,210 INFO L273 TraceCheckUtils]: 29: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,210 INFO L273 TraceCheckUtils]: 30: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,210 INFO L273 TraceCheckUtils]: 31: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 35: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 37: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 38: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,211 INFO L273 TraceCheckUtils]: 39: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,212 INFO L273 TraceCheckUtils]: 41: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {4750#true} assume !(~i~0 < 10); {4750#true} is VALID [2018-11-23 12:16:00,212 INFO L273 TraceCheckUtils]: 44: Hoare triple {4750#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4750#true} is VALID [2018-11-23 12:16:00,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {4750#true} assume true; {4750#true} is VALID [2018-11-23 12:16:00,212 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4750#true} {4751#false} #77#return; {4751#false} is VALID [2018-11-23 12:16:00,212 INFO L273 TraceCheckUtils]: 47: Hoare triple {4751#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4751#false} is VALID [2018-11-23 12:16:00,213 INFO L256 TraceCheckUtils]: 48: Hoare triple {4751#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {4750#true} is VALID [2018-11-23 12:16:00,213 INFO L273 TraceCheckUtils]: 49: Hoare triple {4750#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4750#true} is VALID [2018-11-23 12:16:00,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,213 INFO L273 TraceCheckUtils]: 54: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,213 INFO L273 TraceCheckUtils]: 55: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 61: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 63: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,214 INFO L273 TraceCheckUtils]: 64: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {4750#true} assume !(~i~0 < 10); {4750#true} is VALID [2018-11-23 12:16:00,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {4750#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4750#true} is VALID [2018-11-23 12:16:00,215 INFO L273 TraceCheckUtils]: 68: Hoare triple {4750#true} assume true; {4750#true} is VALID [2018-11-23 12:16:00,215 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4750#true} {4751#false} #79#return; {4751#false} is VALID [2018-11-23 12:16:00,215 INFO L273 TraceCheckUtils]: 70: Hoare triple {4751#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4751#false} is VALID [2018-11-23 12:16:00,215 INFO L273 TraceCheckUtils]: 71: Hoare triple {4751#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4751#false} is VALID [2018-11-23 12:16:00,215 INFO L273 TraceCheckUtils]: 72: Hoare triple {4751#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4751#false} is VALID [2018-11-23 12:16:00,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {4751#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4751#false} is VALID [2018-11-23 12:16:00,216 INFO L273 TraceCheckUtils]: 74: Hoare triple {4751#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4751#false} is VALID [2018-11-23 12:16:00,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {4751#false} assume !(~i~2 < 9); {4751#false} is VALID [2018-11-23 12:16:00,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {4751#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4751#false} is VALID [2018-11-23 12:16:00,216 INFO L256 TraceCheckUtils]: 77: Hoare triple {4751#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {4750#true} is VALID [2018-11-23 12:16:00,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {4750#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4750#true} is VALID [2018-11-23 12:16:00,216 INFO L273 TraceCheckUtils]: 79: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,216 INFO L273 TraceCheckUtils]: 80: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 81: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 82: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 95: Hoare triple {4750#true} assume !(~i~0 < 10); {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 96: Hoare triple {4750#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4750#true} is VALID [2018-11-23 12:16:00,218 INFO L273 TraceCheckUtils]: 97: Hoare triple {4750#true} assume true; {4750#true} is VALID [2018-11-23 12:16:00,219 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {4750#true} {4751#false} #81#return; {4751#false} is VALID [2018-11-23 12:16:00,219 INFO L273 TraceCheckUtils]: 99: Hoare triple {4751#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4751#false} is VALID [2018-11-23 12:16:00,219 INFO L273 TraceCheckUtils]: 100: Hoare triple {4751#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4751#false} is VALID [2018-11-23 12:16:00,219 INFO L273 TraceCheckUtils]: 101: Hoare triple {4751#false} assume !false; {4751#false} is VALID [2018-11-23 12:16:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-23 12:16:00,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:00,223 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:16:00,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:00,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:16:00,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:00,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:00,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {4750#true} call ULTIMATE.init(); {4750#true} is VALID [2018-11-23 12:16:00,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {4750#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4750#true} is VALID [2018-11-23 12:16:00,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {4750#true} assume true; {4750#true} is VALID [2018-11-23 12:16:00,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4750#true} {4750#true} #73#return; {4750#true} is VALID [2018-11-23 12:16:00,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {4750#true} call #t~ret14 := main(); {4750#true} is VALID [2018-11-23 12:16:00,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {4750#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; {4750#true} is VALID [2018-11-23 12:16:00,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,434 INFO L273 TraceCheckUtils]: 20: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {4750#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 23: Hoare triple {4750#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 24: Hoare triple {4750#true} assume !(~i~1 < 10); {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L256 TraceCheckUtils]: 25: Hoare triple {4750#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {4750#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 27: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,435 INFO L273 TraceCheckUtils]: 31: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 32: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 36: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 37: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 38: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,436 INFO L273 TraceCheckUtils]: 39: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L273 TraceCheckUtils]: 40: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L273 TraceCheckUtils]: 42: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {4750#true} assume !(~i~0 < 10); {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L273 TraceCheckUtils]: 44: Hoare triple {4750#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {4750#true} assume true; {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4750#true} {4750#true} #77#return; {4750#true} is VALID [2018-11-23 12:16:00,437 INFO L273 TraceCheckUtils]: 47: Hoare triple {4750#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L256 TraceCheckUtils]: 48: Hoare triple {4750#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 49: Hoare triple {4750#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 50: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 51: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 52: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 53: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 54: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 55: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,438 INFO L273 TraceCheckUtils]: 56: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 57: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 58: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 59: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 60: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 61: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 62: Hoare triple {4750#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 63: Hoare triple {4750#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4750#true} is VALID [2018-11-23 12:16:00,439 INFO L273 TraceCheckUtils]: 64: Hoare triple {4750#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4750#true} is VALID [2018-11-23 12:16:00,440 INFO L273 TraceCheckUtils]: 65: Hoare triple {4750#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4750#true} is VALID [2018-11-23 12:16:00,440 INFO L273 TraceCheckUtils]: 66: Hoare triple {4750#true} assume !(~i~0 < 10); {4750#true} is VALID [2018-11-23 12:16:00,440 INFO L273 TraceCheckUtils]: 67: Hoare triple {4750#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4750#true} is VALID [2018-11-23 12:16:00,440 INFO L273 TraceCheckUtils]: 68: Hoare triple {4750#true} assume true; {4750#true} is VALID [2018-11-23 12:16:00,440 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {4750#true} {4750#true} #79#return; {4750#true} is VALID [2018-11-23 12:16:00,441 INFO L273 TraceCheckUtils]: 70: Hoare triple {4750#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4975#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:00,441 INFO L273 TraceCheckUtils]: 71: Hoare triple {4975#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4975#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:00,441 INFO L273 TraceCheckUtils]: 72: Hoare triple {4975#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4982#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:00,442 INFO L273 TraceCheckUtils]: 73: Hoare triple {4982#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4982#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:00,442 INFO L273 TraceCheckUtils]: 74: Hoare triple {4982#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4989#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:00,443 INFO L273 TraceCheckUtils]: 75: Hoare triple {4989#(<= main_~i~2 2)} assume !(~i~2 < 9); {4751#false} is VALID [2018-11-23 12:16:00,443 INFO L273 TraceCheckUtils]: 76: Hoare triple {4751#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4751#false} is VALID [2018-11-23 12:16:00,443 INFO L256 TraceCheckUtils]: 77: Hoare triple {4751#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {4751#false} is VALID [2018-11-23 12:16:00,443 INFO L273 TraceCheckUtils]: 78: Hoare triple {4751#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {4751#false} is VALID [2018-11-23 12:16:00,444 INFO L273 TraceCheckUtils]: 79: Hoare triple {4751#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4751#false} is VALID [2018-11-23 12:16:00,444 INFO L273 TraceCheckUtils]: 80: Hoare triple {4751#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4751#false} is VALID [2018-11-23 12:16:00,444 INFO L273 TraceCheckUtils]: 81: Hoare triple {4751#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4751#false} is VALID [2018-11-23 12:16:00,444 INFO L273 TraceCheckUtils]: 82: Hoare triple {4751#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4751#false} is VALID [2018-11-23 12:16:00,444 INFO L273 TraceCheckUtils]: 83: Hoare triple {4751#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4751#false} is VALID [2018-11-23 12:16:00,445 INFO L273 TraceCheckUtils]: 84: Hoare triple {4751#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4751#false} is VALID [2018-11-23 12:16:00,445 INFO L273 TraceCheckUtils]: 85: Hoare triple {4751#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4751#false} is VALID [2018-11-23 12:16:00,445 INFO L273 TraceCheckUtils]: 86: Hoare triple {4751#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4751#false} is VALID [2018-11-23 12:16:00,445 INFO L273 TraceCheckUtils]: 87: Hoare triple {4751#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4751#false} is VALID [2018-11-23 12:16:00,445 INFO L273 TraceCheckUtils]: 88: Hoare triple {4751#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4751#false} is VALID [2018-11-23 12:16:00,446 INFO L273 TraceCheckUtils]: 89: Hoare triple {4751#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4751#false} is VALID [2018-11-23 12:16:00,446 INFO L273 TraceCheckUtils]: 90: Hoare triple {4751#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4751#false} is VALID [2018-11-23 12:16:00,446 INFO L273 TraceCheckUtils]: 91: Hoare triple {4751#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4751#false} is VALID [2018-11-23 12:16:00,446 INFO L273 TraceCheckUtils]: 92: Hoare triple {4751#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {4751#false} is VALID [2018-11-23 12:16:00,446 INFO L273 TraceCheckUtils]: 93: Hoare triple {4751#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {4751#false} is VALID [2018-11-23 12:16:00,446 INFO L273 TraceCheckUtils]: 94: Hoare triple {4751#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4751#false} is VALID [2018-11-23 12:16:00,446 INFO L273 TraceCheckUtils]: 95: Hoare triple {4751#false} assume !(~i~0 < 10); {4751#false} is VALID [2018-11-23 12:16:00,447 INFO L273 TraceCheckUtils]: 96: Hoare triple {4751#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4751#false} is VALID [2018-11-23 12:16:00,447 INFO L273 TraceCheckUtils]: 97: Hoare triple {4751#false} assume true; {4751#false} is VALID [2018-11-23 12:16:00,447 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {4751#false} {4751#false} #81#return; {4751#false} is VALID [2018-11-23 12:16:00,447 INFO L273 TraceCheckUtils]: 99: Hoare triple {4751#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4751#false} is VALID [2018-11-23 12:16:00,447 INFO L273 TraceCheckUtils]: 100: Hoare triple {4751#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4751#false} is VALID [2018-11-23 12:16:00,447 INFO L273 TraceCheckUtils]: 101: Hoare triple {4751#false} assume !false; {4751#false} is VALID [2018-11-23 12:16:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 154 proven. 4 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-23 12:16:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:16:00,471 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-23 12:16:00,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:00,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:16:00,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:00,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:16:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:16:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:16:00,542 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 15 states. [2018-11-23 12:16:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:01,024 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-23 12:16:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:16:01,024 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 102 [2018-11-23 12:16:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:16:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2018-11-23 12:16:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:16:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2018-11-23 12:16:01,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2018-11-23 12:16:01,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:01,227 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:16:01,227 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:16:01,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:16:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:16:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 12:16:01,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:01,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-23 12:16:01,253 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-23 12:16:01,253 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-23 12:16:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:01,256 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:16:01,256 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:16:01,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:01,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:01,257 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-23 12:16:01,257 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-23 12:16:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:01,259 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 12:16:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 12:16:01,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:01,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:01,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:01,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:16:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-11-23 12:16:01,262 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 102 [2018-11-23 12:16:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:01,262 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-23 12:16:01,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:16:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 12:16:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 12:16:01,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:01,263 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 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:16:01,264 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:01,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash 918576677, now seen corresponding path program 10 times [2018-11-23 12:16:01,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:01,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:01,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {5437#true} call ULTIMATE.init(); {5437#true} is VALID [2018-11-23 12:16:01,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {5437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5437#true} is VALID [2018-11-23 12:16:01,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {5437#true} assume true; {5437#true} is VALID [2018-11-23 12:16:01,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5437#true} {5437#true} #73#return; {5437#true} is VALID [2018-11-23 12:16:01,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {5437#true} call #t~ret14 := main(); {5437#true} is VALID [2018-11-23 12:16:01,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {5437#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; {5437#true} is VALID [2018-11-23 12:16:01,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,497 INFO L273 TraceCheckUtils]: 25: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {5437#true} assume !(~i~1 < 10); {5437#true} is VALID [2018-11-23 12:16:01,497 INFO L256 TraceCheckUtils]: 27: Hoare triple {5437#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {5437#true} is VALID [2018-11-23 12:16:01,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {5437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5439#(= max_~i~0 0)} is VALID [2018-11-23 12:16:01,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {5439#(= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5439#(= max_~i~0 0)} is VALID [2018-11-23 12:16:01,515 INFO L273 TraceCheckUtils]: 30: Hoare triple {5439#(= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5439#(= max_~i~0 0)} is VALID [2018-11-23 12:16:01,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {5439#(= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5439#(= max_~i~0 0)} is VALID [2018-11-23 12:16:01,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {5439#(= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {5440#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {5440#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {5440#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {5440#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {5441#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {5441#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {5441#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {5441#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,519 INFO L273 TraceCheckUtils]: 41: Hoare triple {5442#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,520 INFO L273 TraceCheckUtils]: 42: Hoare triple {5442#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {5442#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {5442#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5443#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:01,522 INFO L273 TraceCheckUtils]: 45: Hoare triple {5443#(<= max_~i~0 4)} assume !(~i~0 < 10); {5438#false} is VALID [2018-11-23 12:16:01,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {5438#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5438#false} is VALID [2018-11-23 12:16:01,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {5438#false} assume true; {5438#false} is VALID [2018-11-23 12:16:01,522 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {5438#false} {5437#true} #77#return; {5438#false} is VALID [2018-11-23 12:16:01,523 INFO L273 TraceCheckUtils]: 49: Hoare triple {5438#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5438#false} is VALID [2018-11-23 12:16:01,523 INFO L256 TraceCheckUtils]: 50: Hoare triple {5438#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {5437#true} is VALID [2018-11-23 12:16:01,523 INFO L273 TraceCheckUtils]: 51: Hoare triple {5437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5437#true} is VALID [2018-11-23 12:16:01,523 INFO L273 TraceCheckUtils]: 52: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,524 INFO L273 TraceCheckUtils]: 53: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,524 INFO L273 TraceCheckUtils]: 54: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,524 INFO L273 TraceCheckUtils]: 55: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,524 INFO L273 TraceCheckUtils]: 56: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,524 INFO L273 TraceCheckUtils]: 57: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 58: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 59: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 60: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 61: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 64: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,525 INFO L273 TraceCheckUtils]: 65: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,526 INFO L273 TraceCheckUtils]: 66: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,526 INFO L273 TraceCheckUtils]: 67: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,526 INFO L273 TraceCheckUtils]: 68: Hoare triple {5437#true} assume !(~i~0 < 10); {5437#true} is VALID [2018-11-23 12:16:01,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {5437#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5437#true} is VALID [2018-11-23 12:16:01,526 INFO L273 TraceCheckUtils]: 70: Hoare triple {5437#true} assume true; {5437#true} is VALID [2018-11-23 12:16:01,526 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {5437#true} {5438#false} #79#return; {5438#false} is VALID [2018-11-23 12:16:01,526 INFO L273 TraceCheckUtils]: 72: Hoare triple {5438#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {5438#false} is VALID [2018-11-23 12:16:01,526 INFO L273 TraceCheckUtils]: 73: Hoare triple {5438#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 74: Hoare triple {5438#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 75: Hoare triple {5438#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 76: Hoare triple {5438#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 77: Hoare triple {5438#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 78: Hoare triple {5438#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 79: Hoare triple {5438#false} assume !(~i~2 < 9); {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 80: Hoare triple {5438#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5438#false} is VALID [2018-11-23 12:16:01,527 INFO L256 TraceCheckUtils]: 81: Hoare triple {5438#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {5437#true} is VALID [2018-11-23 12:16:01,527 INFO L273 TraceCheckUtils]: 82: Hoare triple {5437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 83: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 84: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 87: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 88: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 89: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,528 INFO L273 TraceCheckUtils]: 90: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 91: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 92: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 93: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 94: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 95: Hoare triple {5437#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 96: Hoare triple {5437#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 97: Hoare triple {5437#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5437#true} is VALID [2018-11-23 12:16:01,529 INFO L273 TraceCheckUtils]: 98: Hoare triple {5437#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5437#true} is VALID [2018-11-23 12:16:01,530 INFO L273 TraceCheckUtils]: 99: Hoare triple {5437#true} assume !(~i~0 < 10); {5437#true} is VALID [2018-11-23 12:16:01,530 INFO L273 TraceCheckUtils]: 100: Hoare triple {5437#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5437#true} is VALID [2018-11-23 12:16:01,530 INFO L273 TraceCheckUtils]: 101: Hoare triple {5437#true} assume true; {5437#true} is VALID [2018-11-23 12:16:01,530 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {5437#true} {5438#false} #81#return; {5438#false} is VALID [2018-11-23 12:16:01,530 INFO L273 TraceCheckUtils]: 103: Hoare triple {5438#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5438#false} is VALID [2018-11-23 12:16:01,530 INFO L273 TraceCheckUtils]: 104: Hoare triple {5438#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5438#false} is VALID [2018-11-23 12:16:01,530 INFO L273 TraceCheckUtils]: 105: Hoare triple {5438#false} assume !false; {5438#false} is VALID [2018-11-23 12:16:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-11-23 12:16:01,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:01,535 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:16:01,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:01,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:01,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:01,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:01,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {5437#true} call ULTIMATE.init(); {5437#true} is VALID [2018-11-23 12:16:01,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {5437#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5437#true} is VALID [2018-11-23 12:16:01,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {5437#true} assume true; {5437#true} is VALID [2018-11-23 12:16:01,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5437#true} {5437#true} #73#return; {5437#true} is VALID [2018-11-23 12:16:01,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {5437#true} call #t~ret14 := main(); {5437#true} is VALID [2018-11-23 12:16:01,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {5437#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; {5437#true} is VALID [2018-11-23 12:16:01,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {5437#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5437#true} is VALID [2018-11-23 12:16:01,795 INFO L273 TraceCheckUtils]: 25: Hoare triple {5437#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5437#true} is VALID [2018-11-23 12:16:01,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {5437#true} assume !(~i~1 < 10); {5437#true} is VALID [2018-11-23 12:16:01,795 INFO L256 TraceCheckUtils]: 27: Hoare triple {5437#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {5437#true} is VALID [2018-11-23 12:16:01,795 INFO L273 TraceCheckUtils]: 28: Hoare triple {5437#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5531#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:01,796 INFO L273 TraceCheckUtils]: 29: Hoare triple {5531#(<= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5531#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:01,796 INFO L273 TraceCheckUtils]: 30: Hoare triple {5531#(<= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5531#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:01,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {5531#(<= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5531#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:01,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {5531#(<= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,797 INFO L273 TraceCheckUtils]: 33: Hoare triple {5440#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {5440#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,798 INFO L273 TraceCheckUtils]: 35: Hoare triple {5440#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5440#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:01,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {5440#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {5441#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {5441#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {5441#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5441#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:01,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {5441#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {5442#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {5442#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {5442#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5442#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:01,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {5442#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5443#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:01,803 INFO L273 TraceCheckUtils]: 45: Hoare triple {5443#(<= max_~i~0 4)} assume !(~i~0 < 10); {5438#false} is VALID [2018-11-23 12:16:01,803 INFO L273 TraceCheckUtils]: 46: Hoare triple {5438#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5438#false} is VALID [2018-11-23 12:16:01,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {5438#false} assume true; {5438#false} is VALID [2018-11-23 12:16:01,803 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {5438#false} {5437#true} #77#return; {5438#false} is VALID [2018-11-23 12:16:01,804 INFO L273 TraceCheckUtils]: 49: Hoare triple {5438#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5438#false} is VALID [2018-11-23 12:16:01,804 INFO L256 TraceCheckUtils]: 50: Hoare triple {5438#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {5438#false} is VALID [2018-11-23 12:16:01,804 INFO L273 TraceCheckUtils]: 51: Hoare triple {5438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5438#false} is VALID [2018-11-23 12:16:01,805 INFO L273 TraceCheckUtils]: 52: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,805 INFO L273 TraceCheckUtils]: 53: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,805 INFO L273 TraceCheckUtils]: 54: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,805 INFO L273 TraceCheckUtils]: 55: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,806 INFO L273 TraceCheckUtils]: 56: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,806 INFO L273 TraceCheckUtils]: 57: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,806 INFO L273 TraceCheckUtils]: 58: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,806 INFO L273 TraceCheckUtils]: 59: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,806 INFO L273 TraceCheckUtils]: 60: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,807 INFO L273 TraceCheckUtils]: 63: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,807 INFO L273 TraceCheckUtils]: 64: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,807 INFO L273 TraceCheckUtils]: 65: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,807 INFO L273 TraceCheckUtils]: 66: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,807 INFO L273 TraceCheckUtils]: 67: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {5438#false} assume !(~i~0 < 10); {5438#false} is VALID [2018-11-23 12:16:01,808 INFO L273 TraceCheckUtils]: 69: Hoare triple {5438#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5438#false} is VALID [2018-11-23 12:16:01,808 INFO L273 TraceCheckUtils]: 70: Hoare triple {5438#false} assume true; {5438#false} is VALID [2018-11-23 12:16:01,808 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {5438#false} {5438#false} #79#return; {5438#false} is VALID [2018-11-23 12:16:01,808 INFO L273 TraceCheckUtils]: 72: Hoare triple {5438#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {5438#false} is VALID [2018-11-23 12:16:01,808 INFO L273 TraceCheckUtils]: 73: Hoare triple {5438#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5438#false} is VALID [2018-11-23 12:16:01,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {5438#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5438#false} is VALID [2018-11-23 12:16:01,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {5438#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5438#false} is VALID [2018-11-23 12:16:01,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {5438#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5438#false} is VALID [2018-11-23 12:16:01,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {5438#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5438#false} is VALID [2018-11-23 12:16:01,809 INFO L273 TraceCheckUtils]: 78: Hoare triple {5438#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5438#false} is VALID [2018-11-23 12:16:01,810 INFO L273 TraceCheckUtils]: 79: Hoare triple {5438#false} assume !(~i~2 < 9); {5438#false} is VALID [2018-11-23 12:16:01,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {5438#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5438#false} is VALID [2018-11-23 12:16:01,810 INFO L256 TraceCheckUtils]: 81: Hoare triple {5438#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {5438#false} is VALID [2018-11-23 12:16:01,810 INFO L273 TraceCheckUtils]: 82: Hoare triple {5438#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {5438#false} is VALID [2018-11-23 12:16:01,810 INFO L273 TraceCheckUtils]: 83: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,810 INFO L273 TraceCheckUtils]: 84: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,810 INFO L273 TraceCheckUtils]: 85: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,811 INFO L273 TraceCheckUtils]: 86: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,811 INFO L273 TraceCheckUtils]: 87: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,811 INFO L273 TraceCheckUtils]: 88: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,811 INFO L273 TraceCheckUtils]: 89: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,811 INFO L273 TraceCheckUtils]: 90: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,812 INFO L273 TraceCheckUtils]: 91: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,812 INFO L273 TraceCheckUtils]: 92: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,812 INFO L273 TraceCheckUtils]: 93: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,812 INFO L273 TraceCheckUtils]: 94: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,812 INFO L273 TraceCheckUtils]: 95: Hoare triple {5438#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5438#false} is VALID [2018-11-23 12:16:01,812 INFO L273 TraceCheckUtils]: 96: Hoare triple {5438#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {5438#false} is VALID [2018-11-23 12:16:01,813 INFO L273 TraceCheckUtils]: 97: Hoare triple {5438#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {5438#false} is VALID [2018-11-23 12:16:01,813 INFO L273 TraceCheckUtils]: 98: Hoare triple {5438#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5438#false} is VALID [2018-11-23 12:16:01,813 INFO L273 TraceCheckUtils]: 99: Hoare triple {5438#false} assume !(~i~0 < 10); {5438#false} is VALID [2018-11-23 12:16:01,813 INFO L273 TraceCheckUtils]: 100: Hoare triple {5438#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5438#false} is VALID [2018-11-23 12:16:01,813 INFO L273 TraceCheckUtils]: 101: Hoare triple {5438#false} assume true; {5438#false} is VALID [2018-11-23 12:16:01,813 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {5438#false} {5438#false} #81#return; {5438#false} is VALID [2018-11-23 12:16:01,814 INFO L273 TraceCheckUtils]: 103: Hoare triple {5438#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5438#false} is VALID [2018-11-23 12:16:01,814 INFO L273 TraceCheckUtils]: 104: Hoare triple {5438#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5438#false} is VALID [2018-11-23 12:16:01,814 INFO L273 TraceCheckUtils]: 105: Hoare triple {5438#false} assume !false; {5438#false} is VALID [2018-11-23 12:16:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 148 proven. 28 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-23 12:16:01,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:01,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:16:01,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 106 [2018-11-23 12:16:01,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:01,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:01,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:01,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:01,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:01,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:01,941 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 8 states. [2018-11-23 12:16:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:02,222 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2018-11-23 12:16:02,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:16:02,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 106 [2018-11-23 12:16:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-23 12:16:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-23 12:16:02,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 84 transitions. [2018-11-23 12:16:03,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:03,171 INFO L225 Difference]: With dead ends: 109 [2018-11-23 12:16:03,171 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:16:03,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:16:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-11-23 12:16:03,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:03,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 69 states. [2018-11-23 12:16:03,210 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 69 states. [2018-11-23 12:16:03,210 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 69 states. [2018-11-23 12:16:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:03,212 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-23 12:16:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-23 12:16:03,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:03,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:03,213 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 72 states. [2018-11-23 12:16:03,213 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 72 states. [2018-11-23 12:16:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:03,215 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-23 12:16:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-23 12:16:03,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:03,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:03,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:03,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:16:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2018-11-23 12:16:03,218 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 106 [2018-11-23 12:16:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:03,219 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-11-23 12:16:03,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-23 12:16:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:16:03,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:03,220 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 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:16:03,221 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:03,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:03,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1038382400, now seen corresponding path program 11 times [2018-11-23 12:16:03,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:03,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:04,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {6154#true} call ULTIMATE.init(); {6154#true} is VALID [2018-11-23 12:16:04,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {6154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6154#true} is VALID [2018-11-23 12:16:04,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {6154#true} assume true; {6154#true} is VALID [2018-11-23 12:16:04,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6154#true} {6154#true} #73#return; {6154#true} is VALID [2018-11-23 12:16:04,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {6154#true} call #t~ret14 := main(); {6154#true} is VALID [2018-11-23 12:16:04,043 INFO L273 TraceCheckUtils]: 5: Hoare triple {6154#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; {6154#true} is VALID [2018-11-23 12:16:04,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,045 INFO L273 TraceCheckUtils]: 19: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L273 TraceCheckUtils]: 20: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L273 TraceCheckUtils]: 23: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L273 TraceCheckUtils]: 24: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {6154#true} assume !(~i~1 < 10); {6154#true} is VALID [2018-11-23 12:16:04,046 INFO L256 TraceCheckUtils]: 27: Hoare triple {6154#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {6154#true} is VALID [2018-11-23 12:16:04,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {6154#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6156#(= max_~i~0 0)} is VALID [2018-11-23 12:16:04,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {6156#(= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6156#(= max_~i~0 0)} is VALID [2018-11-23 12:16:04,047 INFO L273 TraceCheckUtils]: 30: Hoare triple {6156#(= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6156#(= max_~i~0 0)} is VALID [2018-11-23 12:16:04,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {6156#(= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6156#(= max_~i~0 0)} is VALID [2018-11-23 12:16:04,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {6156#(= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {6157#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {6157#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,049 INFO L273 TraceCheckUtils]: 35: Hoare triple {6157#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,049 INFO L273 TraceCheckUtils]: 36: Hoare triple {6157#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,050 INFO L273 TraceCheckUtils]: 37: Hoare triple {6158#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,050 INFO L273 TraceCheckUtils]: 38: Hoare triple {6158#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,051 INFO L273 TraceCheckUtils]: 39: Hoare triple {6158#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,052 INFO L273 TraceCheckUtils]: 40: Hoare triple {6158#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,052 INFO L273 TraceCheckUtils]: 41: Hoare triple {6159#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {6159#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {6159#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,054 INFO L273 TraceCheckUtils]: 44: Hoare triple {6159#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,055 INFO L273 TraceCheckUtils]: 45: Hoare triple {6160#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {6160#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,056 INFO L273 TraceCheckUtils]: 47: Hoare triple {6160#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {6160#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6161#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:04,057 INFO L273 TraceCheckUtils]: 49: Hoare triple {6161#(<= max_~i~0 5)} assume !(~i~0 < 10); {6155#false} is VALID [2018-11-23 12:16:04,057 INFO L273 TraceCheckUtils]: 50: Hoare triple {6155#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6155#false} is VALID [2018-11-23 12:16:04,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {6155#false} assume true; {6155#false} is VALID [2018-11-23 12:16:04,058 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {6155#false} {6154#true} #77#return; {6155#false} is VALID [2018-11-23 12:16:04,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {6155#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6155#false} is VALID [2018-11-23 12:16:04,058 INFO L256 TraceCheckUtils]: 54: Hoare triple {6155#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {6154#true} is VALID [2018-11-23 12:16:04,058 INFO L273 TraceCheckUtils]: 55: Hoare triple {6154#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6154#true} is VALID [2018-11-23 12:16:04,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,059 INFO L273 TraceCheckUtils]: 57: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,059 INFO L273 TraceCheckUtils]: 58: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,059 INFO L273 TraceCheckUtils]: 59: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,059 INFO L273 TraceCheckUtils]: 60: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 61: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 62: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 63: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 64: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 65: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 66: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 67: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 68: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,060 INFO L273 TraceCheckUtils]: 69: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 70: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 71: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 72: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 73: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 74: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 76: Hoare triple {6154#true} assume !(~i~0 < 10); {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 77: Hoare triple {6154#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6154#true} is VALID [2018-11-23 12:16:04,061 INFO L273 TraceCheckUtils]: 78: Hoare triple {6154#true} assume true; {6154#true} is VALID [2018-11-23 12:16:04,062 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6154#true} {6155#false} #79#return; {6155#false} is VALID [2018-11-23 12:16:04,062 INFO L273 TraceCheckUtils]: 80: Hoare triple {6155#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {6155#false} is VALID [2018-11-23 12:16:04,062 INFO L273 TraceCheckUtils]: 81: Hoare triple {6155#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6155#false} is VALID [2018-11-23 12:16:04,062 INFO L273 TraceCheckUtils]: 82: Hoare triple {6155#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6155#false} is VALID [2018-11-23 12:16:04,062 INFO L273 TraceCheckUtils]: 83: Hoare triple {6155#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6155#false} is VALID [2018-11-23 12:16:04,062 INFO L273 TraceCheckUtils]: 84: Hoare triple {6155#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6155#false} is VALID [2018-11-23 12:16:04,062 INFO L273 TraceCheckUtils]: 85: Hoare triple {6155#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6155#false} is VALID [2018-11-23 12:16:04,062 INFO L273 TraceCheckUtils]: 86: Hoare triple {6155#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6155#false} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 87: Hoare triple {6155#false} assume !(~i~2 < 9); {6155#false} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 88: Hoare triple {6155#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6155#false} is VALID [2018-11-23 12:16:04,063 INFO L256 TraceCheckUtils]: 89: Hoare triple {6155#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {6154#true} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 90: Hoare triple {6154#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6154#true} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 92: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 93: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 94: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,063 INFO L273 TraceCheckUtils]: 95: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 96: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 97: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 98: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 99: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 100: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 101: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 102: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 103: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,064 INFO L273 TraceCheckUtils]: 104: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 105: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 106: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 107: Hoare triple {6154#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 108: Hoare triple {6154#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 109: Hoare triple {6154#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 110: Hoare triple {6154#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 111: Hoare triple {6154#true} assume !(~i~0 < 10); {6154#true} is VALID [2018-11-23 12:16:04,065 INFO L273 TraceCheckUtils]: 112: Hoare triple {6154#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6154#true} is VALID [2018-11-23 12:16:04,066 INFO L273 TraceCheckUtils]: 113: Hoare triple {6154#true} assume true; {6154#true} is VALID [2018-11-23 12:16:04,066 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {6154#true} {6155#false} #81#return; {6155#false} is VALID [2018-11-23 12:16:04,066 INFO L273 TraceCheckUtils]: 115: Hoare triple {6155#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6155#false} is VALID [2018-11-23 12:16:04,066 INFO L273 TraceCheckUtils]: 116: Hoare triple {6155#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6155#false} is VALID [2018-11-23 12:16:04,066 INFO L273 TraceCheckUtils]: 117: Hoare triple {6155#false} assume !false; {6155#false} is VALID [2018-11-23 12:16:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-11-23 12:16:04,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:04,071 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:16:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:16:04,404 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:16:04,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:04,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:04,567 INFO L256 TraceCheckUtils]: 0: Hoare triple {6154#true} call ULTIMATE.init(); {6154#true} is VALID [2018-11-23 12:16:04,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {6154#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6154#true} is VALID [2018-11-23 12:16:04,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {6154#true} assume true; {6154#true} is VALID [2018-11-23 12:16:04,568 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6154#true} {6154#true} #73#return; {6154#true} is VALID [2018-11-23 12:16:04,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {6154#true} call #t~ret14 := main(); {6154#true} is VALID [2018-11-23 12:16:04,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {6154#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; {6154#true} is VALID [2018-11-23 12:16:04,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 20: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 21: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 22: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {6154#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6154#true} is VALID [2018-11-23 12:16:04,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {6154#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6154#true} is VALID [2018-11-23 12:16:04,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {6154#true} assume !(~i~1 < 10); {6154#true} is VALID [2018-11-23 12:16:04,571 INFO L256 TraceCheckUtils]: 27: Hoare triple {6154#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {6154#true} is VALID [2018-11-23 12:16:04,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {6154#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6249#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:04,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {6249#(<= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6249#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:04,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {6249#(<= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6249#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:04,572 INFO L273 TraceCheckUtils]: 31: Hoare triple {6249#(<= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6249#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:04,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {6249#(<= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {6157#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {6157#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {6157#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6157#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:04,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {6157#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,575 INFO L273 TraceCheckUtils]: 37: Hoare triple {6158#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,576 INFO L273 TraceCheckUtils]: 38: Hoare triple {6158#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,576 INFO L273 TraceCheckUtils]: 39: Hoare triple {6158#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6158#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:04,577 INFO L273 TraceCheckUtils]: 40: Hoare triple {6158#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {6159#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {6159#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {6159#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6159#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:04,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {6159#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,580 INFO L273 TraceCheckUtils]: 45: Hoare triple {6160#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {6160#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,581 INFO L273 TraceCheckUtils]: 47: Hoare triple {6160#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6160#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:04,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {6160#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6161#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:04,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {6161#(<= max_~i~0 5)} assume !(~i~0 < 10); {6155#false} is VALID [2018-11-23 12:16:04,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {6155#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6155#false} is VALID [2018-11-23 12:16:04,583 INFO L273 TraceCheckUtils]: 51: Hoare triple {6155#false} assume true; {6155#false} is VALID [2018-11-23 12:16:04,583 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {6155#false} {6154#true} #77#return; {6155#false} is VALID [2018-11-23 12:16:04,583 INFO L273 TraceCheckUtils]: 53: Hoare triple {6155#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6155#false} is VALID [2018-11-23 12:16:04,583 INFO L256 TraceCheckUtils]: 54: Hoare triple {6155#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {6155#false} is VALID [2018-11-23 12:16:04,583 INFO L273 TraceCheckUtils]: 55: Hoare triple {6155#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6155#false} is VALID [2018-11-23 12:16:04,584 INFO L273 TraceCheckUtils]: 56: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,584 INFO L273 TraceCheckUtils]: 57: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,584 INFO L273 TraceCheckUtils]: 58: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,584 INFO L273 TraceCheckUtils]: 59: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,584 INFO L273 TraceCheckUtils]: 60: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,585 INFO L273 TraceCheckUtils]: 61: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,585 INFO L273 TraceCheckUtils]: 62: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,585 INFO L273 TraceCheckUtils]: 63: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,585 INFO L273 TraceCheckUtils]: 64: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,585 INFO L273 TraceCheckUtils]: 65: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,586 INFO L273 TraceCheckUtils]: 66: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,586 INFO L273 TraceCheckUtils]: 67: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,586 INFO L273 TraceCheckUtils]: 68: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,586 INFO L273 TraceCheckUtils]: 69: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,586 INFO L273 TraceCheckUtils]: 70: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,587 INFO L273 TraceCheckUtils]: 71: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,587 INFO L273 TraceCheckUtils]: 72: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,587 INFO L273 TraceCheckUtils]: 73: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,587 INFO L273 TraceCheckUtils]: 74: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 75: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 76: Hoare triple {6155#false} assume !(~i~0 < 10); {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 77: Hoare triple {6155#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 78: Hoare triple {6155#false} assume true; {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6155#false} {6155#false} #79#return; {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 80: Hoare triple {6155#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 81: Hoare triple {6155#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 82: Hoare triple {6155#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6155#false} is VALID [2018-11-23 12:16:04,588 INFO L273 TraceCheckUtils]: 83: Hoare triple {6155#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 84: Hoare triple {6155#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 85: Hoare triple {6155#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 86: Hoare triple {6155#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 87: Hoare triple {6155#false} assume !(~i~2 < 9); {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 88: Hoare triple {6155#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L256 TraceCheckUtils]: 89: Hoare triple {6155#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 90: Hoare triple {6155#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 91: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,589 INFO L273 TraceCheckUtils]: 92: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 93: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 94: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 95: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 96: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 97: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 98: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 99: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,590 INFO L273 TraceCheckUtils]: 100: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 101: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 102: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 103: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 104: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 105: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 106: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 107: Hoare triple {6155#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 108: Hoare triple {6155#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6155#false} is VALID [2018-11-23 12:16:04,591 INFO L273 TraceCheckUtils]: 109: Hoare triple {6155#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L273 TraceCheckUtils]: 110: Hoare triple {6155#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L273 TraceCheckUtils]: 111: Hoare triple {6155#false} assume !(~i~0 < 10); {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L273 TraceCheckUtils]: 112: Hoare triple {6155#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L273 TraceCheckUtils]: 113: Hoare triple {6155#false} assume true; {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {6155#false} {6155#false} #81#return; {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L273 TraceCheckUtils]: 115: Hoare triple {6155#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L273 TraceCheckUtils]: 116: Hoare triple {6155#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6155#false} is VALID [2018-11-23 12:16:04,592 INFO L273 TraceCheckUtils]: 117: Hoare triple {6155#false} assume !false; {6155#false} is VALID [2018-11-23 12:16:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 224 proven. 45 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 12:16:04,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:04,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:16:04,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2018-11-23 12:16:04,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:04,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:16:04,714 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:04,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:16:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:16:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:04,715 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 9 states. [2018-11-23 12:16:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:04,926 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2018-11-23 12:16:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:04,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2018-11-23 12:16:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 12:16:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2018-11-23 12:16:04,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2018-11-23 12:16:05,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:05,333 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:16:05,333 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:16:05,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:16:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-11-23 12:16:05,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:05,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 73 states. [2018-11-23 12:16:05,400 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 73 states. [2018-11-23 12:16:05,400 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 73 states. [2018-11-23 12:16:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:05,403 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-23 12:16:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-23 12:16:05,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:05,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:05,403 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 76 states. [2018-11-23 12:16:05,404 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 76 states. [2018-11-23 12:16:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:05,406 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-23 12:16:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-23 12:16:05,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:05,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:05,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:05,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:16:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2018-11-23 12:16:05,409 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 118 [2018-11-23 12:16:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:05,409 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2018-11-23 12:16:05,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:16:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-11-23 12:16:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:16:05,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:05,411 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 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:16:05,411 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:05,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:05,412 INFO L82 PathProgramCache]: Analyzing trace with hash -307697957, now seen corresponding path program 12 times [2018-11-23 12:16:05,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:05,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:05,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:05,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:06,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {6931#true} call ULTIMATE.init(); {6931#true} is VALID [2018-11-23 12:16:06,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {6931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6931#true} is VALID [2018-11-23 12:16:06,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {6931#true} assume true; {6931#true} is VALID [2018-11-23 12:16:06,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6931#true} {6931#true} #73#return; {6931#true} is VALID [2018-11-23 12:16:06,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {6931#true} call #t~ret14 := main(); {6931#true} is VALID [2018-11-23 12:16:06,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {6931#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; {6931#true} is VALID [2018-11-23 12:16:06,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {6931#true} assume !(~i~1 < 10); {6931#true} is VALID [2018-11-23 12:16:06,524 INFO L256 TraceCheckUtils]: 27: Hoare triple {6931#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {6931#true} is VALID [2018-11-23 12:16:06,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {6931#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6933#(= max_~i~0 0)} is VALID [2018-11-23 12:16:06,525 INFO L273 TraceCheckUtils]: 29: Hoare triple {6933#(= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6933#(= max_~i~0 0)} is VALID [2018-11-23 12:16:06,525 INFO L273 TraceCheckUtils]: 30: Hoare triple {6933#(= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6933#(= max_~i~0 0)} is VALID [2018-11-23 12:16:06,526 INFO L273 TraceCheckUtils]: 31: Hoare triple {6933#(= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6933#(= max_~i~0 0)} is VALID [2018-11-23 12:16:06,526 INFO L273 TraceCheckUtils]: 32: Hoare triple {6933#(= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6934#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:06,527 INFO L273 TraceCheckUtils]: 33: Hoare triple {6934#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6934#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:06,527 INFO L273 TraceCheckUtils]: 34: Hoare triple {6934#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6934#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:06,527 INFO L273 TraceCheckUtils]: 35: Hoare triple {6934#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6934#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:06,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {6934#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6935#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:06,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {6935#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6935#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:06,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {6935#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6935#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:06,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {6935#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6935#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:06,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {6935#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6936#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:06,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {6936#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6936#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:06,531 INFO L273 TraceCheckUtils]: 42: Hoare triple {6936#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6936#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:06,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {6936#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6936#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:06,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {6936#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6937#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:06,532 INFO L273 TraceCheckUtils]: 45: Hoare triple {6937#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6937#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:06,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {6937#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6937#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:06,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {6937#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6937#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:06,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {6937#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6938#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:06,535 INFO L273 TraceCheckUtils]: 49: Hoare triple {6938#(<= max_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6938#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:06,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {6938#(<= max_~i~0 5)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6938#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:06,536 INFO L273 TraceCheckUtils]: 51: Hoare triple {6938#(<= max_~i~0 5)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6938#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:06,537 INFO L273 TraceCheckUtils]: 52: Hoare triple {6938#(<= max_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6939#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:06,537 INFO L273 TraceCheckUtils]: 53: Hoare triple {6939#(<= max_~i~0 6)} assume !(~i~0 < 10); {6932#false} is VALID [2018-11-23 12:16:06,538 INFO L273 TraceCheckUtils]: 54: Hoare triple {6932#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6932#false} is VALID [2018-11-23 12:16:06,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {6932#false} assume true; {6932#false} is VALID [2018-11-23 12:16:06,538 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {6932#false} {6931#true} #77#return; {6932#false} is VALID [2018-11-23 12:16:06,538 INFO L273 TraceCheckUtils]: 57: Hoare triple {6932#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6932#false} is VALID [2018-11-23 12:16:06,538 INFO L256 TraceCheckUtils]: 58: Hoare triple {6932#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {6931#true} is VALID [2018-11-23 12:16:06,539 INFO L273 TraceCheckUtils]: 59: Hoare triple {6931#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6931#true} is VALID [2018-11-23 12:16:06,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,539 INFO L273 TraceCheckUtils]: 61: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,539 INFO L273 TraceCheckUtils]: 62: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,539 INFO L273 TraceCheckUtils]: 63: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,540 INFO L273 TraceCheckUtils]: 64: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,540 INFO L273 TraceCheckUtils]: 65: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,540 INFO L273 TraceCheckUtils]: 66: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,540 INFO L273 TraceCheckUtils]: 67: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,540 INFO L273 TraceCheckUtils]: 68: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,541 INFO L273 TraceCheckUtils]: 69: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,541 INFO L273 TraceCheckUtils]: 70: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,541 INFO L273 TraceCheckUtils]: 71: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,541 INFO L273 TraceCheckUtils]: 72: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,541 INFO L273 TraceCheckUtils]: 73: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,542 INFO L273 TraceCheckUtils]: 74: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,542 INFO L273 TraceCheckUtils]: 75: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,542 INFO L273 TraceCheckUtils]: 76: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,542 INFO L273 TraceCheckUtils]: 77: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,542 INFO L273 TraceCheckUtils]: 78: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,542 INFO L273 TraceCheckUtils]: 79: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 80: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 81: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 82: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 83: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 84: Hoare triple {6931#true} assume !(~i~0 < 10); {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 85: Hoare triple {6931#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 86: Hoare triple {6931#true} assume true; {6931#true} is VALID [2018-11-23 12:16:06,543 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6931#true} {6932#false} #79#return; {6932#false} is VALID [2018-11-23 12:16:06,543 INFO L273 TraceCheckUtils]: 88: Hoare triple {6932#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 89: Hoare triple {6932#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 90: Hoare triple {6932#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 91: Hoare triple {6932#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 92: Hoare triple {6932#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 93: Hoare triple {6932#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 94: Hoare triple {6932#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 95: Hoare triple {6932#false} assume !(~i~2 < 9); {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L273 TraceCheckUtils]: 96: Hoare triple {6932#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6932#false} is VALID [2018-11-23 12:16:06,544 INFO L256 TraceCheckUtils]: 97: Hoare triple {6932#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 98: Hoare triple {6931#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 99: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 100: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 101: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 102: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 103: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 104: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,545 INFO L273 TraceCheckUtils]: 105: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 106: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 107: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 108: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 109: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 110: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 111: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 112: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 113: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,546 INFO L273 TraceCheckUtils]: 114: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 115: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 116: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 117: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 118: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 119: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 120: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 121: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:06,547 INFO L273 TraceCheckUtils]: 122: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:06,548 INFO L273 TraceCheckUtils]: 123: Hoare triple {6931#true} assume !(~i~0 < 10); {6931#true} is VALID [2018-11-23 12:16:06,548 INFO L273 TraceCheckUtils]: 124: Hoare triple {6931#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6931#true} is VALID [2018-11-23 12:16:06,548 INFO L273 TraceCheckUtils]: 125: Hoare triple {6931#true} assume true; {6931#true} is VALID [2018-11-23 12:16:06,548 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {6931#true} {6932#false} #81#return; {6932#false} is VALID [2018-11-23 12:16:06,548 INFO L273 TraceCheckUtils]: 127: Hoare triple {6932#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6932#false} is VALID [2018-11-23 12:16:06,548 INFO L273 TraceCheckUtils]: 128: Hoare triple {6932#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6932#false} is VALID [2018-11-23 12:16:06,548 INFO L273 TraceCheckUtils]: 129: Hoare triple {6932#false} assume !false; {6932#false} is VALID [2018-11-23 12:16:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 386 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2018-11-23 12:16:06,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:06,558 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:16:06,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:16:06,679 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:16:06,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:06,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:07,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {6931#true} call ULTIMATE.init(); {6931#true} is VALID [2018-11-23 12:16:07,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {6931#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6931#true} is VALID [2018-11-23 12:16:07,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {6931#true} assume true; {6931#true} is VALID [2018-11-23 12:16:07,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6931#true} {6931#true} #73#return; {6931#true} is VALID [2018-11-23 12:16:07,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {6931#true} call #t~ret14 := main(); {6931#true} is VALID [2018-11-23 12:16:07,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {6931#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; {6931#true} is VALID [2018-11-23 12:16:07,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {6931#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {6931#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {6931#true} assume !(~i~1 < 10); {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L256 TraceCheckUtils]: 27: Hoare triple {6931#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {6931#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 36: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 38: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 42: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 46: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 47: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 48: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L273 TraceCheckUtils]: 52: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L273 TraceCheckUtils]: 53: Hoare triple {6931#true} assume !(~i~0 < 10); {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L273 TraceCheckUtils]: 54: Hoare triple {6931#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L273 TraceCheckUtils]: 55: Hoare triple {6931#true} assume true; {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {6931#true} {6931#true} #77#return; {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L273 TraceCheckUtils]: 57: Hoare triple {6931#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6931#true} is VALID [2018-11-23 12:16:07,139 INFO L256 TraceCheckUtils]: 58: Hoare triple {6931#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 59: Hoare triple {6931#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 60: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 61: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 62: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 63: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 64: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 65: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 66: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,140 INFO L273 TraceCheckUtils]: 67: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 68: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 69: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 70: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 71: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 72: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 73: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 74: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,141 INFO L273 TraceCheckUtils]: 75: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 76: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 77: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 78: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 79: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 80: Hoare triple {6931#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 81: Hoare triple {6931#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 82: Hoare triple {6931#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 83: Hoare triple {6931#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6931#true} is VALID [2018-11-23 12:16:07,142 INFO L273 TraceCheckUtils]: 84: Hoare triple {6931#true} assume !(~i~0 < 10); {6931#true} is VALID [2018-11-23 12:16:07,143 INFO L273 TraceCheckUtils]: 85: Hoare triple {6931#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6931#true} is VALID [2018-11-23 12:16:07,143 INFO L273 TraceCheckUtils]: 86: Hoare triple {6931#true} assume true; {6931#true} is VALID [2018-11-23 12:16:07,143 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {6931#true} {6931#true} #79#return; {6931#true} is VALID [2018-11-23 12:16:07,143 INFO L273 TraceCheckUtils]: 88: Hoare triple {6931#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {7207#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:07,144 INFO L273 TraceCheckUtils]: 89: Hoare triple {7207#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7207#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:07,144 INFO L273 TraceCheckUtils]: 90: Hoare triple {7207#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7214#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:07,145 INFO L273 TraceCheckUtils]: 91: Hoare triple {7214#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7214#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:07,145 INFO L273 TraceCheckUtils]: 92: Hoare triple {7214#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7221#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:07,145 INFO L273 TraceCheckUtils]: 93: Hoare triple {7221#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7221#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:07,146 INFO L273 TraceCheckUtils]: 94: Hoare triple {7221#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7228#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:07,147 INFO L273 TraceCheckUtils]: 95: Hoare triple {7228#(<= main_~i~2 3)} assume !(~i~2 < 9); {6932#false} is VALID [2018-11-23 12:16:07,147 INFO L273 TraceCheckUtils]: 96: Hoare triple {6932#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6932#false} is VALID [2018-11-23 12:16:07,147 INFO L256 TraceCheckUtils]: 97: Hoare triple {6932#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {6932#false} is VALID [2018-11-23 12:16:07,147 INFO L273 TraceCheckUtils]: 98: Hoare triple {6932#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {6932#false} is VALID [2018-11-23 12:16:07,148 INFO L273 TraceCheckUtils]: 99: Hoare triple {6932#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6932#false} is VALID [2018-11-23 12:16:07,148 INFO L273 TraceCheckUtils]: 100: Hoare triple {6932#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6932#false} is VALID [2018-11-23 12:16:07,148 INFO L273 TraceCheckUtils]: 101: Hoare triple {6932#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6932#false} is VALID [2018-11-23 12:16:07,148 INFO L273 TraceCheckUtils]: 102: Hoare triple {6932#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6932#false} is VALID [2018-11-23 12:16:07,148 INFO L273 TraceCheckUtils]: 103: Hoare triple {6932#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6932#false} is VALID [2018-11-23 12:16:07,149 INFO L273 TraceCheckUtils]: 104: Hoare triple {6932#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6932#false} is VALID [2018-11-23 12:16:07,149 INFO L273 TraceCheckUtils]: 105: Hoare triple {6932#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6932#false} is VALID [2018-11-23 12:16:07,149 INFO L273 TraceCheckUtils]: 106: Hoare triple {6932#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6932#false} is VALID [2018-11-23 12:16:07,149 INFO L273 TraceCheckUtils]: 107: Hoare triple {6932#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6932#false} is VALID [2018-11-23 12:16:07,149 INFO L273 TraceCheckUtils]: 108: Hoare triple {6932#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6932#false} is VALID [2018-11-23 12:16:07,149 INFO L273 TraceCheckUtils]: 109: Hoare triple {6932#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 110: Hoare triple {6932#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 111: Hoare triple {6932#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 112: Hoare triple {6932#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 113: Hoare triple {6932#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 114: Hoare triple {6932#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 115: Hoare triple {6932#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 116: Hoare triple {6932#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6932#false} is VALID [2018-11-23 12:16:07,150 INFO L273 TraceCheckUtils]: 117: Hoare triple {6932#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 118: Hoare triple {6932#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 119: Hoare triple {6932#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 120: Hoare triple {6932#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 121: Hoare triple {6932#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 122: Hoare triple {6932#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 123: Hoare triple {6932#false} assume !(~i~0 < 10); {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 124: Hoare triple {6932#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L273 TraceCheckUtils]: 125: Hoare triple {6932#false} assume true; {6932#false} is VALID [2018-11-23 12:16:07,151 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {6932#false} {6932#false} #81#return; {6932#false} is VALID [2018-11-23 12:16:07,152 INFO L273 TraceCheckUtils]: 127: Hoare triple {6932#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6932#false} is VALID [2018-11-23 12:16:07,152 INFO L273 TraceCheckUtils]: 128: Hoare triple {6932#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6932#false} is VALID [2018-11-23 12:16:07,152 INFO L273 TraceCheckUtils]: 129: Hoare triple {6932#false} assume !false; {6932#false} is VALID [2018-11-23 12:16:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 322 proven. 9 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2018-11-23 12:16:07,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:07,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 12:16:07,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-23 12:16:07,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:07,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:16:07,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:07,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:16:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:16:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:07,263 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 13 states. [2018-11-23 12:16:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:07,756 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2018-11-23 12:16:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:16:07,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-23 12:16:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 103 transitions. [2018-11-23 12:16:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 103 transitions. [2018-11-23 12:16:07,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 103 transitions. [2018-11-23 12:16:08,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:08,988 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:16:08,988 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:16:08,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:16:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-11-23 12:16:09,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:09,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 79 states. [2018-11-23 12:16:09,060 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 79 states. [2018-11-23 12:16:09,060 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 79 states. [2018-11-23 12:16:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:09,063 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-23 12:16:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-23 12:16:09,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:09,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:09,065 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 83 states. [2018-11-23 12:16:09,065 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 83 states. [2018-11-23 12:16:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:09,068 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-23 12:16:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-23 12:16:09,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:09,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:09,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:09,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 12:16:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-11-23 12:16:09,072 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 130 [2018-11-23 12:16:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:09,072 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-11-23 12:16:09,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:16:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-11-23 12:16:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:16:09,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:09,075 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 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:16:09,075 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:09,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1959206484, now seen corresponding path program 13 times [2018-11-23 12:16:09,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:09,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:09,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:09,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:10,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {7784#true} call ULTIMATE.init(); {7784#true} is VALID [2018-11-23 12:16:10,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {7784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7784#true} is VALID [2018-11-23 12:16:10,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-23 12:16:10,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7784#true} {7784#true} #73#return; {7784#true} is VALID [2018-11-23 12:16:10,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {7784#true} call #t~ret14 := main(); {7784#true} is VALID [2018-11-23 12:16:10,054 INFO L273 TraceCheckUtils]: 5: Hoare triple {7784#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; {7784#true} is VALID [2018-11-23 12:16:10,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,057 INFO L273 TraceCheckUtils]: 17: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,057 INFO L273 TraceCheckUtils]: 22: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,057 INFO L273 TraceCheckUtils]: 23: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {7784#true} assume !(~i~1 < 10); {7784#true} is VALID [2018-11-23 12:16:10,058 INFO L256 TraceCheckUtils]: 27: Hoare triple {7784#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {7784#true} is VALID [2018-11-23 12:16:10,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {7784#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7786#(= max_~i~0 0)} is VALID [2018-11-23 12:16:10,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {7786#(= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7786#(= max_~i~0 0)} is VALID [2018-11-23 12:16:10,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {7786#(= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7786#(= max_~i~0 0)} is VALID [2018-11-23 12:16:10,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {7786#(= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7786#(= max_~i~0 0)} is VALID [2018-11-23 12:16:10,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {7786#(= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {7787#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {7787#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,061 INFO L273 TraceCheckUtils]: 35: Hoare triple {7787#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {7787#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {7788#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,064 INFO L273 TraceCheckUtils]: 38: Hoare triple {7788#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,064 INFO L273 TraceCheckUtils]: 39: Hoare triple {7788#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,065 INFO L273 TraceCheckUtils]: 40: Hoare triple {7788#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,066 INFO L273 TraceCheckUtils]: 41: Hoare triple {7789#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {7789#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,067 INFO L273 TraceCheckUtils]: 43: Hoare triple {7789#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {7789#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,068 INFO L273 TraceCheckUtils]: 45: Hoare triple {7790#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,069 INFO L273 TraceCheckUtils]: 46: Hoare triple {7790#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {7790#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {7790#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {7791#(<= max_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,072 INFO L273 TraceCheckUtils]: 50: Hoare triple {7791#(<= max_~i~0 5)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,072 INFO L273 TraceCheckUtils]: 51: Hoare triple {7791#(<= max_~i~0 5)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {7791#(<= max_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,074 INFO L273 TraceCheckUtils]: 53: Hoare triple {7792#(<= max_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,075 INFO L273 TraceCheckUtils]: 54: Hoare triple {7792#(<= max_~i~0 6)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,075 INFO L273 TraceCheckUtils]: 55: Hoare triple {7792#(<= max_~i~0 6)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {7792#(<= max_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7793#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:10,077 INFO L273 TraceCheckUtils]: 57: Hoare triple {7793#(<= max_~i~0 7)} assume !(~i~0 < 10); {7785#false} is VALID [2018-11-23 12:16:10,077 INFO L273 TraceCheckUtils]: 58: Hoare triple {7785#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7785#false} is VALID [2018-11-23 12:16:10,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-23 12:16:10,078 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {7785#false} {7784#true} #77#return; {7785#false} is VALID [2018-11-23 12:16:10,078 INFO L273 TraceCheckUtils]: 61: Hoare triple {7785#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7785#false} is VALID [2018-11-23 12:16:10,078 INFO L256 TraceCheckUtils]: 62: Hoare triple {7785#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {7784#true} is VALID [2018-11-23 12:16:10,078 INFO L273 TraceCheckUtils]: 63: Hoare triple {7784#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7784#true} is VALID [2018-11-23 12:16:10,079 INFO L273 TraceCheckUtils]: 64: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,079 INFO L273 TraceCheckUtils]: 65: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,079 INFO L273 TraceCheckUtils]: 66: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,079 INFO L273 TraceCheckUtils]: 67: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,080 INFO L273 TraceCheckUtils]: 69: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,080 INFO L273 TraceCheckUtils]: 70: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,080 INFO L273 TraceCheckUtils]: 71: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,081 INFO L273 TraceCheckUtils]: 72: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,081 INFO L273 TraceCheckUtils]: 73: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,081 INFO L273 TraceCheckUtils]: 74: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,081 INFO L273 TraceCheckUtils]: 75: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,082 INFO L273 TraceCheckUtils]: 76: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,082 INFO L273 TraceCheckUtils]: 77: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,082 INFO L273 TraceCheckUtils]: 78: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,083 INFO L273 TraceCheckUtils]: 79: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,083 INFO L273 TraceCheckUtils]: 80: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,083 INFO L273 TraceCheckUtils]: 81: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,083 INFO L273 TraceCheckUtils]: 82: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,083 INFO L273 TraceCheckUtils]: 83: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,083 INFO L273 TraceCheckUtils]: 84: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,084 INFO L273 TraceCheckUtils]: 85: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,084 INFO L273 TraceCheckUtils]: 86: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,084 INFO L273 TraceCheckUtils]: 87: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,084 INFO L273 TraceCheckUtils]: 88: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,084 INFO L273 TraceCheckUtils]: 89: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,084 INFO L273 TraceCheckUtils]: 90: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,084 INFO L273 TraceCheckUtils]: 91: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,085 INFO L273 TraceCheckUtils]: 92: Hoare triple {7784#true} assume !(~i~0 < 10); {7784#true} is VALID [2018-11-23 12:16:10,085 INFO L273 TraceCheckUtils]: 93: Hoare triple {7784#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7784#true} is VALID [2018-11-23 12:16:10,085 INFO L273 TraceCheckUtils]: 94: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-23 12:16:10,085 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {7784#true} {7785#false} #79#return; {7785#false} is VALID [2018-11-23 12:16:10,085 INFO L273 TraceCheckUtils]: 96: Hoare triple {7785#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {7785#false} is VALID [2018-11-23 12:16:10,086 INFO L273 TraceCheckUtils]: 97: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,086 INFO L273 TraceCheckUtils]: 98: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,086 INFO L273 TraceCheckUtils]: 99: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,086 INFO L273 TraceCheckUtils]: 100: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,086 INFO L273 TraceCheckUtils]: 101: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,087 INFO L273 TraceCheckUtils]: 102: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,087 INFO L273 TraceCheckUtils]: 103: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,087 INFO L273 TraceCheckUtils]: 104: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,087 INFO L273 TraceCheckUtils]: 105: Hoare triple {7785#false} assume !(~i~2 < 9); {7785#false} is VALID [2018-11-23 12:16:10,087 INFO L273 TraceCheckUtils]: 106: Hoare triple {7785#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {7785#false} is VALID [2018-11-23 12:16:10,087 INFO L256 TraceCheckUtils]: 107: Hoare triple {7785#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {7784#true} is VALID [2018-11-23 12:16:10,087 INFO L273 TraceCheckUtils]: 108: Hoare triple {7784#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7784#true} is VALID [2018-11-23 12:16:10,088 INFO L273 TraceCheckUtils]: 109: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,088 INFO L273 TraceCheckUtils]: 110: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,088 INFO L273 TraceCheckUtils]: 111: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,088 INFO L273 TraceCheckUtils]: 112: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,088 INFO L273 TraceCheckUtils]: 113: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,088 INFO L273 TraceCheckUtils]: 114: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,088 INFO L273 TraceCheckUtils]: 115: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,089 INFO L273 TraceCheckUtils]: 116: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,089 INFO L273 TraceCheckUtils]: 117: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,089 INFO L273 TraceCheckUtils]: 118: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,089 INFO L273 TraceCheckUtils]: 119: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,089 INFO L273 TraceCheckUtils]: 120: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,089 INFO L273 TraceCheckUtils]: 121: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,089 INFO L273 TraceCheckUtils]: 122: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,090 INFO L273 TraceCheckUtils]: 123: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,090 INFO L273 TraceCheckUtils]: 124: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,090 INFO L273 TraceCheckUtils]: 125: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,090 INFO L273 TraceCheckUtils]: 126: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,090 INFO L273 TraceCheckUtils]: 127: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,090 INFO L273 TraceCheckUtils]: 128: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,090 INFO L273 TraceCheckUtils]: 129: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,091 INFO L273 TraceCheckUtils]: 130: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,091 INFO L273 TraceCheckUtils]: 131: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,091 INFO L273 TraceCheckUtils]: 132: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,091 INFO L273 TraceCheckUtils]: 133: Hoare triple {7784#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7784#true} is VALID [2018-11-23 12:16:10,091 INFO L273 TraceCheckUtils]: 134: Hoare triple {7784#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7784#true} is VALID [2018-11-23 12:16:10,091 INFO L273 TraceCheckUtils]: 135: Hoare triple {7784#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7784#true} is VALID [2018-11-23 12:16:10,092 INFO L273 TraceCheckUtils]: 136: Hoare triple {7784#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7784#true} is VALID [2018-11-23 12:16:10,092 INFO L273 TraceCheckUtils]: 137: Hoare triple {7784#true} assume !(~i~0 < 10); {7784#true} is VALID [2018-11-23 12:16:10,092 INFO L273 TraceCheckUtils]: 138: Hoare triple {7784#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7784#true} is VALID [2018-11-23 12:16:10,092 INFO L273 TraceCheckUtils]: 139: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-23 12:16:10,092 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {7784#true} {7785#false} #81#return; {7785#false} is VALID [2018-11-23 12:16:10,092 INFO L273 TraceCheckUtils]: 141: Hoare triple {7785#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7785#false} is VALID [2018-11-23 12:16:10,092 INFO L273 TraceCheckUtils]: 142: Hoare triple {7785#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7785#false} is VALID [2018-11-23 12:16:10,093 INFO L273 TraceCheckUtils]: 143: Hoare triple {7785#false} assume !false; {7785#false} is VALID [2018-11-23 12:16:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 519 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2018-11-23 12:16:10,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:10,121 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:16:10,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:10,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:10,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {7784#true} call ULTIMATE.init(); {7784#true} is VALID [2018-11-23 12:16:10,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {7784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7784#true} is VALID [2018-11-23 12:16:10,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-23 12:16:10,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7784#true} {7784#true} #73#return; {7784#true} is VALID [2018-11-23 12:16:10,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {7784#true} call #t~ret14 := main(); {7784#true} is VALID [2018-11-23 12:16:10,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {7784#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; {7784#true} is VALID [2018-11-23 12:16:10,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,408 INFO L273 TraceCheckUtils]: 22: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,408 INFO L273 TraceCheckUtils]: 24: Hoare triple {7784#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#true} is VALID [2018-11-23 12:16:10,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {7784#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#true} is VALID [2018-11-23 12:16:10,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {7784#true} assume !(~i~1 < 10); {7784#true} is VALID [2018-11-23 12:16:10,408 INFO L256 TraceCheckUtils]: 27: Hoare triple {7784#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {7784#true} is VALID [2018-11-23 12:16:10,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {7784#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7881#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:10,409 INFO L273 TraceCheckUtils]: 29: Hoare triple {7881#(<= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7881#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:10,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {7881#(<= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7881#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:10,409 INFO L273 TraceCheckUtils]: 31: Hoare triple {7881#(<= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7881#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:10,410 INFO L273 TraceCheckUtils]: 32: Hoare triple {7881#(<= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,410 INFO L273 TraceCheckUtils]: 33: Hoare triple {7787#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {7787#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {7787#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7787#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:10,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {7787#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {7788#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {7788#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {7788#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7788#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:10,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {7788#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {7789#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {7789#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {7789#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7789#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:10,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {7789#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {7790#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {7790#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {7790#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7790#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:10,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {7790#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {7791#(<= max_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {7791#(<= max_~i~0 5)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {7791#(<= max_~i~0 5)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7791#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:10,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {7791#(<= max_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {7792#(<= max_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {7792#(<= max_~i~0 6)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {7792#(<= max_~i~0 6)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7792#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:10,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {7792#(<= max_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7793#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:10,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {7793#(<= max_~i~0 7)} assume !(~i~0 < 10); {7785#false} is VALID [2018-11-23 12:16:10,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {7785#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7785#false} is VALID [2018-11-23 12:16:10,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-23 12:16:10,424 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {7785#false} {7784#true} #77#return; {7785#false} is VALID [2018-11-23 12:16:10,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {7785#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7785#false} is VALID [2018-11-23 12:16:10,424 INFO L256 TraceCheckUtils]: 62: Hoare triple {7785#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {7785#false} is VALID [2018-11-23 12:16:10,425 INFO L273 TraceCheckUtils]: 63: Hoare triple {7785#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7785#false} is VALID [2018-11-23 12:16:10,425 INFO L273 TraceCheckUtils]: 64: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,425 INFO L273 TraceCheckUtils]: 66: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,426 INFO L273 TraceCheckUtils]: 68: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,426 INFO L273 TraceCheckUtils]: 69: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,426 INFO L273 TraceCheckUtils]: 70: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,426 INFO L273 TraceCheckUtils]: 71: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,426 INFO L273 TraceCheckUtils]: 72: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,427 INFO L273 TraceCheckUtils]: 73: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,427 INFO L273 TraceCheckUtils]: 74: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,427 INFO L273 TraceCheckUtils]: 75: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,427 INFO L273 TraceCheckUtils]: 76: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,427 INFO L273 TraceCheckUtils]: 77: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,428 INFO L273 TraceCheckUtils]: 78: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,428 INFO L273 TraceCheckUtils]: 79: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,428 INFO L273 TraceCheckUtils]: 80: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,428 INFO L273 TraceCheckUtils]: 81: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,428 INFO L273 TraceCheckUtils]: 82: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 83: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 84: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 85: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 86: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 87: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 88: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 89: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 90: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,429 INFO L273 TraceCheckUtils]: 91: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L273 TraceCheckUtils]: 92: Hoare triple {7785#false} assume !(~i~0 < 10); {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L273 TraceCheckUtils]: 93: Hoare triple {7785#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L273 TraceCheckUtils]: 94: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {7785#false} {7785#false} #79#return; {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L273 TraceCheckUtils]: 96: Hoare triple {7785#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L273 TraceCheckUtils]: 97: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L273 TraceCheckUtils]: 98: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,430 INFO L273 TraceCheckUtils]: 99: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 100: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 101: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 102: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 103: Hoare triple {7785#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 104: Hoare triple {7785#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 105: Hoare triple {7785#false} assume !(~i~2 < 9); {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 106: Hoare triple {7785#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L256 TraceCheckUtils]: 107: Hoare triple {7785#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {7785#false} is VALID [2018-11-23 12:16:10,431 INFO L273 TraceCheckUtils]: 108: Hoare triple {7785#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 109: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 110: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 111: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 112: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 113: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 114: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 115: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 116: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,432 INFO L273 TraceCheckUtils]: 117: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 118: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 119: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 120: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 121: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 122: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 123: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 124: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 125: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,433 INFO L273 TraceCheckUtils]: 126: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 127: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 128: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 129: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 130: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 131: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 132: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 133: Hoare triple {7785#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7785#false} is VALID [2018-11-23 12:16:10,434 INFO L273 TraceCheckUtils]: 134: Hoare triple {7785#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 135: Hoare triple {7785#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 136: Hoare triple {7785#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 137: Hoare triple {7785#false} assume !(~i~0 < 10); {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 138: Hoare triple {7785#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 139: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {7785#false} {7785#false} #81#return; {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 141: Hoare triple {7785#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 142: Hoare triple {7785#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7785#false} is VALID [2018-11-23 12:16:10,435 INFO L273 TraceCheckUtils]: 143: Hoare triple {7785#false} assume !false; {7785#false} is VALID [2018-11-23 12:16:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 424 proven. 91 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-23 12:16:10,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:10,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:16:10,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2018-11-23 12:16:10,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:10,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:10,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:10,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:10,537 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 11 states. [2018-11-23 12:16:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:10,738 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2018-11-23 12:16:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:16:10,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 144 [2018-11-23 12:16:10,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 12:16:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 12:16:10,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 99 transitions. [2018-11-23 12:16:11,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:11,205 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:16:11,205 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:16:11,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 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:16:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:16:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-11-23 12:16:11,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:11,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 83 states. [2018-11-23 12:16:11,232 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 83 states. [2018-11-23 12:16:11,233 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 83 states. [2018-11-23 12:16:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:11,236 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-11-23 12:16:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-11-23 12:16:11,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:11,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:11,237 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 86 states. [2018-11-23 12:16:11,237 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 86 states. [2018-11-23 12:16:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:11,239 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-11-23 12:16:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-11-23 12:16:11,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:11,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:11,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:11,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:16:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2018-11-23 12:16:11,243 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 144 [2018-11-23 12:16:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:11,243 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2018-11-23 12:16:11,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2018-11-23 12:16:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-23 12:16:11,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:11,245 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 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:16:11,245 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:11,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash 647307887, now seen corresponding path program 14 times [2018-11-23 12:16:11,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:11,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:11,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:12,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {8700#true} call ULTIMATE.init(); {8700#true} is VALID [2018-11-23 12:16:12,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {8700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8700#true} is VALID [2018-11-23 12:16:12,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {8700#true} assume true; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8700#true} {8700#true} #73#return; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {8700#true} call #t~ret14 := main(); {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {8700#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; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L273 TraceCheckUtils]: 10: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 17: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 18: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L273 TraceCheckUtils]: 23: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {8700#true} assume !(~i~1 < 10); {8700#true} is VALID [2018-11-23 12:16:12,109 INFO L256 TraceCheckUtils]: 27: Hoare triple {8700#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {8700#true} is VALID [2018-11-23 12:16:12,111 INFO L273 TraceCheckUtils]: 28: Hoare triple {8700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8702#(= max_~i~0 0)} is VALID [2018-11-23 12:16:12,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {8702#(= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8702#(= max_~i~0 0)} is VALID [2018-11-23 12:16:12,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {8702#(= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8702#(= max_~i~0 0)} is VALID [2018-11-23 12:16:12,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {8702#(= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8702#(= max_~i~0 0)} is VALID [2018-11-23 12:16:12,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {8702#(= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {8703#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,118 INFO L273 TraceCheckUtils]: 34: Hoare triple {8703#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {8703#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,120 INFO L273 TraceCheckUtils]: 36: Hoare triple {8703#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,120 INFO L273 TraceCheckUtils]: 37: Hoare triple {8704#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,123 INFO L273 TraceCheckUtils]: 38: Hoare triple {8704#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {8704#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {8704#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {8705#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,129 INFO L273 TraceCheckUtils]: 42: Hoare triple {8705#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,129 INFO L273 TraceCheckUtils]: 43: Hoare triple {8705#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,131 INFO L273 TraceCheckUtils]: 44: Hoare triple {8705#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,131 INFO L273 TraceCheckUtils]: 45: Hoare triple {8706#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {8706#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,134 INFO L273 TraceCheckUtils]: 47: Hoare triple {8706#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {8706#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,136 INFO L273 TraceCheckUtils]: 49: Hoare triple {8707#(<= max_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {8707#(<= max_~i~0 5)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {8707#(<= max_~i~0 5)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,141 INFO L273 TraceCheckUtils]: 52: Hoare triple {8707#(<= max_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,141 INFO L273 TraceCheckUtils]: 53: Hoare triple {8708#(<= max_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,144 INFO L273 TraceCheckUtils]: 54: Hoare triple {8708#(<= max_~i~0 6)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,144 INFO L273 TraceCheckUtils]: 55: Hoare triple {8708#(<= max_~i~0 6)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {8708#(<= max_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {8709#(<= max_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,148 INFO L273 TraceCheckUtils]: 58: Hoare triple {8709#(<= max_~i~0 7)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,148 INFO L273 TraceCheckUtils]: 59: Hoare triple {8709#(<= max_~i~0 7)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,150 INFO L273 TraceCheckUtils]: 60: Hoare triple {8709#(<= max_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8710#(<= max_~i~0 8)} is VALID [2018-11-23 12:16:12,150 INFO L273 TraceCheckUtils]: 61: Hoare triple {8710#(<= max_~i~0 8)} assume !(~i~0 < 10); {8701#false} is VALID [2018-11-23 12:16:12,150 INFO L273 TraceCheckUtils]: 62: Hoare triple {8701#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8701#false} is VALID [2018-11-23 12:16:12,150 INFO L273 TraceCheckUtils]: 63: Hoare triple {8701#false} assume true; {8701#false} is VALID [2018-11-23 12:16:12,150 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {8701#false} {8700#true} #77#return; {8701#false} is VALID [2018-11-23 12:16:12,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {8701#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8701#false} is VALID [2018-11-23 12:16:12,151 INFO L256 TraceCheckUtils]: 66: Hoare triple {8701#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {8700#true} is VALID [2018-11-23 12:16:12,151 INFO L273 TraceCheckUtils]: 67: Hoare triple {8700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8700#true} is VALID [2018-11-23 12:16:12,151 INFO L273 TraceCheckUtils]: 68: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,151 INFO L273 TraceCheckUtils]: 69: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,151 INFO L273 TraceCheckUtils]: 70: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 73: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 75: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 76: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 77: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 78: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 80: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,152 INFO L273 TraceCheckUtils]: 81: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 82: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 84: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 86: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 87: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 88: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 89: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,153 INFO L273 TraceCheckUtils]: 90: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 91: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 92: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 93: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 94: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 95: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 96: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 97: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 98: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,154 INFO L273 TraceCheckUtils]: 99: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,155 INFO L273 TraceCheckUtils]: 100: Hoare triple {8700#true} assume !(~i~0 < 10); {8700#true} is VALID [2018-11-23 12:16:12,155 INFO L273 TraceCheckUtils]: 101: Hoare triple {8700#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8700#true} is VALID [2018-11-23 12:16:12,155 INFO L273 TraceCheckUtils]: 102: Hoare triple {8700#true} assume true; {8700#true} is VALID [2018-11-23 12:16:12,155 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {8700#true} {8701#false} #79#return; {8701#false} is VALID [2018-11-23 12:16:12,155 INFO L273 TraceCheckUtils]: 104: Hoare triple {8701#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {8701#false} is VALID [2018-11-23 12:16:12,155 INFO L273 TraceCheckUtils]: 105: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,155 INFO L273 TraceCheckUtils]: 106: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,155 INFO L273 TraceCheckUtils]: 107: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 108: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 109: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 110: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 111: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 112: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 113: Hoare triple {8701#false} assume !(~i~2 < 9); {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 114: Hoare triple {8701#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8701#false} is VALID [2018-11-23 12:16:12,156 INFO L256 TraceCheckUtils]: 115: Hoare triple {8701#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {8700#true} is VALID [2018-11-23 12:16:12,156 INFO L273 TraceCheckUtils]: 116: Hoare triple {8700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 117: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 118: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 119: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 120: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 121: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 122: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 123: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 124: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,157 INFO L273 TraceCheckUtils]: 125: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 126: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 127: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 128: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 129: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 130: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 131: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 132: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,158 INFO L273 TraceCheckUtils]: 133: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 134: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 135: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 136: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 137: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 138: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 139: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 140: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 141: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,159 INFO L273 TraceCheckUtils]: 142: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 143: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 144: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 145: Hoare triple {8700#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 146: Hoare triple {8700#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 147: Hoare triple {8700#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 148: Hoare triple {8700#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 149: Hoare triple {8700#true} assume !(~i~0 < 10); {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 150: Hoare triple {8700#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8700#true} is VALID [2018-11-23 12:16:12,160 INFO L273 TraceCheckUtils]: 151: Hoare triple {8700#true} assume true; {8700#true} is VALID [2018-11-23 12:16:12,161 INFO L268 TraceCheckUtils]: 152: Hoare quadruple {8700#true} {8701#false} #81#return; {8701#false} is VALID [2018-11-23 12:16:12,161 INFO L273 TraceCheckUtils]: 153: Hoare triple {8701#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {8701#false} is VALID [2018-11-23 12:16:12,161 INFO L273 TraceCheckUtils]: 154: Hoare triple {8701#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8701#false} is VALID [2018-11-23 12:16:12,161 INFO L273 TraceCheckUtils]: 155: Hoare triple {8701#false} assume !false; {8701#false} is VALID [2018-11-23 12:16:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2018-11-23 12:16:12,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:12,171 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:16:12,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:12,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:12,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:12,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:12,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {8700#true} call ULTIMATE.init(); {8700#true} is VALID [2018-11-23 12:16:12,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {8700#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8700#true} is VALID [2018-11-23 12:16:12,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {8700#true} assume true; {8700#true} is VALID [2018-11-23 12:16:12,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8700#true} {8700#true} #73#return; {8700#true} is VALID [2018-11-23 12:16:12,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {8700#true} call #t~ret14 := main(); {8700#true} is VALID [2018-11-23 12:16:12,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {8700#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; {8700#true} is VALID [2018-11-23 12:16:12,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {8700#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8700#true} is VALID [2018-11-23 12:16:12,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {8700#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8700#true} is VALID [2018-11-23 12:16:12,548 INFO L273 TraceCheckUtils]: 26: Hoare triple {8700#true} assume !(~i~1 < 10); {8700#true} is VALID [2018-11-23 12:16:12,548 INFO L256 TraceCheckUtils]: 27: Hoare triple {8700#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {8700#true} is VALID [2018-11-23 12:16:12,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {8700#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8798#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:12,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {8798#(<= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8798#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:12,575 INFO L273 TraceCheckUtils]: 30: Hoare triple {8798#(<= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8798#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:12,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {8798#(<= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8798#(<= max_~i~0 0)} is VALID [2018-11-23 12:16:12,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {8798#(<= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,576 INFO L273 TraceCheckUtils]: 33: Hoare triple {8703#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,577 INFO L273 TraceCheckUtils]: 34: Hoare triple {8703#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,577 INFO L273 TraceCheckUtils]: 35: Hoare triple {8703#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8703#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:12,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {8703#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {8704#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {8704#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {8704#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8704#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:12,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {8704#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,580 INFO L273 TraceCheckUtils]: 41: Hoare triple {8705#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {8705#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {8705#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8705#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:12,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {8705#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {8706#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {8706#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,583 INFO L273 TraceCheckUtils]: 47: Hoare triple {8706#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8706#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:12,584 INFO L273 TraceCheckUtils]: 48: Hoare triple {8706#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,584 INFO L273 TraceCheckUtils]: 49: Hoare triple {8707#(<= max_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {8707#(<= max_~i~0 5)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {8707#(<= max_~i~0 5)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8707#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:12,591 INFO L273 TraceCheckUtils]: 52: Hoare triple {8707#(<= max_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,592 INFO L273 TraceCheckUtils]: 53: Hoare triple {8708#(<= max_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,592 INFO L273 TraceCheckUtils]: 54: Hoare triple {8708#(<= max_~i~0 6)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,592 INFO L273 TraceCheckUtils]: 55: Hoare triple {8708#(<= max_~i~0 6)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8708#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:12,593 INFO L273 TraceCheckUtils]: 56: Hoare triple {8708#(<= max_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,593 INFO L273 TraceCheckUtils]: 57: Hoare triple {8709#(<= max_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,593 INFO L273 TraceCheckUtils]: 58: Hoare triple {8709#(<= max_~i~0 7)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {8709#(<= max_~i~0 7)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8709#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:12,594 INFO L273 TraceCheckUtils]: 60: Hoare triple {8709#(<= max_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8710#(<= max_~i~0 8)} is VALID [2018-11-23 12:16:12,595 INFO L273 TraceCheckUtils]: 61: Hoare triple {8710#(<= max_~i~0 8)} assume !(~i~0 < 10); {8701#false} is VALID [2018-11-23 12:16:12,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {8701#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8701#false} is VALID [2018-11-23 12:16:12,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {8701#false} assume true; {8701#false} is VALID [2018-11-23 12:16:12,595 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {8701#false} {8700#true} #77#return; {8701#false} is VALID [2018-11-23 12:16:12,595 INFO L273 TraceCheckUtils]: 65: Hoare triple {8701#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8701#false} is VALID [2018-11-23 12:16:12,596 INFO L256 TraceCheckUtils]: 66: Hoare triple {8701#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {8701#false} is VALID [2018-11-23 12:16:12,596 INFO L273 TraceCheckUtils]: 67: Hoare triple {8701#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8701#false} is VALID [2018-11-23 12:16:12,596 INFO L273 TraceCheckUtils]: 68: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,596 INFO L273 TraceCheckUtils]: 69: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,596 INFO L273 TraceCheckUtils]: 70: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,597 INFO L273 TraceCheckUtils]: 71: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,597 INFO L273 TraceCheckUtils]: 72: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,597 INFO L273 TraceCheckUtils]: 73: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,597 INFO L273 TraceCheckUtils]: 74: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,597 INFO L273 TraceCheckUtils]: 75: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 76: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 77: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 78: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 79: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 80: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 81: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 82: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,598 INFO L273 TraceCheckUtils]: 83: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 84: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 85: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 86: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 87: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 88: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 89: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 90: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,599 INFO L273 TraceCheckUtils]: 91: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 92: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 93: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 94: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 95: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 96: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 97: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 98: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 99: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,600 INFO L273 TraceCheckUtils]: 100: Hoare triple {8701#false} assume !(~i~0 < 10); {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 101: Hoare triple {8701#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 102: Hoare triple {8701#false} assume true; {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {8701#false} {8701#false} #79#return; {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 104: Hoare triple {8701#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 105: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 106: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 107: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 108: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,601 INFO L273 TraceCheckUtils]: 109: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 110: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 111: Hoare triple {8701#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 112: Hoare triple {8701#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 113: Hoare triple {8701#false} assume !(~i~2 < 9); {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 114: Hoare triple {8701#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L256 TraceCheckUtils]: 115: Hoare triple {8701#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 116: Hoare triple {8701#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 117: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,602 INFO L273 TraceCheckUtils]: 118: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 119: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 120: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 121: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 122: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 123: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 124: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 125: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 126: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,603 INFO L273 TraceCheckUtils]: 127: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 128: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 129: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 130: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 131: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 132: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 133: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 134: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 135: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,604 INFO L273 TraceCheckUtils]: 136: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,605 INFO L273 TraceCheckUtils]: 137: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,605 INFO L273 TraceCheckUtils]: 138: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,605 INFO L273 TraceCheckUtils]: 139: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,605 INFO L273 TraceCheckUtils]: 140: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,605 INFO L273 TraceCheckUtils]: 141: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,605 INFO L273 TraceCheckUtils]: 142: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,605 INFO L273 TraceCheckUtils]: 143: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,606 INFO L273 TraceCheckUtils]: 144: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,606 INFO L273 TraceCheckUtils]: 145: Hoare triple {8701#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8701#false} is VALID [2018-11-23 12:16:12,606 INFO L273 TraceCheckUtils]: 146: Hoare triple {8701#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {8701#false} is VALID [2018-11-23 12:16:12,606 INFO L273 TraceCheckUtils]: 147: Hoare triple {8701#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {8701#false} is VALID [2018-11-23 12:16:12,606 INFO L273 TraceCheckUtils]: 148: Hoare triple {8701#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8701#false} is VALID [2018-11-23 12:16:12,606 INFO L273 TraceCheckUtils]: 149: Hoare triple {8701#false} assume !(~i~0 < 10); {8701#false} is VALID [2018-11-23 12:16:12,607 INFO L273 TraceCheckUtils]: 150: Hoare triple {8701#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8701#false} is VALID [2018-11-23 12:16:12,607 INFO L273 TraceCheckUtils]: 151: Hoare triple {8701#false} assume true; {8701#false} is VALID [2018-11-23 12:16:12,607 INFO L268 TraceCheckUtils]: 152: Hoare quadruple {8701#false} {8701#false} #81#return; {8701#false} is VALID [2018-11-23 12:16:12,607 INFO L273 TraceCheckUtils]: 153: Hoare triple {8701#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {8701#false} is VALID [2018-11-23 12:16:12,607 INFO L273 TraceCheckUtils]: 154: Hoare triple {8701#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8701#false} is VALID [2018-11-23 12:16:12,607 INFO L273 TraceCheckUtils]: 155: Hoare triple {8701#false} assume !false; {8701#false} is VALID [2018-11-23 12:16:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 548 proven. 120 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-11-23 12:16:12,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:12,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:16:12,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2018-11-23 12:16:12,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:12,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:16:12,707 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:16:12,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:16:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:16:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:12,708 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 12 states. [2018-11-23 12:16:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:13,368 INFO L93 Difference]: Finished difference Result 145 states and 173 transitions. [2018-11-23 12:16:13,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:13,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2018-11-23 12:16:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2018-11-23 12:16:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2018-11-23 12:16:13,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2018-11-23 12:16:13,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:13,846 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:16:13,847 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:16:13,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:16:13,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-11-23 12:16:13,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:13,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 87 states. [2018-11-23 12:16:13,921 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 87 states. [2018-11-23 12:16:13,921 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 87 states. [2018-11-23 12:16:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:13,925 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-23 12:16:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2018-11-23 12:16:13,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:13,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:13,926 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 90 states. [2018-11-23 12:16:13,927 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 90 states. [2018-11-23 12:16:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:13,929 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-23 12:16:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2018-11-23 12:16:13,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:13,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:13,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:13,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:16:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-11-23 12:16:13,932 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 156 [2018-11-23 12:16:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:13,933 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-11-23 12:16:13,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:16:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-11-23 12:16:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:16:13,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:13,934 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 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:16:13,934 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:13,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:13,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1778461174, now seen corresponding path program 15 times [2018-11-23 12:16:13,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:13,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:13,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:13,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:13,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:14,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {9676#true} call ULTIMATE.init(); {9676#true} is VALID [2018-11-23 12:16:14,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {9676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9676#true} is VALID [2018-11-23 12:16:14,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {9676#true} assume true; {9676#true} is VALID [2018-11-23 12:16:14,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9676#true} {9676#true} #73#return; {9676#true} is VALID [2018-11-23 12:16:14,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {9676#true} call #t~ret14 := main(); {9676#true} is VALID [2018-11-23 12:16:14,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {9676#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; {9676#true} is VALID [2018-11-23 12:16:14,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 23: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {9676#true} assume !(~i~1 < 10); {9676#true} is VALID [2018-11-23 12:16:14,373 INFO L256 TraceCheckUtils]: 27: Hoare triple {9676#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {9676#true} is VALID [2018-11-23 12:16:14,373 INFO L273 TraceCheckUtils]: 28: Hoare triple {9676#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9678#(= max_~i~0 0)} is VALID [2018-11-23 12:16:14,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {9678#(= max_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9678#(= max_~i~0 0)} is VALID [2018-11-23 12:16:14,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {9678#(= max_~i~0 0)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9678#(= max_~i~0 0)} is VALID [2018-11-23 12:16:14,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {9678#(= max_~i~0 0)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9678#(= max_~i~0 0)} is VALID [2018-11-23 12:16:14,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {9678#(= max_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9679#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:14,375 INFO L273 TraceCheckUtils]: 33: Hoare triple {9679#(<= max_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9679#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:14,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {9679#(<= max_~i~0 1)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9679#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:14,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {9679#(<= max_~i~0 1)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9679#(<= max_~i~0 1)} is VALID [2018-11-23 12:16:14,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {9679#(<= max_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9680#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:14,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {9680#(<= max_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9680#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:14,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {9680#(<= max_~i~0 2)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9680#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:14,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {9680#(<= max_~i~0 2)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9680#(<= max_~i~0 2)} is VALID [2018-11-23 12:16:14,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {9680#(<= max_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9681#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:14,378 INFO L273 TraceCheckUtils]: 41: Hoare triple {9681#(<= max_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9681#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:14,378 INFO L273 TraceCheckUtils]: 42: Hoare triple {9681#(<= max_~i~0 3)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9681#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:14,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {9681#(<= max_~i~0 3)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9681#(<= max_~i~0 3)} is VALID [2018-11-23 12:16:14,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {9681#(<= max_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9682#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:14,380 INFO L273 TraceCheckUtils]: 45: Hoare triple {9682#(<= max_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9682#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:14,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {9682#(<= max_~i~0 4)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9682#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:14,381 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= max_~i~0 4)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9682#(<= max_~i~0 4)} is VALID [2018-11-23 12:16:14,382 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= max_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9683#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:14,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {9683#(<= max_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9683#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:14,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {9683#(<= max_~i~0 5)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9683#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:14,383 INFO L273 TraceCheckUtils]: 51: Hoare triple {9683#(<= max_~i~0 5)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9683#(<= max_~i~0 5)} is VALID [2018-11-23 12:16:14,384 INFO L273 TraceCheckUtils]: 52: Hoare triple {9683#(<= max_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9684#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:14,385 INFO L273 TraceCheckUtils]: 53: Hoare triple {9684#(<= max_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9684#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:14,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {9684#(<= max_~i~0 6)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9684#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:14,386 INFO L273 TraceCheckUtils]: 55: Hoare triple {9684#(<= max_~i~0 6)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9684#(<= max_~i~0 6)} is VALID [2018-11-23 12:16:14,386 INFO L273 TraceCheckUtils]: 56: Hoare triple {9684#(<= max_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9685#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:14,387 INFO L273 TraceCheckUtils]: 57: Hoare triple {9685#(<= max_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9685#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:14,387 INFO L273 TraceCheckUtils]: 58: Hoare triple {9685#(<= max_~i~0 7)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9685#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:14,388 INFO L273 TraceCheckUtils]: 59: Hoare triple {9685#(<= max_~i~0 7)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9685#(<= max_~i~0 7)} is VALID [2018-11-23 12:16:14,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {9685#(<= max_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9686#(<= max_~i~0 8)} is VALID [2018-11-23 12:16:14,389 INFO L273 TraceCheckUtils]: 61: Hoare triple {9686#(<= max_~i~0 8)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9686#(<= max_~i~0 8)} is VALID [2018-11-23 12:16:14,390 INFO L273 TraceCheckUtils]: 62: Hoare triple {9686#(<= max_~i~0 8)} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9686#(<= max_~i~0 8)} is VALID [2018-11-23 12:16:14,390 INFO L273 TraceCheckUtils]: 63: Hoare triple {9686#(<= max_~i~0 8)} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9686#(<= max_~i~0 8)} is VALID [2018-11-23 12:16:14,391 INFO L273 TraceCheckUtils]: 64: Hoare triple {9686#(<= max_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9687#(<= max_~i~0 9)} is VALID [2018-11-23 12:16:14,392 INFO L273 TraceCheckUtils]: 65: Hoare triple {9687#(<= max_~i~0 9)} assume !(~i~0 < 10); {9677#false} is VALID [2018-11-23 12:16:14,392 INFO L273 TraceCheckUtils]: 66: Hoare triple {9677#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9677#false} is VALID [2018-11-23 12:16:14,392 INFO L273 TraceCheckUtils]: 67: Hoare triple {9677#false} assume true; {9677#false} is VALID [2018-11-23 12:16:14,392 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {9677#false} {9676#true} #77#return; {9677#false} is VALID [2018-11-23 12:16:14,392 INFO L273 TraceCheckUtils]: 69: Hoare triple {9677#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9677#false} is VALID [2018-11-23 12:16:14,393 INFO L256 TraceCheckUtils]: 70: Hoare triple {9677#false} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {9676#true} is VALID [2018-11-23 12:16:14,393 INFO L273 TraceCheckUtils]: 71: Hoare triple {9676#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9676#true} is VALID [2018-11-23 12:16:14,393 INFO L273 TraceCheckUtils]: 72: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,393 INFO L273 TraceCheckUtils]: 73: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,394 INFO L273 TraceCheckUtils]: 75: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,394 INFO L273 TraceCheckUtils]: 76: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,394 INFO L273 TraceCheckUtils]: 77: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,394 INFO L273 TraceCheckUtils]: 78: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,394 INFO L273 TraceCheckUtils]: 79: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,395 INFO L273 TraceCheckUtils]: 80: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,395 INFO L273 TraceCheckUtils]: 81: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,395 INFO L273 TraceCheckUtils]: 82: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,395 INFO L273 TraceCheckUtils]: 83: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,395 INFO L273 TraceCheckUtils]: 84: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,396 INFO L273 TraceCheckUtils]: 85: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,396 INFO L273 TraceCheckUtils]: 86: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,396 INFO L273 TraceCheckUtils]: 87: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,396 INFO L273 TraceCheckUtils]: 88: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,396 INFO L273 TraceCheckUtils]: 89: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,396 INFO L273 TraceCheckUtils]: 90: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,396 INFO L273 TraceCheckUtils]: 91: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 92: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 93: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 94: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 95: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 96: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 97: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 98: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 99: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,397 INFO L273 TraceCheckUtils]: 100: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 101: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 102: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 103: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 104: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 105: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 106: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 107: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,398 INFO L273 TraceCheckUtils]: 108: Hoare triple {9676#true} assume !(~i~0 < 10); {9676#true} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 109: Hoare triple {9676#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9676#true} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 110: Hoare triple {9676#true} assume true; {9676#true} is VALID [2018-11-23 12:16:14,399 INFO L268 TraceCheckUtils]: 111: Hoare quadruple {9676#true} {9677#false} #79#return; {9677#false} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 112: Hoare triple {9677#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {9677#false} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 113: Hoare triple {9677#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9677#false} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 114: Hoare triple {9677#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9677#false} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 115: Hoare triple {9677#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9677#false} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 116: Hoare triple {9677#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9677#false} is VALID [2018-11-23 12:16:14,399 INFO L273 TraceCheckUtils]: 117: Hoare triple {9677#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9677#false} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 118: Hoare triple {9677#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9677#false} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 119: Hoare triple {9677#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9677#false} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 120: Hoare triple {9677#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9677#false} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 121: Hoare triple {9677#false} assume !(~i~2 < 9); {9677#false} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 122: Hoare triple {9677#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9677#false} is VALID [2018-11-23 12:16:14,400 INFO L256 TraceCheckUtils]: 123: Hoare triple {9677#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {9676#true} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 124: Hoare triple {9676#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9676#true} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 125: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,400 INFO L273 TraceCheckUtils]: 126: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 127: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 128: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 129: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 130: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 131: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 132: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 133: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 134: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,401 INFO L273 TraceCheckUtils]: 135: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 136: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 137: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 138: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 139: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 140: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 141: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 142: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,402 INFO L273 TraceCheckUtils]: 143: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 144: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 145: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 146: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 147: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 148: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 149: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 150: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 151: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,403 INFO L273 TraceCheckUtils]: 152: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 153: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 154: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 155: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 156: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 157: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 158: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 159: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 160: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,404 INFO L273 TraceCheckUtils]: 161: Hoare triple {9676#true} assume !(~i~0 < 10); {9676#true} is VALID [2018-11-23 12:16:14,405 INFO L273 TraceCheckUtils]: 162: Hoare triple {9676#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9676#true} is VALID [2018-11-23 12:16:14,405 INFO L273 TraceCheckUtils]: 163: Hoare triple {9676#true} assume true; {9676#true} is VALID [2018-11-23 12:16:14,405 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {9676#true} {9677#false} #81#return; {9677#false} is VALID [2018-11-23 12:16:14,405 INFO L273 TraceCheckUtils]: 165: Hoare triple {9677#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9677#false} is VALID [2018-11-23 12:16:14,405 INFO L273 TraceCheckUtils]: 166: Hoare triple {9677#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9677#false} is VALID [2018-11-23 12:16:14,405 INFO L273 TraceCheckUtils]: 167: Hoare triple {9677#false} assume !false; {9677#false} is VALID [2018-11-23 12:16:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 845 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-11-23 12:16:14,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:14,417 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:16:14,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:14,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:16:14,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:14,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:14,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {9676#true} call ULTIMATE.init(); {9676#true} is VALID [2018-11-23 12:16:14,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {9676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9676#true} is VALID [2018-11-23 12:16:14,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {9676#true} assume true; {9676#true} is VALID [2018-11-23 12:16:14,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9676#true} {9676#true} #73#return; {9676#true} is VALID [2018-11-23 12:16:14,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {9676#true} call #t~ret14 := main(); {9676#true} is VALID [2018-11-23 12:16:14,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {9676#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; {9676#true} is VALID [2018-11-23 12:16:14,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 21: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 22: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {9676#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {9676#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {9676#true} assume !(~i~1 < 10); {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L256 TraceCheckUtils]: 27: Hoare triple {9676#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {9676#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L273 TraceCheckUtils]: 30: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L273 TraceCheckUtils]: 31: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 33: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 34: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 35: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 36: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 37: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,739 INFO L273 TraceCheckUtils]: 41: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 46: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 49: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,740 INFO L273 TraceCheckUtils]: 50: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 51: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 52: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 53: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 54: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 55: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,741 INFO L273 TraceCheckUtils]: 58: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 59: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 60: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 63: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 64: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {9676#true} assume !(~i~0 < 10); {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 66: Hoare triple {9676#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9676#true} is VALID [2018-11-23 12:16:14,742 INFO L273 TraceCheckUtils]: 67: Hoare triple {9676#true} assume true; {9676#true} is VALID [2018-11-23 12:16:14,743 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {9676#true} {9676#true} #77#return; {9676#true} is VALID [2018-11-23 12:16:14,743 INFO L273 TraceCheckUtils]: 69: Hoare triple {9676#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9676#true} is VALID [2018-11-23 12:16:14,743 INFO L256 TraceCheckUtils]: 70: Hoare triple {9676#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {9676#true} is VALID [2018-11-23 12:16:14,743 INFO L273 TraceCheckUtils]: 71: Hoare triple {9676#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9676#true} is VALID [2018-11-23 12:16:14,743 INFO L273 TraceCheckUtils]: 72: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,743 INFO L273 TraceCheckUtils]: 73: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,744 INFO L273 TraceCheckUtils]: 75: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,744 INFO L273 TraceCheckUtils]: 76: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,744 INFO L273 TraceCheckUtils]: 77: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,744 INFO L273 TraceCheckUtils]: 78: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,744 INFO L273 TraceCheckUtils]: 79: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,745 INFO L273 TraceCheckUtils]: 80: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,745 INFO L273 TraceCheckUtils]: 82: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,745 INFO L273 TraceCheckUtils]: 84: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,746 INFO L273 TraceCheckUtils]: 85: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,746 INFO L273 TraceCheckUtils]: 86: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,746 INFO L273 TraceCheckUtils]: 90: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,747 INFO L273 TraceCheckUtils]: 91: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,747 INFO L273 TraceCheckUtils]: 92: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,747 INFO L273 TraceCheckUtils]: 93: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,747 INFO L273 TraceCheckUtils]: 94: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,747 INFO L273 TraceCheckUtils]: 95: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,747 INFO L273 TraceCheckUtils]: 96: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,748 INFO L273 TraceCheckUtils]: 97: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,748 INFO L273 TraceCheckUtils]: 98: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,748 INFO L273 TraceCheckUtils]: 99: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,748 INFO L273 TraceCheckUtils]: 100: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,748 INFO L273 TraceCheckUtils]: 101: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,748 INFO L273 TraceCheckUtils]: 102: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,749 INFO L273 TraceCheckUtils]: 103: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,749 INFO L273 TraceCheckUtils]: 104: Hoare triple {9676#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9676#true} is VALID [2018-11-23 12:16:14,749 INFO L273 TraceCheckUtils]: 105: Hoare triple {9676#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9676#true} is VALID [2018-11-23 12:16:14,749 INFO L273 TraceCheckUtils]: 106: Hoare triple {9676#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9676#true} is VALID [2018-11-23 12:16:14,749 INFO L273 TraceCheckUtils]: 107: Hoare triple {9676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9676#true} is VALID [2018-11-23 12:16:14,749 INFO L273 TraceCheckUtils]: 108: Hoare triple {9676#true} assume !(~i~0 < 10); {9676#true} is VALID [2018-11-23 12:16:14,750 INFO L273 TraceCheckUtils]: 109: Hoare triple {9676#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9676#true} is VALID [2018-11-23 12:16:14,750 INFO L273 TraceCheckUtils]: 110: Hoare triple {9676#true} assume true; {9676#true} is VALID [2018-11-23 12:16:14,750 INFO L268 TraceCheckUtils]: 111: Hoare quadruple {9676#true} {9676#true} #79#return; {9676#true} is VALID [2018-11-23 12:16:14,764 INFO L273 TraceCheckUtils]: 112: Hoare triple {9676#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {10027#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:14,772 INFO L273 TraceCheckUtils]: 113: Hoare triple {10027#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10027#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:14,774 INFO L273 TraceCheckUtils]: 114: Hoare triple {10027#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10034#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:14,775 INFO L273 TraceCheckUtils]: 115: Hoare triple {10034#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10034#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:14,776 INFO L273 TraceCheckUtils]: 116: Hoare triple {10034#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10041#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:14,776 INFO L273 TraceCheckUtils]: 117: Hoare triple {10041#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10041#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:14,776 INFO L273 TraceCheckUtils]: 118: Hoare triple {10041#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10048#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:14,778 INFO L273 TraceCheckUtils]: 119: Hoare triple {10048#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10048#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:14,778 INFO L273 TraceCheckUtils]: 120: Hoare triple {10048#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10055#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:14,778 INFO L273 TraceCheckUtils]: 121: Hoare triple {10055#(<= main_~i~2 4)} assume !(~i~2 < 9); {9677#false} is VALID [2018-11-23 12:16:14,779 INFO L273 TraceCheckUtils]: 122: Hoare triple {9677#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9677#false} is VALID [2018-11-23 12:16:14,779 INFO L256 TraceCheckUtils]: 123: Hoare triple {9677#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {9677#false} is VALID [2018-11-23 12:16:14,779 INFO L273 TraceCheckUtils]: 124: Hoare triple {9677#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {9677#false} is VALID [2018-11-23 12:16:14,779 INFO L273 TraceCheckUtils]: 125: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,779 INFO L273 TraceCheckUtils]: 126: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,780 INFO L273 TraceCheckUtils]: 127: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,780 INFO L273 TraceCheckUtils]: 128: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,780 INFO L273 TraceCheckUtils]: 129: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,780 INFO L273 TraceCheckUtils]: 130: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,780 INFO L273 TraceCheckUtils]: 131: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 132: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 133: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 134: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 135: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 136: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 137: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 138: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,781 INFO L273 TraceCheckUtils]: 139: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 140: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 141: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 142: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 143: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 144: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 145: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 146: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 147: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,782 INFO L273 TraceCheckUtils]: 148: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 149: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 150: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 151: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 152: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 153: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 154: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 155: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 156: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,783 INFO L273 TraceCheckUtils]: 157: Hoare triple {9677#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L273 TraceCheckUtils]: 158: Hoare triple {9677#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L273 TraceCheckUtils]: 159: Hoare triple {9677#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L273 TraceCheckUtils]: 160: Hoare triple {9677#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L273 TraceCheckUtils]: 161: Hoare triple {9677#false} assume !(~i~0 < 10); {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L273 TraceCheckUtils]: 162: Hoare triple {9677#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L273 TraceCheckUtils]: 163: Hoare triple {9677#false} assume true; {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {9677#false} {9677#false} #81#return; {9677#false} is VALID [2018-11-23 12:16:14,784 INFO L273 TraceCheckUtils]: 165: Hoare triple {9677#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9677#false} is VALID [2018-11-23 12:16:14,785 INFO L273 TraceCheckUtils]: 166: Hoare triple {9677#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9677#false} is VALID [2018-11-23 12:16:14,785 INFO L273 TraceCheckUtils]: 167: Hoare triple {9677#false} assume !false; {9677#false} is VALID [2018-11-23 12:16:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 694 proven. 16 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2018-11-23 12:16:14,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:14,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 12:16:14,815 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2018-11-23 12:16:14,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:14,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:16:14,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:14,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:16:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:16:14,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:16:14,964 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 17 states. [2018-11-23 12:16:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:15,425 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2018-11-23 12:16:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:16:15,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 168 [2018-11-23 12:16:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:16:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 116 transitions. [2018-11-23 12:16:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:16:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 116 transitions. [2018-11-23 12:16:15,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 116 transitions. [2018-11-23 12:16:15,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:15,579 INFO L225 Difference]: With dead ends: 153 [2018-11-23 12:16:15,579 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 12:16:15,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 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:16:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 12:16:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-23 12:16:15,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:15,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 93 states. [2018-11-23 12:16:15,605 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 93 states. [2018-11-23 12:16:15,605 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 93 states. [2018-11-23 12:16:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:15,607 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2018-11-23 12:16:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-11-23 12:16:15,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:15,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:15,608 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 94 states. [2018-11-23 12:16:15,608 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 94 states. [2018-11-23 12:16:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:15,610 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2018-11-23 12:16:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2018-11-23 12:16:15,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:15,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:15,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:15,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:16:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2018-11-23 12:16:15,613 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 168 [2018-11-23 12:16:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:15,613 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2018-11-23 12:16:15,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:16:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2018-11-23 12:16:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-23 12:16:15,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:15,615 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 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:16:15,615 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:15,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:15,616 INFO L82 PathProgramCache]: Analyzing trace with hash 734167171, now seen corresponding path program 16 times [2018-11-23 12:16:15,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:15,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:15,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:15,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:15,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {10720#true} call ULTIMATE.init(); {10720#true} is VALID [2018-11-23 12:16:15,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {10720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10720#true} is VALID [2018-11-23 12:16:15,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {10720#true} assume true; {10720#true} is VALID [2018-11-23 12:16:15,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10720#true} {10720#true} #73#return; {10720#true} is VALID [2018-11-23 12:16:15,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {10720#true} call #t~ret14 := main(); {10720#true} is VALID [2018-11-23 12:16:15,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {10720#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; {10720#true} is VALID [2018-11-23 12:16:15,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,874 INFO L273 TraceCheckUtils]: 13: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,874 INFO L273 TraceCheckUtils]: 14: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 20: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {10720#true} assume !(~i~1 < 10); {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L256 TraceCheckUtils]: 27: Hoare triple {10720#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {10720#true} is VALID [2018-11-23 12:16:15,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {10720#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 29: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 39: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 43: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 47: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 48: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 49: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 52: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,878 INFO L273 TraceCheckUtils]: 54: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 60: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 61: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 62: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 64: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 65: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 66: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 69: Hoare triple {10720#true} assume !(~i~0 < 10); {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {10720#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {10720#true} assume true; {10720#true} is VALID [2018-11-23 12:16:15,880 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {10720#true} {10720#true} #77#return; {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 73: Hoare triple {10720#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L256 TraceCheckUtils]: 74: Hoare triple {10720#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 75: Hoare triple {10720#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 77: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 78: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 79: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,881 INFO L273 TraceCheckUtils]: 81: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 83: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 84: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 85: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 86: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 87: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 88: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,882 INFO L273 TraceCheckUtils]: 89: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 90: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 91: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 92: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 93: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 94: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 95: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 96: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 97: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,883 INFO L273 TraceCheckUtils]: 98: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,884 INFO L273 TraceCheckUtils]: 99: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,884 INFO L273 TraceCheckUtils]: 100: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,884 INFO L273 TraceCheckUtils]: 101: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,884 INFO L273 TraceCheckUtils]: 102: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,884 INFO L273 TraceCheckUtils]: 103: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,884 INFO L273 TraceCheckUtils]: 104: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,885 INFO L273 TraceCheckUtils]: 106: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,885 INFO L273 TraceCheckUtils]: 107: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,885 INFO L273 TraceCheckUtils]: 108: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,885 INFO L273 TraceCheckUtils]: 109: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,885 INFO L273 TraceCheckUtils]: 110: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,885 INFO L273 TraceCheckUtils]: 111: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,886 INFO L273 TraceCheckUtils]: 112: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:15,886 INFO L273 TraceCheckUtils]: 113: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:15,886 INFO L273 TraceCheckUtils]: 114: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:15,886 INFO L273 TraceCheckUtils]: 115: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:15,886 INFO L273 TraceCheckUtils]: 116: Hoare triple {10720#true} assume !(~i~0 < 10); {10720#true} is VALID [2018-11-23 12:16:15,886 INFO L273 TraceCheckUtils]: 117: Hoare triple {10720#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10720#true} is VALID [2018-11-23 12:16:15,887 INFO L273 TraceCheckUtils]: 118: Hoare triple {10720#true} assume true; {10720#true} is VALID [2018-11-23 12:16:15,887 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {10720#true} {10720#true} #79#return; {10720#true} is VALID [2018-11-23 12:16:15,901 INFO L273 TraceCheckUtils]: 120: Hoare triple {10720#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {10722#(= main_~i~2 0)} is VALID [2018-11-23 12:16:15,910 INFO L273 TraceCheckUtils]: 121: Hoare triple {10722#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10722#(= main_~i~2 0)} is VALID [2018-11-23 12:16:15,923 INFO L273 TraceCheckUtils]: 122: Hoare triple {10722#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10723#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:15,932 INFO L273 TraceCheckUtils]: 123: Hoare triple {10723#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10723#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:15,946 INFO L273 TraceCheckUtils]: 124: Hoare triple {10723#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10724#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:15,955 INFO L273 TraceCheckUtils]: 125: Hoare triple {10724#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10724#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:15,969 INFO L273 TraceCheckUtils]: 126: Hoare triple {10724#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10725#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:15,978 INFO L273 TraceCheckUtils]: 127: Hoare triple {10725#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10725#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:15,991 INFO L273 TraceCheckUtils]: 128: Hoare triple {10725#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10726#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:16,000 INFO L273 TraceCheckUtils]: 129: Hoare triple {10726#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10726#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:16,015 INFO L273 TraceCheckUtils]: 130: Hoare triple {10726#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10727#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:16,024 INFO L273 TraceCheckUtils]: 131: Hoare triple {10727#(<= main_~i~2 5)} assume !(~i~2 < 9); {10721#false} is VALID [2018-11-23 12:16:16,024 INFO L273 TraceCheckUtils]: 132: Hoare triple {10721#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {10721#false} is VALID [2018-11-23 12:16:16,024 INFO L256 TraceCheckUtils]: 133: Hoare triple {10721#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {10720#true} is VALID [2018-11-23 12:16:16,024 INFO L273 TraceCheckUtils]: 134: Hoare triple {10720#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10720#true} is VALID [2018-11-23 12:16:16,025 INFO L273 TraceCheckUtils]: 135: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,025 INFO L273 TraceCheckUtils]: 136: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,025 INFO L273 TraceCheckUtils]: 137: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,025 INFO L273 TraceCheckUtils]: 138: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,025 INFO L273 TraceCheckUtils]: 139: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,025 INFO L273 TraceCheckUtils]: 140: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,026 INFO L273 TraceCheckUtils]: 141: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,026 INFO L273 TraceCheckUtils]: 142: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,026 INFO L273 TraceCheckUtils]: 143: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,026 INFO L273 TraceCheckUtils]: 144: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,026 INFO L273 TraceCheckUtils]: 145: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,026 INFO L273 TraceCheckUtils]: 146: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,026 INFO L273 TraceCheckUtils]: 147: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,027 INFO L273 TraceCheckUtils]: 148: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,027 INFO L273 TraceCheckUtils]: 149: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,027 INFO L273 TraceCheckUtils]: 150: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,027 INFO L273 TraceCheckUtils]: 151: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,027 INFO L273 TraceCheckUtils]: 152: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,027 INFO L273 TraceCheckUtils]: 153: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,028 INFO L273 TraceCheckUtils]: 154: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,028 INFO L273 TraceCheckUtils]: 155: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,028 INFO L273 TraceCheckUtils]: 156: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,028 INFO L273 TraceCheckUtils]: 157: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,028 INFO L273 TraceCheckUtils]: 158: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,028 INFO L273 TraceCheckUtils]: 159: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,029 INFO L273 TraceCheckUtils]: 160: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,029 INFO L273 TraceCheckUtils]: 161: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,029 INFO L273 TraceCheckUtils]: 162: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,029 INFO L273 TraceCheckUtils]: 163: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,029 INFO L273 TraceCheckUtils]: 164: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,029 INFO L273 TraceCheckUtils]: 165: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,030 INFO L273 TraceCheckUtils]: 166: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,030 INFO L273 TraceCheckUtils]: 167: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,030 INFO L273 TraceCheckUtils]: 168: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,030 INFO L273 TraceCheckUtils]: 169: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,030 INFO L273 TraceCheckUtils]: 170: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,030 INFO L273 TraceCheckUtils]: 171: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,031 INFO L273 TraceCheckUtils]: 172: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,031 INFO L273 TraceCheckUtils]: 173: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,031 INFO L273 TraceCheckUtils]: 174: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,031 INFO L273 TraceCheckUtils]: 175: Hoare triple {10720#true} assume !(~i~0 < 10); {10720#true} is VALID [2018-11-23 12:16:16,031 INFO L273 TraceCheckUtils]: 176: Hoare triple {10720#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10720#true} is VALID [2018-11-23 12:16:16,031 INFO L273 TraceCheckUtils]: 177: Hoare triple {10720#true} assume true; {10720#true} is VALID [2018-11-23 12:16:16,031 INFO L268 TraceCheckUtils]: 178: Hoare quadruple {10720#true} {10721#false} #81#return; {10721#false} is VALID [2018-11-23 12:16:16,032 INFO L273 TraceCheckUtils]: 179: Hoare triple {10721#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {10721#false} is VALID [2018-11-23 12:16:16,032 INFO L273 TraceCheckUtils]: 180: Hoare triple {10721#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10721#false} is VALID [2018-11-23 12:16:16,032 INFO L273 TraceCheckUtils]: 181: Hoare triple {10721#false} assume !false; {10721#false} is VALID [2018-11-23 12:16:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2018-11-23 12:16:16,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:16,050 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:16:16,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:16,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:16,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:16,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:16,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {10720#true} call ULTIMATE.init(); {10720#true} is VALID [2018-11-23 12:16:16,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {10720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10720#true} is VALID [2018-11-23 12:16:16,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {10720#true} assume true; {10720#true} is VALID [2018-11-23 12:16:16,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10720#true} {10720#true} #73#return; {10720#true} is VALID [2018-11-23 12:16:16,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {10720#true} call #t~ret14 := main(); {10720#true} is VALID [2018-11-23 12:16:16,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {10720#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; {10720#true} is VALID [2018-11-23 12:16:16,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {10720#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {10720#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {10720#true} assume !(~i~1 < 10); {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L256 TraceCheckUtils]: 27: Hoare triple {10720#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {10720#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10720#true} is VALID [2018-11-23 12:16:16,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 37: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 42: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 43: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 44: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 45: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 48: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 49: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 50: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 51: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 53: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 54: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 55: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,409 INFO L273 TraceCheckUtils]: 56: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 57: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 58: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 59: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 60: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 61: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 62: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 63: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 64: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,410 INFO L273 TraceCheckUtils]: 65: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L273 TraceCheckUtils]: 66: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L273 TraceCheckUtils]: 67: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L273 TraceCheckUtils]: 68: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L273 TraceCheckUtils]: 69: Hoare triple {10720#true} assume !(~i~0 < 10); {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L273 TraceCheckUtils]: 70: Hoare triple {10720#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L273 TraceCheckUtils]: 71: Hoare triple {10720#true} assume true; {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {10720#true} {10720#true} #77#return; {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L273 TraceCheckUtils]: 73: Hoare triple {10720#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10720#true} is VALID [2018-11-23 12:16:16,411 INFO L256 TraceCheckUtils]: 74: Hoare triple {10720#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 75: Hoare triple {10720#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 76: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 77: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 78: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 79: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 80: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 81: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 82: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,412 INFO L273 TraceCheckUtils]: 83: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 84: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 85: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 86: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 87: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 88: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 89: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 90: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 91: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,413 INFO L273 TraceCheckUtils]: 92: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 93: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 94: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 95: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 96: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 97: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 98: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 99: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 100: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,414 INFO L273 TraceCheckUtils]: 101: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 102: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 103: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 104: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 105: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 106: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 107: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 108: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 109: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,415 INFO L273 TraceCheckUtils]: 110: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 111: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 112: Hoare triple {10720#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 113: Hoare triple {10720#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 114: Hoare triple {10720#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 115: Hoare triple {10720#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 116: Hoare triple {10720#true} assume !(~i~0 < 10); {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 117: Hoare triple {10720#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L273 TraceCheckUtils]: 118: Hoare triple {10720#true} assume true; {10720#true} is VALID [2018-11-23 12:16:16,416 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {10720#true} {10720#true} #79#return; {10720#true} is VALID [2018-11-23 12:16:16,417 INFO L273 TraceCheckUtils]: 120: Hoare triple {10720#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {11091#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:16,418 INFO L273 TraceCheckUtils]: 121: Hoare triple {11091#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11091#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:16,418 INFO L273 TraceCheckUtils]: 122: Hoare triple {11091#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10723#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:16,420 INFO L273 TraceCheckUtils]: 123: Hoare triple {10723#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10723#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:16,420 INFO L273 TraceCheckUtils]: 124: Hoare triple {10723#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10724#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:16,420 INFO L273 TraceCheckUtils]: 125: Hoare triple {10724#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10724#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:16,421 INFO L273 TraceCheckUtils]: 126: Hoare triple {10724#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10725#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:16,422 INFO L273 TraceCheckUtils]: 127: Hoare triple {10725#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10725#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:16,422 INFO L273 TraceCheckUtils]: 128: Hoare triple {10725#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10726#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:16,424 INFO L273 TraceCheckUtils]: 129: Hoare triple {10726#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10726#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:16,424 INFO L273 TraceCheckUtils]: 130: Hoare triple {10726#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10727#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:16,425 INFO L273 TraceCheckUtils]: 131: Hoare triple {10727#(<= main_~i~2 5)} assume !(~i~2 < 9); {10721#false} is VALID [2018-11-23 12:16:16,425 INFO L273 TraceCheckUtils]: 132: Hoare triple {10721#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {10721#false} is VALID [2018-11-23 12:16:16,425 INFO L256 TraceCheckUtils]: 133: Hoare triple {10721#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {10721#false} is VALID [2018-11-23 12:16:16,425 INFO L273 TraceCheckUtils]: 134: Hoare triple {10721#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 135: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 136: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 137: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 138: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 139: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 140: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 141: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 142: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,426 INFO L273 TraceCheckUtils]: 143: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,427 INFO L273 TraceCheckUtils]: 144: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,427 INFO L273 TraceCheckUtils]: 145: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,427 INFO L273 TraceCheckUtils]: 146: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,427 INFO L273 TraceCheckUtils]: 147: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,427 INFO L273 TraceCheckUtils]: 148: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,427 INFO L273 TraceCheckUtils]: 149: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,427 INFO L273 TraceCheckUtils]: 150: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,428 INFO L273 TraceCheckUtils]: 151: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,428 INFO L273 TraceCheckUtils]: 152: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,428 INFO L273 TraceCheckUtils]: 153: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,428 INFO L273 TraceCheckUtils]: 154: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,428 INFO L273 TraceCheckUtils]: 155: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 156: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 157: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 158: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 159: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 160: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 161: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 162: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,429 INFO L273 TraceCheckUtils]: 163: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 164: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 165: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 166: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 167: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 168: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 169: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 170: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 171: Hoare triple {10721#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10721#false} is VALID [2018-11-23 12:16:16,430 INFO L273 TraceCheckUtils]: 172: Hoare triple {10721#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 173: Hoare triple {10721#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 174: Hoare triple {10721#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 175: Hoare triple {10721#false} assume !(~i~0 < 10); {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 176: Hoare triple {10721#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 177: Hoare triple {10721#false} assume true; {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L268 TraceCheckUtils]: 178: Hoare quadruple {10721#false} {10721#false} #81#return; {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 179: Hoare triple {10721#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 180: Hoare triple {10721#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10721#false} is VALID [2018-11-23 12:16:16,431 INFO L273 TraceCheckUtils]: 181: Hoare triple {10721#false} assume !false; {10721#false} is VALID [2018-11-23 12:16:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 850 proven. 25 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2018-11-23 12:16:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:16,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:16:16,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2018-11-23 12:16:16,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:16,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:16:16,520 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:16:16,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:16:16,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:16:16,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:16,521 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 9 states. [2018-11-23 12:16:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:16,741 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2018-11-23 12:16:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:16,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 182 [2018-11-23 12:16:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-23 12:16:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-23 12:16:16,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2018-11-23 12:16:16,840 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:16:16,842 INFO L225 Difference]: With dead ends: 147 [2018-11-23 12:16:16,842 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:16:16,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:16:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:16:16,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:16,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:16:16,872 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:16:16,872 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:16:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:16,874 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-23 12:16:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2018-11-23 12:16:16,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:16,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:16,875 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:16:16,875 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:16:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:16,877 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-23 12:16:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2018-11-23 12:16:16,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:16,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:16,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:16,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:16:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2018-11-23 12:16:16,880 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 182 [2018-11-23 12:16:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:16,880 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2018-11-23 12:16:16,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:16:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-23 12:16:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:16:16,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:16,882 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 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:16:16,882 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:16,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1063475103, now seen corresponding path program 17 times [2018-11-23 12:16:16,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:16,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:16,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:16,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:17,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {11795#true} call ULTIMATE.init(); {11795#true} is VALID [2018-11-23 12:16:17,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {11795#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11795#true} is VALID [2018-11-23 12:16:17,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {11795#true} assume true; {11795#true} is VALID [2018-11-23 12:16:17,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11795#true} {11795#true} #73#return; {11795#true} is VALID [2018-11-23 12:16:17,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {11795#true} call #t~ret14 := main(); {11795#true} is VALID [2018-11-23 12:16:17,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {11795#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; {11795#true} is VALID [2018-11-23 12:16:17,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,145 INFO L273 TraceCheckUtils]: 20: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,145 INFO L273 TraceCheckUtils]: 21: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 26: Hoare triple {11795#true} assume !(~i~1 < 10); {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L256 TraceCheckUtils]: 27: Hoare triple {11795#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {11795#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 31: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 38: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 40: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,147 INFO L273 TraceCheckUtils]: 41: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 45: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 47: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 48: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 49: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,148 INFO L273 TraceCheckUtils]: 50: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 51: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 52: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 53: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 54: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 55: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 56: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 57: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 58: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 59: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,149 INFO L273 TraceCheckUtils]: 60: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 61: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 62: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 63: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 64: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 65: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 66: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 67: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 69: Hoare triple {11795#true} assume !(~i~0 < 10); {11795#true} is VALID [2018-11-23 12:16:17,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {11795#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11795#true} is VALID [2018-11-23 12:16:17,151 INFO L273 TraceCheckUtils]: 71: Hoare triple {11795#true} assume true; {11795#true} is VALID [2018-11-23 12:16:17,151 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {11795#true} {11795#true} #77#return; {11795#true} is VALID [2018-11-23 12:16:17,151 INFO L273 TraceCheckUtils]: 73: Hoare triple {11795#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11795#true} is VALID [2018-11-23 12:16:17,151 INFO L256 TraceCheckUtils]: 74: Hoare triple {11795#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {11795#true} is VALID [2018-11-23 12:16:17,151 INFO L273 TraceCheckUtils]: 75: Hoare triple {11795#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11795#true} is VALID [2018-11-23 12:16:17,151 INFO L273 TraceCheckUtils]: 76: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,152 INFO L273 TraceCheckUtils]: 77: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,152 INFO L273 TraceCheckUtils]: 78: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,152 INFO L273 TraceCheckUtils]: 79: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,152 INFO L273 TraceCheckUtils]: 80: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,152 INFO L273 TraceCheckUtils]: 81: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,152 INFO L273 TraceCheckUtils]: 82: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,152 INFO L273 TraceCheckUtils]: 83: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,153 INFO L273 TraceCheckUtils]: 84: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,153 INFO L273 TraceCheckUtils]: 86: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,153 INFO L273 TraceCheckUtils]: 87: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,153 INFO L273 TraceCheckUtils]: 88: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,153 INFO L273 TraceCheckUtils]: 89: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,153 INFO L273 TraceCheckUtils]: 90: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 91: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 92: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 93: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 94: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 95: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 96: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 97: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,154 INFO L273 TraceCheckUtils]: 98: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 99: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 100: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 101: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 102: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 103: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 104: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 105: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 106: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 107: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,155 INFO L273 TraceCheckUtils]: 108: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 109: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 110: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 111: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 112: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 113: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 114: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 115: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 116: Hoare triple {11795#true} assume !(~i~0 < 10); {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 117: Hoare triple {11795#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11795#true} is VALID [2018-11-23 12:16:17,156 INFO L273 TraceCheckUtils]: 118: Hoare triple {11795#true} assume true; {11795#true} is VALID [2018-11-23 12:16:17,157 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {11795#true} {11795#true} #79#return; {11795#true} is VALID [2018-11-23 12:16:17,157 INFO L273 TraceCheckUtils]: 120: Hoare triple {11795#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {11797#(= main_~i~2 0)} is VALID [2018-11-23 12:16:17,157 INFO L273 TraceCheckUtils]: 121: Hoare triple {11797#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11797#(= main_~i~2 0)} is VALID [2018-11-23 12:16:17,158 INFO L273 TraceCheckUtils]: 122: Hoare triple {11797#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11798#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:17,158 INFO L273 TraceCheckUtils]: 123: Hoare triple {11798#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11798#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:17,158 INFO L273 TraceCheckUtils]: 124: Hoare triple {11798#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11799#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:17,159 INFO L273 TraceCheckUtils]: 125: Hoare triple {11799#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11799#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:17,159 INFO L273 TraceCheckUtils]: 126: Hoare triple {11799#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11800#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:17,160 INFO L273 TraceCheckUtils]: 127: Hoare triple {11800#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11800#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:17,160 INFO L273 TraceCheckUtils]: 128: Hoare triple {11800#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11801#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:17,160 INFO L273 TraceCheckUtils]: 129: Hoare triple {11801#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11801#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:17,161 INFO L273 TraceCheckUtils]: 130: Hoare triple {11801#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11802#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:17,161 INFO L273 TraceCheckUtils]: 131: Hoare triple {11802#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11802#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:17,162 INFO L273 TraceCheckUtils]: 132: Hoare triple {11802#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11803#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:17,163 INFO L273 TraceCheckUtils]: 133: Hoare triple {11803#(<= main_~i~2 6)} assume !(~i~2 < 9); {11796#false} is VALID [2018-11-23 12:16:17,163 INFO L273 TraceCheckUtils]: 134: Hoare triple {11796#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {11796#false} is VALID [2018-11-23 12:16:17,163 INFO L256 TraceCheckUtils]: 135: Hoare triple {11796#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {11795#true} is VALID [2018-11-23 12:16:17,163 INFO L273 TraceCheckUtils]: 136: Hoare triple {11795#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11795#true} is VALID [2018-11-23 12:16:17,163 INFO L273 TraceCheckUtils]: 137: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,164 INFO L273 TraceCheckUtils]: 138: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,164 INFO L273 TraceCheckUtils]: 139: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,164 INFO L273 TraceCheckUtils]: 140: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,164 INFO L273 TraceCheckUtils]: 141: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,164 INFO L273 TraceCheckUtils]: 142: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,165 INFO L273 TraceCheckUtils]: 143: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,165 INFO L273 TraceCheckUtils]: 144: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,165 INFO L273 TraceCheckUtils]: 145: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,165 INFO L273 TraceCheckUtils]: 146: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,165 INFO L273 TraceCheckUtils]: 147: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,165 INFO L273 TraceCheckUtils]: 148: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,165 INFO L273 TraceCheckUtils]: 149: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 150: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 151: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 152: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 153: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 154: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 155: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 156: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 157: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,166 INFO L273 TraceCheckUtils]: 158: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 159: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 160: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 161: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 162: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 163: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 164: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 165: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 166: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,167 INFO L273 TraceCheckUtils]: 167: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 168: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 169: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 170: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 171: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 172: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 173: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 174: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 175: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:17,168 INFO L273 TraceCheckUtils]: 176: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:17,169 INFO L273 TraceCheckUtils]: 177: Hoare triple {11795#true} assume !(~i~0 < 10); {11795#true} is VALID [2018-11-23 12:16:17,169 INFO L273 TraceCheckUtils]: 178: Hoare triple {11795#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11795#true} is VALID [2018-11-23 12:16:17,169 INFO L273 TraceCheckUtils]: 179: Hoare triple {11795#true} assume true; {11795#true} is VALID [2018-11-23 12:16:17,169 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {11795#true} {11796#false} #81#return; {11796#false} is VALID [2018-11-23 12:16:17,169 INFO L273 TraceCheckUtils]: 181: Hoare triple {11796#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11796#false} is VALID [2018-11-23 12:16:17,169 INFO L273 TraceCheckUtils]: 182: Hoare triple {11796#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11796#false} is VALID [2018-11-23 12:16:17,169 INFO L273 TraceCheckUtils]: 183: Hoare triple {11796#false} assume !false; {11796#false} is VALID [2018-11-23 12:16:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2018-11-23 12:16:17,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:17,182 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:16:17,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:16:18,005 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-11-23 12:16:18,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:18,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:19,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {11795#true} call ULTIMATE.init(); {11795#true} is VALID [2018-11-23 12:16:19,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {11795#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11795#true} is VALID [2018-11-23 12:16:19,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {11795#true} assume true; {11795#true} is VALID [2018-11-23 12:16:19,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11795#true} {11795#true} #73#return; {11795#true} is VALID [2018-11-23 12:16:19,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {11795#true} call #t~ret14 := main(); {11795#true} is VALID [2018-11-23 12:16:19,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {11795#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; {11795#true} is VALID [2018-11-23 12:16:19,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,479 INFO L273 TraceCheckUtils]: 17: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 20: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 21: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 22: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {11795#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {11795#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11795#true} is VALID [2018-11-23 12:16:19,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {11795#true} assume !(~i~1 < 10); {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L256 TraceCheckUtils]: 27: Hoare triple {11795#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {11795#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 34: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 36: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 37: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 41: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 42: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 44: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 46: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 47: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 48: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 49: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 50: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 51: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,483 INFO L273 TraceCheckUtils]: 52: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,484 INFO L273 TraceCheckUtils]: 53: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,484 INFO L273 TraceCheckUtils]: 54: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,484 INFO L273 TraceCheckUtils]: 55: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,484 INFO L273 TraceCheckUtils]: 56: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,484 INFO L273 TraceCheckUtils]: 58: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,485 INFO L273 TraceCheckUtils]: 62: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,485 INFO L273 TraceCheckUtils]: 63: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,485 INFO L273 TraceCheckUtils]: 64: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,485 INFO L273 TraceCheckUtils]: 65: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L273 TraceCheckUtils]: 66: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L273 TraceCheckUtils]: 67: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L273 TraceCheckUtils]: 68: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L273 TraceCheckUtils]: 69: Hoare triple {11795#true} assume !(~i~0 < 10); {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L273 TraceCheckUtils]: 70: Hoare triple {11795#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L273 TraceCheckUtils]: 71: Hoare triple {11795#true} assume true; {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {11795#true} {11795#true} #77#return; {11795#true} is VALID [2018-11-23 12:16:19,486 INFO L273 TraceCheckUtils]: 73: Hoare triple {11795#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11795#true} is VALID [2018-11-23 12:16:19,487 INFO L256 TraceCheckUtils]: 74: Hoare triple {11795#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {11795#true} is VALID [2018-11-23 12:16:19,487 INFO L273 TraceCheckUtils]: 75: Hoare triple {11795#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11795#true} is VALID [2018-11-23 12:16:19,487 INFO L273 TraceCheckUtils]: 76: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,487 INFO L273 TraceCheckUtils]: 77: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,487 INFO L273 TraceCheckUtils]: 78: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,487 INFO L273 TraceCheckUtils]: 79: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,487 INFO L273 TraceCheckUtils]: 80: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,488 INFO L273 TraceCheckUtils]: 81: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,488 INFO L273 TraceCheckUtils]: 82: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,488 INFO L273 TraceCheckUtils]: 83: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,488 INFO L273 TraceCheckUtils]: 84: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,488 INFO L273 TraceCheckUtils]: 85: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,488 INFO L273 TraceCheckUtils]: 86: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,488 INFO L273 TraceCheckUtils]: 87: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,489 INFO L273 TraceCheckUtils]: 88: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,489 INFO L273 TraceCheckUtils]: 89: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,489 INFO L273 TraceCheckUtils]: 90: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,489 INFO L273 TraceCheckUtils]: 91: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,489 INFO L273 TraceCheckUtils]: 92: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,489 INFO L273 TraceCheckUtils]: 93: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,489 INFO L273 TraceCheckUtils]: 94: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 95: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 96: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 97: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 98: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 99: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 100: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 101: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 102: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,490 INFO L273 TraceCheckUtils]: 103: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 104: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 105: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 106: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 107: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 108: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 109: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 110: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 111: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,491 INFO L273 TraceCheckUtils]: 112: Hoare triple {11795#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11795#true} is VALID [2018-11-23 12:16:19,492 INFO L273 TraceCheckUtils]: 113: Hoare triple {11795#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11795#true} is VALID [2018-11-23 12:16:19,492 INFO L273 TraceCheckUtils]: 114: Hoare triple {11795#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11795#true} is VALID [2018-11-23 12:16:19,492 INFO L273 TraceCheckUtils]: 115: Hoare triple {11795#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11795#true} is VALID [2018-11-23 12:16:19,492 INFO L273 TraceCheckUtils]: 116: Hoare triple {11795#true} assume !(~i~0 < 10); {11795#true} is VALID [2018-11-23 12:16:19,492 INFO L273 TraceCheckUtils]: 117: Hoare triple {11795#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11795#true} is VALID [2018-11-23 12:16:19,492 INFO L273 TraceCheckUtils]: 118: Hoare triple {11795#true} assume true; {11795#true} is VALID [2018-11-23 12:16:19,492 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {11795#true} {11795#true} #79#return; {11795#true} is VALID [2018-11-23 12:16:19,493 INFO L273 TraceCheckUtils]: 120: Hoare triple {11795#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {12167#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:19,493 INFO L273 TraceCheckUtils]: 121: Hoare triple {12167#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12167#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:19,495 INFO L273 TraceCheckUtils]: 122: Hoare triple {12167#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11798#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:19,496 INFO L273 TraceCheckUtils]: 123: Hoare triple {11798#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11798#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:19,496 INFO L273 TraceCheckUtils]: 124: Hoare triple {11798#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11799#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:19,497 INFO L273 TraceCheckUtils]: 125: Hoare triple {11799#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11799#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:19,497 INFO L273 TraceCheckUtils]: 126: Hoare triple {11799#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11800#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:19,497 INFO L273 TraceCheckUtils]: 127: Hoare triple {11800#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11800#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:19,498 INFO L273 TraceCheckUtils]: 128: Hoare triple {11800#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11801#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:19,498 INFO L273 TraceCheckUtils]: 129: Hoare triple {11801#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11801#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:19,499 INFO L273 TraceCheckUtils]: 130: Hoare triple {11801#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11802#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:19,499 INFO L273 TraceCheckUtils]: 131: Hoare triple {11802#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11802#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:19,500 INFO L273 TraceCheckUtils]: 132: Hoare triple {11802#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11803#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:19,500 INFO L273 TraceCheckUtils]: 133: Hoare triple {11803#(<= main_~i~2 6)} assume !(~i~2 < 9); {11796#false} is VALID [2018-11-23 12:16:19,501 INFO L273 TraceCheckUtils]: 134: Hoare triple {11796#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {11796#false} is VALID [2018-11-23 12:16:19,501 INFO L256 TraceCheckUtils]: 135: Hoare triple {11796#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {11796#false} is VALID [2018-11-23 12:16:19,501 INFO L273 TraceCheckUtils]: 136: Hoare triple {11796#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {11796#false} is VALID [2018-11-23 12:16:19,501 INFO L273 TraceCheckUtils]: 137: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,501 INFO L273 TraceCheckUtils]: 138: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,502 INFO L273 TraceCheckUtils]: 139: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,502 INFO L273 TraceCheckUtils]: 140: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,502 INFO L273 TraceCheckUtils]: 141: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,503 INFO L273 TraceCheckUtils]: 142: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,503 INFO L273 TraceCheckUtils]: 143: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,503 INFO L273 TraceCheckUtils]: 144: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,503 INFO L273 TraceCheckUtils]: 145: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,503 INFO L273 TraceCheckUtils]: 146: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,503 INFO L273 TraceCheckUtils]: 147: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,504 INFO L273 TraceCheckUtils]: 148: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,504 INFO L273 TraceCheckUtils]: 149: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,504 INFO L273 TraceCheckUtils]: 150: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,504 INFO L273 TraceCheckUtils]: 151: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,504 INFO L273 TraceCheckUtils]: 152: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,504 INFO L273 TraceCheckUtils]: 153: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,505 INFO L273 TraceCheckUtils]: 154: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,505 INFO L273 TraceCheckUtils]: 155: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,505 INFO L273 TraceCheckUtils]: 156: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,505 INFO L273 TraceCheckUtils]: 157: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,505 INFO L273 TraceCheckUtils]: 158: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,505 INFO L273 TraceCheckUtils]: 159: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,505 INFO L273 TraceCheckUtils]: 160: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,506 INFO L273 TraceCheckUtils]: 161: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,506 INFO L273 TraceCheckUtils]: 162: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,506 INFO L273 TraceCheckUtils]: 163: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,506 INFO L273 TraceCheckUtils]: 164: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,506 INFO L273 TraceCheckUtils]: 165: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,506 INFO L273 TraceCheckUtils]: 166: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,507 INFO L273 TraceCheckUtils]: 167: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,507 INFO L273 TraceCheckUtils]: 168: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,507 INFO L273 TraceCheckUtils]: 169: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,507 INFO L273 TraceCheckUtils]: 170: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,507 INFO L273 TraceCheckUtils]: 171: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,507 INFO L273 TraceCheckUtils]: 172: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,508 INFO L273 TraceCheckUtils]: 173: Hoare triple {11796#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11796#false} is VALID [2018-11-23 12:16:19,508 INFO L273 TraceCheckUtils]: 174: Hoare triple {11796#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {11796#false} is VALID [2018-11-23 12:16:19,508 INFO L273 TraceCheckUtils]: 175: Hoare triple {11796#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {11796#false} is VALID [2018-11-23 12:16:19,508 INFO L273 TraceCheckUtils]: 176: Hoare triple {11796#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11796#false} is VALID [2018-11-23 12:16:19,508 INFO L273 TraceCheckUtils]: 177: Hoare triple {11796#false} assume !(~i~0 < 10); {11796#false} is VALID [2018-11-23 12:16:19,508 INFO L273 TraceCheckUtils]: 178: Hoare triple {11796#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11796#false} is VALID [2018-11-23 12:16:19,508 INFO L273 TraceCheckUtils]: 179: Hoare triple {11796#false} assume true; {11796#false} is VALID [2018-11-23 12:16:19,509 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {11796#false} {11796#false} #81#return; {11796#false} is VALID [2018-11-23 12:16:19,509 INFO L273 TraceCheckUtils]: 181: Hoare triple {11796#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11796#false} is VALID [2018-11-23 12:16:19,509 INFO L273 TraceCheckUtils]: 182: Hoare triple {11796#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11796#false} is VALID [2018-11-23 12:16:19,509 INFO L273 TraceCheckUtils]: 183: Hoare triple {11796#false} assume !false; {11796#false} is VALID [2018-11-23 12:16:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 850 proven. 36 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2018-11-23 12:16:19,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:19,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:16:19,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-11-23 12:16:19,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:19,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:16:19,597 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:16:19,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:16:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:16:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:19,598 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 10 states. [2018-11-23 12:16:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:19,853 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2018-11-23 12:16:19,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:16:19,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 184 [2018-11-23 12:16:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:16:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2018-11-23 12:16:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:16:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2018-11-23 12:16:19,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 63 transitions. [2018-11-23 12:16:19,914 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:16:19,917 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:16:19,917 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:16:19,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:16:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-11-23 12:16:19,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:19,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 97 states. [2018-11-23 12:16:19,956 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 97 states. [2018-11-23 12:16:19,956 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 97 states. [2018-11-23 12:16:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:19,957 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-23 12:16:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-23 12:16:19,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:19,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:19,958 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 98 states. [2018-11-23 12:16:19,958 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 98 states. [2018-11-23 12:16:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:19,960 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2018-11-23 12:16:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-11-23 12:16:19,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:19,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:19,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:19,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 12:16:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2018-11-23 12:16:19,962 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 184 [2018-11-23 12:16:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:19,962 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2018-11-23 12:16:19,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:16:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2018-11-23 12:16:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-23 12:16:19,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:19,964 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 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:16:19,965 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:19,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:19,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2020847425, now seen corresponding path program 18 times [2018-11-23 12:16:19,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:19,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:19,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:20,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {12887#true} call ULTIMATE.init(); {12887#true} is VALID [2018-11-23 12:16:20,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {12887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12887#true} is VALID [2018-11-23 12:16:20,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {12887#true} assume true; {12887#true} is VALID [2018-11-23 12:16:20,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12887#true} {12887#true} #73#return; {12887#true} is VALID [2018-11-23 12:16:20,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {12887#true} call #t~ret14 := main(); {12887#true} is VALID [2018-11-23 12:16:20,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {12887#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; {12887#true} is VALID [2018-11-23 12:16:20,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,334 INFO L273 TraceCheckUtils]: 22: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,334 INFO L273 TraceCheckUtils]: 23: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:20,334 INFO L273 TraceCheckUtils]: 25: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:20,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {12887#true} assume !(~i~1 < 10); {12887#true} is VALID [2018-11-23 12:16:20,335 INFO L256 TraceCheckUtils]: 27: Hoare triple {12887#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {12887#true} is VALID [2018-11-23 12:16:20,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {12887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12887#true} is VALID [2018-11-23 12:16:20,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,335 INFO L273 TraceCheckUtils]: 32: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,336 INFO L273 TraceCheckUtils]: 36: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,337 INFO L273 TraceCheckUtils]: 40: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,337 INFO L273 TraceCheckUtils]: 41: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,337 INFO L273 TraceCheckUtils]: 42: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,337 INFO L273 TraceCheckUtils]: 43: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,337 INFO L273 TraceCheckUtils]: 44: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,338 INFO L273 TraceCheckUtils]: 45: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,338 INFO L273 TraceCheckUtils]: 46: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,338 INFO L273 TraceCheckUtils]: 47: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,338 INFO L273 TraceCheckUtils]: 48: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,338 INFO L273 TraceCheckUtils]: 49: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,338 INFO L273 TraceCheckUtils]: 50: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,338 INFO L273 TraceCheckUtils]: 51: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,339 INFO L273 TraceCheckUtils]: 52: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,339 INFO L273 TraceCheckUtils]: 55: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,339 INFO L273 TraceCheckUtils]: 56: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,339 INFO L273 TraceCheckUtils]: 57: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,340 INFO L273 TraceCheckUtils]: 59: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,340 INFO L273 TraceCheckUtils]: 60: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,340 INFO L273 TraceCheckUtils]: 61: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,340 INFO L273 TraceCheckUtils]: 62: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,340 INFO L273 TraceCheckUtils]: 63: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,341 INFO L273 TraceCheckUtils]: 64: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,341 INFO L273 TraceCheckUtils]: 65: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,341 INFO L273 TraceCheckUtils]: 66: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,341 INFO L273 TraceCheckUtils]: 67: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,341 INFO L273 TraceCheckUtils]: 68: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,341 INFO L273 TraceCheckUtils]: 69: Hoare triple {12887#true} assume !(~i~0 < 10); {12887#true} is VALID [2018-11-23 12:16:20,341 INFO L273 TraceCheckUtils]: 70: Hoare triple {12887#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12887#true} is VALID [2018-11-23 12:16:20,342 INFO L273 TraceCheckUtils]: 71: Hoare triple {12887#true} assume true; {12887#true} is VALID [2018-11-23 12:16:20,342 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {12887#true} {12887#true} #77#return; {12887#true} is VALID [2018-11-23 12:16:20,342 INFO L273 TraceCheckUtils]: 73: Hoare triple {12887#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12887#true} is VALID [2018-11-23 12:16:20,342 INFO L256 TraceCheckUtils]: 74: Hoare triple {12887#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {12887#true} is VALID [2018-11-23 12:16:20,342 INFO L273 TraceCheckUtils]: 75: Hoare triple {12887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12887#true} is VALID [2018-11-23 12:16:20,342 INFO L273 TraceCheckUtils]: 76: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,343 INFO L273 TraceCheckUtils]: 77: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,343 INFO L273 TraceCheckUtils]: 78: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,343 INFO L273 TraceCheckUtils]: 79: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,343 INFO L273 TraceCheckUtils]: 80: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,343 INFO L273 TraceCheckUtils]: 81: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,343 INFO L273 TraceCheckUtils]: 82: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,344 INFO L273 TraceCheckUtils]: 83: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,344 INFO L273 TraceCheckUtils]: 84: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,344 INFO L273 TraceCheckUtils]: 85: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,344 INFO L273 TraceCheckUtils]: 86: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,344 INFO L273 TraceCheckUtils]: 87: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,344 INFO L273 TraceCheckUtils]: 88: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,344 INFO L273 TraceCheckUtils]: 89: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,345 INFO L273 TraceCheckUtils]: 90: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,345 INFO L273 TraceCheckUtils]: 91: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,345 INFO L273 TraceCheckUtils]: 92: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,345 INFO L273 TraceCheckUtils]: 93: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,345 INFO L273 TraceCheckUtils]: 94: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,345 INFO L273 TraceCheckUtils]: 95: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,346 INFO L273 TraceCheckUtils]: 96: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,346 INFO L273 TraceCheckUtils]: 97: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,346 INFO L273 TraceCheckUtils]: 98: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,346 INFO L273 TraceCheckUtils]: 99: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,346 INFO L273 TraceCheckUtils]: 100: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,346 INFO L273 TraceCheckUtils]: 101: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,346 INFO L273 TraceCheckUtils]: 102: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,347 INFO L273 TraceCheckUtils]: 103: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,347 INFO L273 TraceCheckUtils]: 104: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,347 INFO L273 TraceCheckUtils]: 105: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,347 INFO L273 TraceCheckUtils]: 106: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,347 INFO L273 TraceCheckUtils]: 107: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,347 INFO L273 TraceCheckUtils]: 108: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,348 INFO L273 TraceCheckUtils]: 109: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,348 INFO L273 TraceCheckUtils]: 110: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,348 INFO L273 TraceCheckUtils]: 111: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,348 INFO L273 TraceCheckUtils]: 112: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,348 INFO L273 TraceCheckUtils]: 113: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,348 INFO L273 TraceCheckUtils]: 114: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,348 INFO L273 TraceCheckUtils]: 115: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,349 INFO L273 TraceCheckUtils]: 116: Hoare triple {12887#true} assume !(~i~0 < 10); {12887#true} is VALID [2018-11-23 12:16:20,349 INFO L273 TraceCheckUtils]: 117: Hoare triple {12887#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12887#true} is VALID [2018-11-23 12:16:20,349 INFO L273 TraceCheckUtils]: 118: Hoare triple {12887#true} assume true; {12887#true} is VALID [2018-11-23 12:16:20,349 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {12887#true} {12887#true} #79#return; {12887#true} is VALID [2018-11-23 12:16:20,362 INFO L273 TraceCheckUtils]: 120: Hoare triple {12887#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {12889#(= main_~i~2 0)} is VALID [2018-11-23 12:16:20,366 INFO L273 TraceCheckUtils]: 121: Hoare triple {12889#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12889#(= main_~i~2 0)} is VALID [2018-11-23 12:16:20,366 INFO L273 TraceCheckUtils]: 122: Hoare triple {12889#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12890#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:20,368 INFO L273 TraceCheckUtils]: 123: Hoare triple {12890#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12890#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:20,368 INFO L273 TraceCheckUtils]: 124: Hoare triple {12890#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12891#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:20,370 INFO L273 TraceCheckUtils]: 125: Hoare triple {12891#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12891#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:20,370 INFO L273 TraceCheckUtils]: 126: Hoare triple {12891#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12892#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:20,372 INFO L273 TraceCheckUtils]: 127: Hoare triple {12892#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12892#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:20,372 INFO L273 TraceCheckUtils]: 128: Hoare triple {12892#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12893#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:20,374 INFO L273 TraceCheckUtils]: 129: Hoare triple {12893#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12893#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:20,374 INFO L273 TraceCheckUtils]: 130: Hoare triple {12893#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12894#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:20,376 INFO L273 TraceCheckUtils]: 131: Hoare triple {12894#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12894#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:20,376 INFO L273 TraceCheckUtils]: 132: Hoare triple {12894#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12895#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:20,376 INFO L273 TraceCheckUtils]: 133: Hoare triple {12895#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12895#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:20,377 INFO L273 TraceCheckUtils]: 134: Hoare triple {12895#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12896#(<= main_~i~2 7)} is VALID [2018-11-23 12:16:20,377 INFO L273 TraceCheckUtils]: 135: Hoare triple {12896#(<= main_~i~2 7)} assume !(~i~2 < 9); {12888#false} is VALID [2018-11-23 12:16:20,377 INFO L273 TraceCheckUtils]: 136: Hoare triple {12888#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {12888#false} is VALID [2018-11-23 12:16:20,378 INFO L256 TraceCheckUtils]: 137: Hoare triple {12888#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {12887#true} is VALID [2018-11-23 12:16:20,378 INFO L273 TraceCheckUtils]: 138: Hoare triple {12887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12887#true} is VALID [2018-11-23 12:16:20,378 INFO L273 TraceCheckUtils]: 139: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,378 INFO L273 TraceCheckUtils]: 140: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,378 INFO L273 TraceCheckUtils]: 141: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,378 INFO L273 TraceCheckUtils]: 142: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,378 INFO L273 TraceCheckUtils]: 143: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,378 INFO L273 TraceCheckUtils]: 144: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,379 INFO L273 TraceCheckUtils]: 145: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,379 INFO L273 TraceCheckUtils]: 146: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,379 INFO L273 TraceCheckUtils]: 147: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,379 INFO L273 TraceCheckUtils]: 148: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,379 INFO L273 TraceCheckUtils]: 149: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,379 INFO L273 TraceCheckUtils]: 150: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,380 INFO L273 TraceCheckUtils]: 151: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,380 INFO L273 TraceCheckUtils]: 152: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,380 INFO L273 TraceCheckUtils]: 153: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,380 INFO L273 TraceCheckUtils]: 154: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,381 INFO L273 TraceCheckUtils]: 155: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,381 INFO L273 TraceCheckUtils]: 156: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,381 INFO L273 TraceCheckUtils]: 157: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,381 INFO L273 TraceCheckUtils]: 158: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,382 INFO L273 TraceCheckUtils]: 159: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,382 INFO L273 TraceCheckUtils]: 160: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,382 INFO L273 TraceCheckUtils]: 161: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,382 INFO L273 TraceCheckUtils]: 162: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,382 INFO L273 TraceCheckUtils]: 163: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,382 INFO L273 TraceCheckUtils]: 164: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,383 INFO L273 TraceCheckUtils]: 165: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,383 INFO L273 TraceCheckUtils]: 166: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,383 INFO L273 TraceCheckUtils]: 167: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,383 INFO L273 TraceCheckUtils]: 168: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,383 INFO L273 TraceCheckUtils]: 169: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,383 INFO L273 TraceCheckUtils]: 170: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,383 INFO L273 TraceCheckUtils]: 171: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,384 INFO L273 TraceCheckUtils]: 172: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,384 INFO L273 TraceCheckUtils]: 173: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,384 INFO L273 TraceCheckUtils]: 174: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,384 INFO L273 TraceCheckUtils]: 175: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:20,384 INFO L273 TraceCheckUtils]: 176: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:20,384 INFO L273 TraceCheckUtils]: 177: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:20,385 INFO L273 TraceCheckUtils]: 178: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:20,385 INFO L273 TraceCheckUtils]: 179: Hoare triple {12887#true} assume !(~i~0 < 10); {12887#true} is VALID [2018-11-23 12:16:20,385 INFO L273 TraceCheckUtils]: 180: Hoare triple {12887#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12887#true} is VALID [2018-11-23 12:16:20,385 INFO L273 TraceCheckUtils]: 181: Hoare triple {12887#true} assume true; {12887#true} is VALID [2018-11-23 12:16:20,385 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {12887#true} {12888#false} #81#return; {12888#false} is VALID [2018-11-23 12:16:20,385 INFO L273 TraceCheckUtils]: 183: Hoare triple {12888#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {12888#false} is VALID [2018-11-23 12:16:20,386 INFO L273 TraceCheckUtils]: 184: Hoare triple {12888#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12888#false} is VALID [2018-11-23 12:16:20,386 INFO L273 TraceCheckUtils]: 185: Hoare triple {12888#false} assume !false; {12888#false} is VALID [2018-11-23 12:16:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2018-11-23 12:16:20,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:20,403 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:16:20,420 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:16:20,960 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 12:16:20,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:21,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:21,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {12887#true} call ULTIMATE.init(); {12887#true} is VALID [2018-11-23 12:16:21,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {12887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12887#true} is VALID [2018-11-23 12:16:21,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {12887#true} assume true; {12887#true} is VALID [2018-11-23 12:16:21,170 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12887#true} {12887#true} #73#return; {12887#true} is VALID [2018-11-23 12:16:21,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {12887#true} call #t~ret14 := main(); {12887#true} is VALID [2018-11-23 12:16:21,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {12887#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; {12887#true} is VALID [2018-11-23 12:16:21,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,173 INFO L273 TraceCheckUtils]: 17: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,173 INFO L273 TraceCheckUtils]: 18: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,173 INFO L273 TraceCheckUtils]: 19: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {12887#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {12887#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {12887#true} assume !(~i~1 < 10); {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L256 TraceCheckUtils]: 27: Hoare triple {12887#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {12887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 32: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 37: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 38: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 43: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 44: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 45: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 47: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,176 INFO L273 TraceCheckUtils]: 48: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,177 INFO L273 TraceCheckUtils]: 49: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,177 INFO L273 TraceCheckUtils]: 50: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,177 INFO L273 TraceCheckUtils]: 51: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,177 INFO L273 TraceCheckUtils]: 52: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,178 INFO L273 TraceCheckUtils]: 55: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,178 INFO L273 TraceCheckUtils]: 57: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,179 INFO L273 TraceCheckUtils]: 62: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,179 INFO L273 TraceCheckUtils]: 63: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,179 INFO L273 TraceCheckUtils]: 64: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,179 INFO L273 TraceCheckUtils]: 67: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,179 INFO L273 TraceCheckUtils]: 68: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,180 INFO L273 TraceCheckUtils]: 69: Hoare triple {12887#true} assume !(~i~0 < 10); {12887#true} is VALID [2018-11-23 12:16:21,180 INFO L273 TraceCheckUtils]: 70: Hoare triple {12887#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12887#true} is VALID [2018-11-23 12:16:21,180 INFO L273 TraceCheckUtils]: 71: Hoare triple {12887#true} assume true; {12887#true} is VALID [2018-11-23 12:16:21,180 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {12887#true} {12887#true} #77#return; {12887#true} is VALID [2018-11-23 12:16:21,180 INFO L273 TraceCheckUtils]: 73: Hoare triple {12887#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12887#true} is VALID [2018-11-23 12:16:21,180 INFO L256 TraceCheckUtils]: 74: Hoare triple {12887#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {12887#true} is VALID [2018-11-23 12:16:21,180 INFO L273 TraceCheckUtils]: 75: Hoare triple {12887#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 76: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 77: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 78: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 79: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 80: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 81: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 82: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 83: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 84: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,181 INFO L273 TraceCheckUtils]: 85: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 86: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 87: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 88: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 89: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 90: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 91: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 92: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 93: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 94: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,182 INFO L273 TraceCheckUtils]: 95: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 96: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 97: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 98: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 99: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 100: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 101: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 102: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 103: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,183 INFO L273 TraceCheckUtils]: 104: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 105: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 106: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 107: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 108: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 109: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 110: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 111: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 112: Hoare triple {12887#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 113: Hoare triple {12887#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12887#true} is VALID [2018-11-23 12:16:21,184 INFO L273 TraceCheckUtils]: 114: Hoare triple {12887#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12887#true} is VALID [2018-11-23 12:16:21,185 INFO L273 TraceCheckUtils]: 115: Hoare triple {12887#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12887#true} is VALID [2018-11-23 12:16:21,185 INFO L273 TraceCheckUtils]: 116: Hoare triple {12887#true} assume !(~i~0 < 10); {12887#true} is VALID [2018-11-23 12:16:21,185 INFO L273 TraceCheckUtils]: 117: Hoare triple {12887#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12887#true} is VALID [2018-11-23 12:16:21,185 INFO L273 TraceCheckUtils]: 118: Hoare triple {12887#true} assume true; {12887#true} is VALID [2018-11-23 12:16:21,185 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {12887#true} {12887#true} #79#return; {12887#true} is VALID [2018-11-23 12:16:21,186 INFO L273 TraceCheckUtils]: 120: Hoare triple {12887#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {13260#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:21,186 INFO L273 TraceCheckUtils]: 121: Hoare triple {13260#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13260#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:21,186 INFO L273 TraceCheckUtils]: 122: Hoare triple {13260#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12890#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:21,191 INFO L273 TraceCheckUtils]: 123: Hoare triple {12890#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12890#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:21,191 INFO L273 TraceCheckUtils]: 124: Hoare triple {12890#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12891#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:21,191 INFO L273 TraceCheckUtils]: 125: Hoare triple {12891#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12891#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:21,192 INFO L273 TraceCheckUtils]: 126: Hoare triple {12891#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12892#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:21,192 INFO L273 TraceCheckUtils]: 127: Hoare triple {12892#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12892#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:21,193 INFO L273 TraceCheckUtils]: 128: Hoare triple {12892#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12893#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:21,193 INFO L273 TraceCheckUtils]: 129: Hoare triple {12893#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12893#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:21,193 INFO L273 TraceCheckUtils]: 130: Hoare triple {12893#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12894#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:21,194 INFO L273 TraceCheckUtils]: 131: Hoare triple {12894#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12894#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:21,194 INFO L273 TraceCheckUtils]: 132: Hoare triple {12894#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12895#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:21,194 INFO L273 TraceCheckUtils]: 133: Hoare triple {12895#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12895#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:21,195 INFO L273 TraceCheckUtils]: 134: Hoare triple {12895#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12896#(<= main_~i~2 7)} is VALID [2018-11-23 12:16:21,195 INFO L273 TraceCheckUtils]: 135: Hoare triple {12896#(<= main_~i~2 7)} assume !(~i~2 < 9); {12888#false} is VALID [2018-11-23 12:16:21,196 INFO L273 TraceCheckUtils]: 136: Hoare triple {12888#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {12888#false} is VALID [2018-11-23 12:16:21,196 INFO L256 TraceCheckUtils]: 137: Hoare triple {12888#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {12888#false} is VALID [2018-11-23 12:16:21,196 INFO L273 TraceCheckUtils]: 138: Hoare triple {12888#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {12888#false} is VALID [2018-11-23 12:16:21,196 INFO L273 TraceCheckUtils]: 139: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,196 INFO L273 TraceCheckUtils]: 140: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,197 INFO L273 TraceCheckUtils]: 141: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,197 INFO L273 TraceCheckUtils]: 142: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,197 INFO L273 TraceCheckUtils]: 143: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,197 INFO L273 TraceCheckUtils]: 144: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,197 INFO L273 TraceCheckUtils]: 145: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,197 INFO L273 TraceCheckUtils]: 146: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,198 INFO L273 TraceCheckUtils]: 147: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,198 INFO L273 TraceCheckUtils]: 148: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,198 INFO L273 TraceCheckUtils]: 149: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,198 INFO L273 TraceCheckUtils]: 150: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,198 INFO L273 TraceCheckUtils]: 151: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,198 INFO L273 TraceCheckUtils]: 152: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,199 INFO L273 TraceCheckUtils]: 153: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,199 INFO L273 TraceCheckUtils]: 154: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,199 INFO L273 TraceCheckUtils]: 155: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,199 INFO L273 TraceCheckUtils]: 156: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,199 INFO L273 TraceCheckUtils]: 157: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,199 INFO L273 TraceCheckUtils]: 158: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 159: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 160: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 161: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 162: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 163: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 164: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 165: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,200 INFO L273 TraceCheckUtils]: 166: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 167: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 168: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 169: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 170: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 171: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 172: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 173: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 174: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,201 INFO L273 TraceCheckUtils]: 175: Hoare triple {12888#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 176: Hoare triple {12888#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 177: Hoare triple {12888#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 178: Hoare triple {12888#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 179: Hoare triple {12888#false} assume !(~i~0 < 10); {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 180: Hoare triple {12888#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 181: Hoare triple {12888#false} assume true; {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L268 TraceCheckUtils]: 182: Hoare quadruple {12888#false} {12888#false} #81#return; {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 183: Hoare triple {12888#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {12888#false} is VALID [2018-11-23 12:16:21,202 INFO L273 TraceCheckUtils]: 184: Hoare triple {12888#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12888#false} is VALID [2018-11-23 12:16:21,203 INFO L273 TraceCheckUtils]: 185: Hoare triple {12888#false} assume !false; {12888#false} is VALID [2018-11-23 12:16:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 850 proven. 49 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2018-11-23 12:16:21,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:21,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:16:21,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 186 [2018-11-23 12:16:21,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:21,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:21,294 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:16:21,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:21,295 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand 11 states. [2018-11-23 12:16:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:21,423 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2018-11-23 12:16:21,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:16:21,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 186 [2018-11-23 12:16:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2018-11-23 12:16:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2018-11-23 12:16:21,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2018-11-23 12:16:21,485 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:16:21,488 INFO L225 Difference]: With dead ends: 151 [2018-11-23 12:16:21,488 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:16:21,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:16:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-23 12:16:21,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:21,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 99 states. [2018-11-23 12:16:21,519 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 99 states. [2018-11-23 12:16:21,519 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 99 states. [2018-11-23 12:16:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:21,521 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-11-23 12:16:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-11-23 12:16:21,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:21,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:21,522 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 100 states. [2018-11-23 12:16:21,522 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 100 states. [2018-11-23 12:16:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:21,524 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-11-23 12:16:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-11-23 12:16:21,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:21,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:21,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:21,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:16:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-11-23 12:16:21,527 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 186 [2018-11-23 12:16:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:21,528 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-11-23 12:16:21,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-11-23 12:16:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-23 12:16:21,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:21,529 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 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:16:21,530 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:21,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1362319773, now seen corresponding path program 19 times [2018-11-23 12:16:21,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:21,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:21,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:21,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {13996#true} call ULTIMATE.init(); {13996#true} is VALID [2018-11-23 12:16:21,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {13996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13996#true} is VALID [2018-11-23 12:16:21,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {13996#true} assume true; {13996#true} is VALID [2018-11-23 12:16:21,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13996#true} {13996#true} #73#return; {13996#true} is VALID [2018-11-23 12:16:21,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {13996#true} call #t~ret14 := main(); {13996#true} is VALID [2018-11-23 12:16:21,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {13996#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; {13996#true} is VALID [2018-11-23 12:16:21,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 21: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {13996#true} assume !(~i~1 < 10); {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L256 TraceCheckUtils]: 27: Hoare triple {13996#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {13996#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 36: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 37: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 38: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,836 INFO L273 TraceCheckUtils]: 39: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 40: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 41: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 42: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 44: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 45: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 46: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 47: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 48: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,837 INFO L273 TraceCheckUtils]: 49: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 50: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 51: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 52: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 53: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 54: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 55: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 56: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 57: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,838 INFO L273 TraceCheckUtils]: 58: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 59: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 60: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 61: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 62: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 63: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 64: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 66: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,839 INFO L273 TraceCheckUtils]: 67: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 68: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 69: Hoare triple {13996#true} assume !(~i~0 < 10); {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 70: Hoare triple {13996#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 71: Hoare triple {13996#true} assume true; {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13996#true} {13996#true} #77#return; {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 73: Hoare triple {13996#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L256 TraceCheckUtils]: 74: Hoare triple {13996#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {13996#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 76: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,840 INFO L273 TraceCheckUtils]: 77: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 78: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 79: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 80: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 81: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 82: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 84: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 85: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,841 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 90: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 91: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 92: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 93: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 94: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 95: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,842 INFO L273 TraceCheckUtils]: 96: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 97: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 98: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 99: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 100: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 101: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 102: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 103: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 104: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,843 INFO L273 TraceCheckUtils]: 105: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 106: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 107: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 111: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,844 INFO L273 TraceCheckUtils]: 115: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,845 INFO L273 TraceCheckUtils]: 116: Hoare triple {13996#true} assume !(~i~0 < 10); {13996#true} is VALID [2018-11-23 12:16:21,845 INFO L273 TraceCheckUtils]: 117: Hoare triple {13996#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13996#true} is VALID [2018-11-23 12:16:21,845 INFO L273 TraceCheckUtils]: 118: Hoare triple {13996#true} assume true; {13996#true} is VALID [2018-11-23 12:16:21,845 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {13996#true} {13996#true} #79#return; {13996#true} is VALID [2018-11-23 12:16:21,845 INFO L273 TraceCheckUtils]: 120: Hoare triple {13996#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {13998#(= main_~i~2 0)} is VALID [2018-11-23 12:16:21,846 INFO L273 TraceCheckUtils]: 121: Hoare triple {13998#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13998#(= main_~i~2 0)} is VALID [2018-11-23 12:16:21,846 INFO L273 TraceCheckUtils]: 122: Hoare triple {13998#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13999#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:21,846 INFO L273 TraceCheckUtils]: 123: Hoare triple {13999#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13999#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:21,847 INFO L273 TraceCheckUtils]: 124: Hoare triple {13999#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14000#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:21,847 INFO L273 TraceCheckUtils]: 125: Hoare triple {14000#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14000#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:21,848 INFO L273 TraceCheckUtils]: 126: Hoare triple {14000#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14001#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:21,848 INFO L273 TraceCheckUtils]: 127: Hoare triple {14001#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14001#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:21,848 INFO L273 TraceCheckUtils]: 128: Hoare triple {14001#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14002#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:21,849 INFO L273 TraceCheckUtils]: 129: Hoare triple {14002#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14002#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:21,849 INFO L273 TraceCheckUtils]: 130: Hoare triple {14002#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14003#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:21,849 INFO L273 TraceCheckUtils]: 131: Hoare triple {14003#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14003#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:21,850 INFO L273 TraceCheckUtils]: 132: Hoare triple {14003#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14004#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:21,851 INFO L273 TraceCheckUtils]: 133: Hoare triple {14004#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14004#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:21,851 INFO L273 TraceCheckUtils]: 134: Hoare triple {14004#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14005#(<= main_~i~2 7)} is VALID [2018-11-23 12:16:21,852 INFO L273 TraceCheckUtils]: 135: Hoare triple {14005#(<= main_~i~2 7)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14005#(<= main_~i~2 7)} is VALID [2018-11-23 12:16:21,852 INFO L273 TraceCheckUtils]: 136: Hoare triple {14005#(<= main_~i~2 7)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14006#(<= main_~i~2 8)} is VALID [2018-11-23 12:16:21,853 INFO L273 TraceCheckUtils]: 137: Hoare triple {14006#(<= main_~i~2 8)} assume !(~i~2 < 9); {13997#false} is VALID [2018-11-23 12:16:21,853 INFO L273 TraceCheckUtils]: 138: Hoare triple {13997#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {13997#false} is VALID [2018-11-23 12:16:21,853 INFO L256 TraceCheckUtils]: 139: Hoare triple {13997#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {13996#true} is VALID [2018-11-23 12:16:21,854 INFO L273 TraceCheckUtils]: 140: Hoare triple {13996#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13996#true} is VALID [2018-11-23 12:16:21,854 INFO L273 TraceCheckUtils]: 141: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,854 INFO L273 TraceCheckUtils]: 142: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,854 INFO L273 TraceCheckUtils]: 143: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,854 INFO L273 TraceCheckUtils]: 144: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,854 INFO L273 TraceCheckUtils]: 145: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,855 INFO L273 TraceCheckUtils]: 146: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,855 INFO L273 TraceCheckUtils]: 147: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,855 INFO L273 TraceCheckUtils]: 148: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,855 INFO L273 TraceCheckUtils]: 149: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,855 INFO L273 TraceCheckUtils]: 150: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,855 INFO L273 TraceCheckUtils]: 151: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,856 INFO L273 TraceCheckUtils]: 152: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,856 INFO L273 TraceCheckUtils]: 153: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,856 INFO L273 TraceCheckUtils]: 154: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,856 INFO L273 TraceCheckUtils]: 155: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,856 INFO L273 TraceCheckUtils]: 156: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,857 INFO L273 TraceCheckUtils]: 157: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,857 INFO L273 TraceCheckUtils]: 158: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,857 INFO L273 TraceCheckUtils]: 159: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,857 INFO L273 TraceCheckUtils]: 160: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,857 INFO L273 TraceCheckUtils]: 161: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,857 INFO L273 TraceCheckUtils]: 162: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,857 INFO L273 TraceCheckUtils]: 163: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 164: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 165: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 166: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 167: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 168: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 169: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 170: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 171: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,858 INFO L273 TraceCheckUtils]: 172: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 173: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 174: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 175: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 176: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 177: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 178: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 179: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 180: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 181: Hoare triple {13996#true} assume !(~i~0 < 10); {13996#true} is VALID [2018-11-23 12:16:21,859 INFO L273 TraceCheckUtils]: 182: Hoare triple {13996#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13996#true} is VALID [2018-11-23 12:16:21,860 INFO L273 TraceCheckUtils]: 183: Hoare triple {13996#true} assume true; {13996#true} is VALID [2018-11-23 12:16:21,860 INFO L268 TraceCheckUtils]: 184: Hoare quadruple {13996#true} {13997#false} #81#return; {13997#false} is VALID [2018-11-23 12:16:21,860 INFO L273 TraceCheckUtils]: 185: Hoare triple {13997#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {13997#false} is VALID [2018-11-23 12:16:21,860 INFO L273 TraceCheckUtils]: 186: Hoare triple {13997#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13997#false} is VALID [2018-11-23 12:16:21,860 INFO L273 TraceCheckUtils]: 187: Hoare triple {13997#false} assume !false; {13997#false} is VALID [2018-11-23 12:16:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2018-11-23 12:16:21,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:21,873 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:16:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:22,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:22,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {13996#true} call ULTIMATE.init(); {13996#true} is VALID [2018-11-23 12:16:22,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {13996#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13996#true} is VALID [2018-11-23 12:16:22,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {13996#true} assume true; {13996#true} is VALID [2018-11-23 12:16:22,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13996#true} {13996#true} #73#return; {13996#true} is VALID [2018-11-23 12:16:22,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {13996#true} call #t~ret14 := main(); {13996#true} is VALID [2018-11-23 12:16:22,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {13996#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; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 21: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {13996#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {13996#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {13996#true} assume !(~i~1 < 10); {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L256 TraceCheckUtils]: 27: Hoare triple {13996#true} call #t~ret6 := max(~#x~0.base, ~#x~0.offset); {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {13996#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 35: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 46: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 51: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,413 INFO L273 TraceCheckUtils]: 52: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 53: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 54: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 55: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 63: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 65: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 67: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 68: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 69: Hoare triple {13996#true} assume !(~i~0 < 10); {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 70: Hoare triple {13996#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13996#true} is VALID [2018-11-23 12:16:22,415 INFO L273 TraceCheckUtils]: 71: Hoare triple {13996#true} assume true; {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13996#true} {13996#true} #77#return; {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 73: Hoare triple {13996#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L256 TraceCheckUtils]: 74: Hoare triple {13996#true} call #t~ret9 := max(~#x~0.base, ~#x~0.offset); {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 75: Hoare triple {13996#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 76: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 77: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 78: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 79: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 80: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,416 INFO L273 TraceCheckUtils]: 81: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 82: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 83: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 84: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 85: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 86: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 87: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 88: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 89: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 90: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,417 INFO L273 TraceCheckUtils]: 91: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 92: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 93: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 94: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 95: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 96: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 97: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 98: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 99: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,418 INFO L273 TraceCheckUtils]: 100: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 101: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 102: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 103: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 104: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 105: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 106: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 107: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 108: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 109: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,419 INFO L273 TraceCheckUtils]: 110: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 111: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 112: Hoare triple {13996#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 113: Hoare triple {13996#true} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 114: Hoare triple {13996#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 115: Hoare triple {13996#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 116: Hoare triple {13996#true} assume !(~i~0 < 10); {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 117: Hoare triple {13996#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L273 TraceCheckUtils]: 118: Hoare triple {13996#true} assume true; {13996#true} is VALID [2018-11-23 12:16:22,420 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {13996#true} {13996#true} #79#return; {13996#true} is VALID [2018-11-23 12:16:22,421 INFO L273 TraceCheckUtils]: 120: Hoare triple {13996#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {14370#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:22,422 INFO L273 TraceCheckUtils]: 121: Hoare triple {14370#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14370#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:22,422 INFO L273 TraceCheckUtils]: 122: Hoare triple {14370#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13999#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:22,424 INFO L273 TraceCheckUtils]: 123: Hoare triple {13999#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13999#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:22,424 INFO L273 TraceCheckUtils]: 124: Hoare triple {13999#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14000#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:22,426 INFO L273 TraceCheckUtils]: 125: Hoare triple {14000#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14000#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:22,426 INFO L273 TraceCheckUtils]: 126: Hoare triple {14000#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14001#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:22,428 INFO L273 TraceCheckUtils]: 127: Hoare triple {14001#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14001#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:22,428 INFO L273 TraceCheckUtils]: 128: Hoare triple {14001#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14002#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:22,430 INFO L273 TraceCheckUtils]: 129: Hoare triple {14002#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14002#(<= main_~i~2 4)} is VALID [2018-11-23 12:16:22,430 INFO L273 TraceCheckUtils]: 130: Hoare triple {14002#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14003#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:22,432 INFO L273 TraceCheckUtils]: 131: Hoare triple {14003#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14003#(<= main_~i~2 5)} is VALID [2018-11-23 12:16:22,432 INFO L273 TraceCheckUtils]: 132: Hoare triple {14003#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14004#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:22,434 INFO L273 TraceCheckUtils]: 133: Hoare triple {14004#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14004#(<= main_~i~2 6)} is VALID [2018-11-23 12:16:22,434 INFO L273 TraceCheckUtils]: 134: Hoare triple {14004#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14005#(<= main_~i~2 7)} is VALID [2018-11-23 12:16:22,436 INFO L273 TraceCheckUtils]: 135: Hoare triple {14005#(<= main_~i~2 7)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14005#(<= main_~i~2 7)} is VALID [2018-11-23 12:16:22,436 INFO L273 TraceCheckUtils]: 136: Hoare triple {14005#(<= main_~i~2 7)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14006#(<= main_~i~2 8)} is VALID [2018-11-23 12:16:22,438 INFO L273 TraceCheckUtils]: 137: Hoare triple {14006#(<= main_~i~2 8)} assume !(~i~2 < 9); {13997#false} is VALID [2018-11-23 12:16:22,438 INFO L273 TraceCheckUtils]: 138: Hoare triple {13997#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {13997#false} is VALID [2018-11-23 12:16:22,438 INFO L256 TraceCheckUtils]: 139: Hoare triple {13997#false} call #t~ret13 := max(~#x~0.base, ~#x~0.offset); {13997#false} is VALID [2018-11-23 12:16:22,438 INFO L273 TraceCheckUtils]: 140: Hoare triple {13997#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := 0;~i~0 := 0; {13997#false} is VALID [2018-11-23 12:16:22,438 INFO L273 TraceCheckUtils]: 141: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,438 INFO L273 TraceCheckUtils]: 142: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,438 INFO L273 TraceCheckUtils]: 143: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,438 INFO L273 TraceCheckUtils]: 144: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 145: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 146: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 147: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 148: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 149: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 150: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 151: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 152: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,439 INFO L273 TraceCheckUtils]: 153: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 154: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 155: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 156: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 157: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 158: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 159: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 160: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 161: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 162: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,440 INFO L273 TraceCheckUtils]: 163: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 164: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 165: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 166: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 167: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 168: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 169: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 170: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 171: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 172: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,441 INFO L273 TraceCheckUtils]: 173: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 174: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 175: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 176: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 177: Hoare triple {13997#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 178: Hoare triple {13997#false} assume ~ret~0 < #t~mem1;call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);#t~ite3 := #t~mem2; {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 179: Hoare triple {13997#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~mem2;havoc #t~ite3; {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 180: Hoare triple {13997#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 181: Hoare triple {13997#false} assume !(~i~0 < 10); {13997#false} is VALID [2018-11-23 12:16:22,442 INFO L273 TraceCheckUtils]: 182: Hoare triple {13997#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13997#false} is VALID [2018-11-23 12:16:22,443 INFO L273 TraceCheckUtils]: 183: Hoare triple {13997#false} assume true; {13997#false} is VALID [2018-11-23 12:16:22,443 INFO L268 TraceCheckUtils]: 184: Hoare quadruple {13997#false} {13997#false} #81#return; {13997#false} is VALID [2018-11-23 12:16:22,443 INFO L273 TraceCheckUtils]: 185: Hoare triple {13997#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {13997#false} is VALID [2018-11-23 12:16:22,443 INFO L273 TraceCheckUtils]: 186: Hoare triple {13997#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13997#false} is VALID [2018-11-23 12:16:22,443 INFO L273 TraceCheckUtils]: 187: Hoare triple {13997#false} assume !false; {13997#false} is VALID [2018-11-23 12:16:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 850 proven. 64 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2018-11-23 12:16:22,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:22,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:16:22,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2018-11-23 12:16:22,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:22,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:16:22,577 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:16:22,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:16:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:16:22,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:22,578 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 12 states. [2018-11-23 12:16:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:23,276 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2018-11-23 12:16:23,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:23,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2018-11-23 12:16:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2018-11-23 12:16:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2018-11-23 12:16:23,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2018-11-23 12:16:23,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:23,349 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:16:23,350 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:16:23,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:16:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-23 12:16:23,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:23,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2018-11-23 12:16:23,393 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-23 12:16:23,394 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-23 12:16:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:23,396 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2018-11-23 12:16:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-23 12:16:23,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:23,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:23,397 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-23 12:16:23,397 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-23 12:16:23,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:23,399 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2018-11-23 12:16:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-23 12:16:23,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:23,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:23,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:23,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 12:16:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-11-23 12:16:23,402 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 188 [2018-11-23 12:16:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:23,403 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-11-23 12:16:23,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:16:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-11-23 12:16:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 12:16:23,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:23,405 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 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:16:23,405 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:23,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1295753979, now seen corresponding path program 20 times [2018-11-23 12:16:23,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:24,624 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2018-11-23 12:16:25,124 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2018-11-23 12:16:26,343 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:16:26,348 INFO L168 Benchmark]: Toolchain (without parser) took 41463.54 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.4 GB in the end (delta: -973.7 MB). Peak memory consumption was 167.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:26,349 INFO L168 Benchmark]: CDTParser took 0.27 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:16:26,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.75 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:16:26,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.36 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:16:26,351 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 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:16:26,351 INFO L168 Benchmark]: RCFGBuilder took 890.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -733.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:26,352 INFO L168 Benchmark]: TraceAbstraction took 40106.40 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 432.5 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -250.9 MB). Peak memory consumption was 181.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:16:26,356 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.27 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 400.75 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 24.36 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 36.44 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 890.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -733.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40106.40 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 432.5 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -250.9 MB). Peak memory consumption was 181.6 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...