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/loop-acceleration/array_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:06:40,075 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:40,077 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:40,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:40,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:40,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:40,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:40,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:40,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:40,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:40,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:40,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:40,103 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:40,104 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:40,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:40,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:40,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:40,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:40,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:40,114 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:40,115 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:40,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:40,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:40,120 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:40,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:40,121 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:40,122 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:40,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:40,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:40,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:40,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:40,126 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:40,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:40,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:40,128 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:40,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:40,129 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 13:06:40,147 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:40,149 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:40,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:40,151 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:06:40,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:40,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:40,152 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:40,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:40,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:40,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:40,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:40,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:40,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:40,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:40,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:40,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:40,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:40,156 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:40,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:40,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:40,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:40,158 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:40,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:06:40,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:40,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:40,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:40,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:40,159 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:40,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:40,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:40,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:06:40,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:40,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:40,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:40,255 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:40,255 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:40,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i [2018-11-23 13:06:40,332 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c0e6a60/79cb8bde6b4b447bb9507334300fd521/FLAGed96b75c8 [2018-11-23 13:06:40,760 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:40,760 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i [2018-11-23 13:06:40,766 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c0e6a60/79cb8bde6b4b447bb9507334300fd521/FLAGed96b75c8 [2018-11-23 13:06:41,147 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c0e6a60/79cb8bde6b4b447bb9507334300fd521 [2018-11-23 13:06:41,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:41,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:41,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:41,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:41,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:41,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cdac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41, skipping insertion in model container [2018-11-23 13:06:41,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:41,207 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:41,425 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:41,429 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:41,453 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:41,480 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:41,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41 WrapperNode [2018-11-23 13:06:41,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:41,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:41,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:41,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:41,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:41,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:41,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:41,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:41,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (1/1) ... [2018-11-23 13:06:41,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:41,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:41,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:41,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:41,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (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 13:06:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:06:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:06:41,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:06:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:06:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:41,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:06:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:06:41,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:06:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:06:41,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:06:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:06:42,152 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:42,153 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:06:42,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:42 BoogieIcfgContainer [2018-11-23 13:06:42,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:42,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:06:42,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:06:42,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:06:42,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:41" (1/3) ... [2018-11-23 13:06:42,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77aa9415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:42, skipping insertion in model container [2018-11-23 13:06:42,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:41" (2/3) ... [2018-11-23 13:06:42,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77aa9415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:42, skipping insertion in model container [2018-11-23 13:06:42,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:42" (3/3) ... [2018-11-23 13:06:42,161 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call2_true-termination.i [2018-11-23 13:06:42,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:06:42,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:06:42,194 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:06:42,228 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:42,229 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:06:42,229 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:06:42,229 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:06:42,230 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:42,230 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:42,230 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:06:42,231 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:42,231 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:06:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:06:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:42,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:42,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:42,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:42,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2018-11-23 13:06:42,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:42,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:42,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:42,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:06:42,436 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24#true} is VALID [2018-11-23 13:06:42,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:06:42,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 13:06:42,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2018-11-23 13:06:42,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24#true} is VALID [2018-11-23 13:06:42,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:06:42,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {25#false} is VALID [2018-11-23 13:06:42,444 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {25#false} is VALID [2018-11-23 13:06:42,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:06:42,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:06:42,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:06:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:42,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:42,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:06:42,456 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:06:42,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:42,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:06:42,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:42,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:06:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:06:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:42,532 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:06:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:42,668 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:06:42,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:06:42,668 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:06:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:06:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:06:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 13:06:42,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 13:06:42,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:42,994 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:06:42,995 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:06:42,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:06:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:06:43,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:43,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:43,133 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:43,134 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:43,137 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:43,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:43,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:43,138 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:43,138 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:43,141 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:43,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:43,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:43,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:43,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:06:43,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:06:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:06:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:06:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:43,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:43,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:43,148 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:43,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2018-11-23 13:06:43,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:43,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:43,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:43,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:43,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {120#true} is VALID [2018-11-23 13:06:43,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {120#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {120#true} is VALID [2018-11-23 13:06:43,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2018-11-23 13:06:43,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #35#return; {120#true} is VALID [2018-11-23 13:06:43,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret4 := main(); {120#true} is VALID [2018-11-23 13:06:43,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {122#(= main_~i~0 0)} is VALID [2018-11-23 13:06:43,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {122#(= main_~i~0 0)} assume !(~i~0 < 2048); {121#false} is VALID [2018-11-23 13:06:43,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {121#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {121#false} is VALID [2018-11-23 13:06:43,286 INFO L256 TraceCheckUtils]: 8: Hoare triple {121#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {121#false} is VALID [2018-11-23 13:06:43,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {121#false} ~cond := #in~cond; {121#false} is VALID [2018-11-23 13:06:43,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {121#false} assume 0 == ~cond; {121#false} is VALID [2018-11-23 13:06:43,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {121#false} assume !false; {121#false} is VALID [2018-11-23 13:06:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:43,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:43,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:43,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:06:43,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:43,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:06:43,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:43,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:06:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:43,382 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-23 13:06:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:43,491 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:43,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 13:06:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:06:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:06:43,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 13:06:43,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:43,677 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:06:43,677 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:06:43,678 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 13:06:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:06:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:06:43,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:43,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:06:43,690 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:06:43,691 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:06:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:43,693 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:43,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:43,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:43,693 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:06:43,694 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:06:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:43,695 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:43,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:43,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:43,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:43,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:06:43,698 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 13:06:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:43,699 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:06:43,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:06:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:06:43,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:43,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:43,700 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:43,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2018-11-23 13:06:43,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:43,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:43,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:43,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:43,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:43,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:06:43,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:06:43,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:06:43,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:06:43,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret4 := main(); {212#true} is VALID [2018-11-23 13:06:43,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {214#(= main_~i~0 0)} is VALID [2018-11-23 13:06:43,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {214#(= main_~i~0 0)} is VALID [2018-11-23 13:06:43,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:43,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 2048); {213#false} is VALID [2018-11-23 13:06:43,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {213#false} is VALID [2018-11-23 13:06:43,817 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {213#false} is VALID [2018-11-23 13:06:43,817 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:06:43,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:06:43,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:06:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:43,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:43,821 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 13:06:43,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:43,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:44,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 13:06:44,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-23 13:06:44,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 13:06:44,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #35#return; {212#true} is VALID [2018-11-23 13:06:44,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret4 := main(); {212#true} is VALID [2018-11-23 13:06:44,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:44,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {234#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:44,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {215#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:44,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~i~0 1)} assume !(~i~0 < 2048); {213#false} is VALID [2018-11-23 13:06:44,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {213#false} is VALID [2018-11-23 13:06:44,070 INFO L256 TraceCheckUtils]: 10: Hoare triple {213#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {213#false} is VALID [2018-11-23 13:06:44,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-23 13:06:44,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-23 13:06:44,071 INFO L273 TraceCheckUtils]: 13: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 13:06:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:44,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:44,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:06:44,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:06:44,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:44,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:06:44,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:44,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:06:44,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:06:44,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:44,253 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:06:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:44,599 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:06:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:06:44,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:06:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:06:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:06:44,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2018-11-23 13:06:44,715 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 13:06:44,716 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:06:44,717 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:06:44,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 13:06:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:06:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:06:44,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:44,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-23 13:06:44,731 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-23 13:06:44,731 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-23 13:06:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:44,733 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:06:44,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:44,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:44,734 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-23 13:06:44,735 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-23 13:06:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:44,736 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:06:44,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:44,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:44,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:44,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:06:44,740 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 13:06:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:44,740 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:06:44,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:06:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:06:44,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:44,741 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:44,742 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:44,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1288728289, now seen corresponding path program 2 times [2018-11-23 13:06:44,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:44,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:06:44,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:06:44,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:06:44,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:06:44,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret4 := main(); {355#true} is VALID [2018-11-23 13:06:44,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {357#(= main_~i~0 0)} is VALID [2018-11-23 13:06:44,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {357#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {357#(= main_~i~0 0)} is VALID [2018-11-23 13:06:44,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {357#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:44,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:44,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:44,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 2048); {356#false} is VALID [2018-11-23 13:06:44,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {356#false} is VALID [2018-11-23 13:06:44,859 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {356#false} is VALID [2018-11-23 13:06:44,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:06:44,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:06:44,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:06:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:44,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:44,862 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 13:06:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:44,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:44,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:44,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:45,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {355#true} call ULTIMATE.init(); {355#true} is VALID [2018-11-23 13:06:45,012 INFO L273 TraceCheckUtils]: 1: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {355#true} is VALID [2018-11-23 13:06:45,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {355#true} assume true; {355#true} is VALID [2018-11-23 13:06:45,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} #35#return; {355#true} is VALID [2018-11-23 13:06:45,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {355#true} call #t~ret4 := main(); {355#true} is VALID [2018-11-23 13:06:45,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:45,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {378#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {378#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:45,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:45,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {358#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {358#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:45,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {359#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:45,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 2)} assume !(~i~0 < 2048); {356#false} is VALID [2018-11-23 13:06:45,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {356#false} is VALID [2018-11-23 13:06:45,022 INFO L256 TraceCheckUtils]: 12: Hoare triple {356#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {356#false} is VALID [2018-11-23 13:06:45,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {356#false} ~cond := #in~cond; {356#false} is VALID [2018-11-23 13:06:45,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {356#false} assume 0 == ~cond; {356#false} is VALID [2018-11-23 13:06:45,023 INFO L273 TraceCheckUtils]: 15: Hoare triple {356#false} assume !false; {356#false} is VALID [2018-11-23 13:06:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:45,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:45,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:06:45,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:06:45,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:45,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:06:45,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:45,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:06:45,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:06:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:45,109 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-23 13:06:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:45,276 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:06:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:06:45,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:06:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:06:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 13:06:45,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2018-11-23 13:06:45,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:45,337 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:06:45,337 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:06:45,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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 13:06:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:06:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 13:06:45,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:45,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 19 states. [2018-11-23 13:06:45,358 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 19 states. [2018-11-23 13:06:45,358 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 19 states. [2018-11-23 13:06:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:45,360 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:06:45,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:45,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:45,361 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 20 states. [2018-11-23 13:06:45,361 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 20 states. [2018-11-23 13:06:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:45,363 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:06:45,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:45,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:45,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:45,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:06:45,366 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-23 13:06:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:45,366 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:06:45,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:06:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:06:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:06:45,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:45,367 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:45,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:45,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash 676582787, now seen corresponding path program 3 times [2018-11-23 13:06:45,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:45,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:45,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:45,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:45,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:06:45,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:06:45,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:06:45,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:06:45,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret4 := main(); {515#true} is VALID [2018-11-23 13:06:45,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {517#(= main_~i~0 0)} is VALID [2018-11-23 13:06:45,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {517#(= main_~i~0 0)} is VALID [2018-11-23 13:06:45,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:45,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:45,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:45,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:45,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:45,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 3)} assume !(~i~0 < 2048); {516#false} is VALID [2018-11-23 13:06:45,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {516#false} is VALID [2018-11-23 13:06:45,714 INFO L256 TraceCheckUtils]: 14: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {516#false} is VALID [2018-11-23 13:06:45,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:06:45,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:06:45,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:06:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:45,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:45,716 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 13:06:45,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:45,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:06:45,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:45,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:45,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 13:06:45,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {515#true} is VALID [2018-11-23 13:06:45,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 13:06:45,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #35#return; {515#true} is VALID [2018-11-23 13:06:45,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret4 := main(); {515#true} is VALID [2018-11-23 13:06:45,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {539#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:45,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {539#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {539#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:45,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {539#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:45,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:45,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {518#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:45,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {519#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {519#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:45,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {519#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {520#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:45,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {520#(<= main_~i~0 3)} assume !(~i~0 < 2048); {516#false} is VALID [2018-11-23 13:06:45,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {516#false} is VALID [2018-11-23 13:06:45,867 INFO L256 TraceCheckUtils]: 14: Hoare triple {516#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {516#false} is VALID [2018-11-23 13:06:45,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2018-11-23 13:06:45,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2018-11-23 13:06:45,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 13:06:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:45,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:45,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:06:45,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:06:45,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:45,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:06:45,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:45,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:06:45,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:06:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:45,914 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-23 13:06:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:46,040 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:06:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:06:46,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-23 13:06:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:06:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:06:46,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2018-11-23 13:06:46,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:46,123 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:06:46,123 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:06:46,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:06:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:06:46,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:46,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:06:46,143 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:06:46,143 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:06:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:46,145 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:06:46,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:46,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:46,146 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:06:46,146 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:06:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:46,148 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:06:46,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:46,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:46,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:46,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:06:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:06:46,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-23 13:06:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:46,151 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:06:46,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:06:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:06:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:06:46,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:46,152 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:46,152 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:46,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 4 times [2018-11-23 13:06:46,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:46,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:46,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:46,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:46,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {692#true} is VALID [2018-11-23 13:06:46,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {692#true} is VALID [2018-11-23 13:06:46,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {692#true} assume true; {692#true} is VALID [2018-11-23 13:06:46,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} #35#return; {692#true} is VALID [2018-11-23 13:06:46,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {692#true} call #t~ret4 := main(); {692#true} is VALID [2018-11-23 13:06:46,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {692#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {694#(= main_~i~0 0)} is VALID [2018-11-23 13:06:46,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {694#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {694#(= main_~i~0 0)} is VALID [2018-11-23 13:06:46,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {694#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:46,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:46,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:46,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:46,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:46,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:46,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {698#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:46,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#(<= main_~i~0 4)} assume !(~i~0 < 2048); {693#false} is VALID [2018-11-23 13:06:46,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {693#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {693#false} is VALID [2018-11-23 13:06:46,310 INFO L256 TraceCheckUtils]: 16: Hoare triple {693#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {693#false} is VALID [2018-11-23 13:06:46,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {693#false} ~cond := #in~cond; {693#false} is VALID [2018-11-23 13:06:46,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {693#false} assume 0 == ~cond; {693#false} is VALID [2018-11-23 13:06:46,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {693#false} assume !false; {693#false} is VALID [2018-11-23 13:06:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:46,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:46,313 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 13:06:46,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:46,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:46,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:46,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:46,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {692#true} is VALID [2018-11-23 13:06:46,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {692#true} is VALID [2018-11-23 13:06:46,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {692#true} assume true; {692#true} is VALID [2018-11-23 13:06:46,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {692#true} {692#true} #35#return; {692#true} is VALID [2018-11-23 13:06:46,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {692#true} call #t~ret4 := main(); {692#true} is VALID [2018-11-23 13:06:46,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {692#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {717#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:46,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {717#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {717#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:46,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {717#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:46,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {695#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {695#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:46,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {695#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:46,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {696#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {696#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:46,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {696#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:46,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {697#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:46,531 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {698#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:46,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {698#(<= main_~i~0 4)} assume !(~i~0 < 2048); {693#false} is VALID [2018-11-23 13:06:46,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {693#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {693#false} is VALID [2018-11-23 13:06:46,533 INFO L256 TraceCheckUtils]: 16: Hoare triple {693#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {693#false} is VALID [2018-11-23 13:06:46,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {693#false} ~cond := #in~cond; {693#false} is VALID [2018-11-23 13:06:46,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {693#false} assume 0 == ~cond; {693#false} is VALID [2018-11-23 13:06:46,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {693#false} assume !false; {693#false} is VALID [2018-11-23 13:06:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:46,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:46,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:06:46,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:06:46,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:46,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:06:46,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:46,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:06:46,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:06:46,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:06:46,588 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-23 13:06:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:46,733 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:06:46,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:06:46,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:06:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:06:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:06:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:06:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-11-23 13:06:46,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2018-11-23 13:06:46,783 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 13:06:46,785 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:06:46,785 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:06:46,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:06:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:06:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 13:06:46,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:46,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 13:06:46,797 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 13:06:46,797 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 13:06:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:46,798 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:06:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:06:46,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:46,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:46,799 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 13:06:46,799 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 13:06:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:46,801 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:06:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:06:46,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:46,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:46,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:46,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:06:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:06:46,804 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-23 13:06:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:46,804 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:06:46,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:06:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:06:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:06:46,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:46,806 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:46,806 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:46,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash 954425671, now seen corresponding path program 5 times [2018-11-23 13:06:46,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:46,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:46,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:46,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:46,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:46,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {886#true} is VALID [2018-11-23 13:06:46,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {886#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {886#true} is VALID [2018-11-23 13:06:46,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2018-11-23 13:06:46,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #35#return; {886#true} is VALID [2018-11-23 13:06:46,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret4 := main(); {886#true} is VALID [2018-11-23 13:06:46,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {886#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {888#(= main_~i~0 0)} is VALID [2018-11-23 13:06:46,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {888#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {888#(= main_~i~0 0)} is VALID [2018-11-23 13:06:46,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {888#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:46,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:46,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {889#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:46,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:46,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {890#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:46,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {891#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:46,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {891#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:46,965 INFO L273 TraceCheckUtils]: 14: Hoare triple {892#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:46,966 INFO L273 TraceCheckUtils]: 15: Hoare triple {892#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {893#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:46,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#(<= main_~i~0 5)} assume !(~i~0 < 2048); {887#false} is VALID [2018-11-23 13:06:46,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {887#false} is VALID [2018-11-23 13:06:46,968 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {887#false} is VALID [2018-11-23 13:06:46,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {887#false} ~cond := #in~cond; {887#false} is VALID [2018-11-23 13:06:46,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {887#false} assume 0 == ~cond; {887#false} is VALID [2018-11-23 13:06:46,969 INFO L273 TraceCheckUtils]: 21: Hoare triple {887#false} assume !false; {887#false} is VALID [2018-11-23 13:06:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:46,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:46,971 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 13:06:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:47,022 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:06:47,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:47,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:47,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {886#true} call ULTIMATE.init(); {886#true} is VALID [2018-11-23 13:06:47,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {886#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {886#true} is VALID [2018-11-23 13:06:47,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2018-11-23 13:06:47,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #35#return; {886#true} is VALID [2018-11-23 13:06:47,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {886#true} call #t~ret4 := main(); {886#true} is VALID [2018-11-23 13:06:47,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {886#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {912#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:47,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {912#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {912#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:47,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {912#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:47,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {889#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {889#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:47,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {889#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:47,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {890#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:47,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {890#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:47,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {891#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {891#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:47,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {891#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:47,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {892#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {892#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:47,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {892#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {893#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:47,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {893#(<= main_~i~0 5)} assume !(~i~0 < 2048); {887#false} is VALID [2018-11-23 13:06:47,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {887#false} is VALID [2018-11-23 13:06:47,280 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {887#false} is VALID [2018-11-23 13:06:47,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {887#false} ~cond := #in~cond; {887#false} is VALID [2018-11-23 13:06:47,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {887#false} assume 0 == ~cond; {887#false} is VALID [2018-11-23 13:06:47,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {887#false} assume !false; {887#false} is VALID [2018-11-23 13:06:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:47,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:47,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:06:47,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:06:47,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:47,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:06:47,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:47,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:06:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:06:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:47,349 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-11-23 13:06:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,513 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:06:47,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:06:47,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-23 13:06:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-23 13:06:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-11-23 13:06:47,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2018-11-23 13:06:47,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:47,607 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:06:47,607 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:06:47,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:06:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:06:47,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:47,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 13:06:47,661 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 13:06:47,662 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 13:06:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,663 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:06:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:06:47,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:47,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:47,664 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 13:06:47,664 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 13:06:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:47,666 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:06:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:06:47,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:47,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:47,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:47,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:06:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:06:47,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-23 13:06:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:47,669 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:06:47,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:06:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:06:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:06:47,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:47,671 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:47,671 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:47,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1534314089, now seen corresponding path program 6 times [2018-11-23 13:06:47,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:47,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:47,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:47,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:47,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:47,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:06:47,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1097#true} is VALID [2018-11-23 13:06:47,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:06:47,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #35#return; {1097#true} is VALID [2018-11-23 13:06:47,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {1097#true} call #t~ret4 := main(); {1097#true} is VALID [2018-11-23 13:06:47,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1099#(= main_~i~0 0)} is VALID [2018-11-23 13:06:47,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {1099#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1099#(= main_~i~0 0)} is VALID [2018-11-23 13:06:47,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {1099#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:47,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:47,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:47,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:47,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:47,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:47,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:47,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {1103#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:47,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:47,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {1104#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:47,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {1104#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1105#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:47,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {1105#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1098#false} is VALID [2018-11-23 13:06:47,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1098#false} is VALID [2018-11-23 13:06:47,884 INFO L256 TraceCheckUtils]: 20: Hoare triple {1098#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:06:47,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:06:47,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:06:47,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:06:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:47,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:47,888 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 13:06:47,904 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:06:47,943 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:06:47,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:47,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-23 13:06:48,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1097#true} is VALID [2018-11-23 13:06:48,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-23 13:06:48,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #35#return; {1097#true} is VALID [2018-11-23 13:06:48,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {1097#true} call #t~ret4 := main(); {1097#true} is VALID [2018-11-23 13:06:48,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1124#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:48,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {1124#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1124#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:48,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {1124#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:48,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1100#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:48,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:48,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1101#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:48,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {1101#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:48,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {1102#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1102#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:48,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {1102#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:48,100 INFO L273 TraceCheckUtils]: 14: Hoare triple {1103#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1103#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:48,101 INFO L273 TraceCheckUtils]: 15: Hoare triple {1103#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:48,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {1104#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1104#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:48,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {1104#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1105#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:48,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {1105#(<= main_~i~0 6)} assume !(~i~0 < 2048); {1098#false} is VALID [2018-11-23 13:06:48,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {1098#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1098#false} is VALID [2018-11-23 13:06:48,104 INFO L256 TraceCheckUtils]: 20: Hoare triple {1098#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1098#false} is VALID [2018-11-23 13:06:48,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-23 13:06:48,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {1098#false} assume 0 == ~cond; {1098#false} is VALID [2018-11-23 13:06:48,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-23 13:06:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:48,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:48,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:06:48,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:06:48,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:48,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:06:48,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:48,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:06:48,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:06:48,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:06:48,187 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-11-23 13:06:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:48,344 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:06:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:06:48,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:06:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:06:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:06:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:06:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2018-11-23 13:06:48,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2018-11-23 13:06:48,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:48,478 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:06:48,478 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:06:48,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 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 13:06:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:06:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:06:48,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:48,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 13:06:48,531 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 13:06:48,531 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 13:06:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:48,533 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:06:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:06:48,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:48,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:48,534 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 13:06:48,534 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 13:06:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:48,536 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:06:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:06:48,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:48,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:48,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:48,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:06:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:06:48,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-23 13:06:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:48,539 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:06:48,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:06:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:06:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:06:48,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:48,540 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:48,541 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:48,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash 461335307, now seen corresponding path program 7 times [2018-11-23 13:06:48,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:48,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:48,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 13:06:48,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1325#true} is VALID [2018-11-23 13:06:48,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 13:06:48,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 13:06:48,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret4 := main(); {1325#true} is VALID [2018-11-23 13:06:48,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1327#(= main_~i~0 0)} is VALID [2018-11-23 13:06:48,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {1327#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1327#(= main_~i~0 0)} is VALID [2018-11-23 13:06:48,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {1327#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:48,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:48,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:48,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {1329#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:48,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {1329#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:48,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {1330#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:48,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {1330#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:48,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:48,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:48,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {1332#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:48,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {1332#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:48,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:48,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1334#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:48,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1326#false} is VALID [2018-11-23 13:06:48,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1326#false} is VALID [2018-11-23 13:06:48,727 INFO L256 TraceCheckUtils]: 22: Hoare triple {1326#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1326#false} is VALID [2018-11-23 13:06:48,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 13:06:48,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {1326#false} assume 0 == ~cond; {1326#false} is VALID [2018-11-23 13:06:48,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 13:06:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:48,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:48,730 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 13:06:48,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:49,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 13:06:49,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1325#true} is VALID [2018-11-23 13:06:49,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 13:06:49,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 13:06:49,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret4 := main(); {1325#true} is VALID [2018-11-23 13:06:49,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1353#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:49,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {1353#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1353#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:49,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {1353#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:49,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1328#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:49,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:49,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {1329#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1329#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:49,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {1329#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:49,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {1330#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1330#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:49,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {1330#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:49,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1331#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:49,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:49,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {1332#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:49,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {1332#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:49,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {1333#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:49,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {1333#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1334#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:49,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {1334#(<= main_~i~0 7)} assume !(~i~0 < 2048); {1326#false} is VALID [2018-11-23 13:06:49,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {1326#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1326#false} is VALID [2018-11-23 13:06:49,329 INFO L256 TraceCheckUtils]: 22: Hoare triple {1326#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1326#false} is VALID [2018-11-23 13:06:49,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 13:06:49,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {1326#false} assume 0 == ~cond; {1326#false} is VALID [2018-11-23 13:06:49,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 13:06:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:49,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:49,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:06:49,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 13:06:49,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:49,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:06:49,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:49,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:06:49,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:06:49,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:06:49,409 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-11-23 13:06:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:49,645 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:06:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:06:49,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 13:06:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:06:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2018-11-23 13:06:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:06:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2018-11-23 13:06:49,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2018-11-23 13:06:49,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:49,703 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:06:49,704 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:06:49,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:06:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:06:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:06:49,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:49,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 13:06:49,724 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 13:06:49,724 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 13:06:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:49,726 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:06:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:06:49,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:49,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:49,727 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 13:06:49,727 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 13:06:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:49,729 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:06:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:06:49,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:49,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:49,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:49,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:06:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:06:49,731 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-23 13:06:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:49,732 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:06:49,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:06:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:06:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:06:49,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:49,733 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:49,733 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:49,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:49,734 INFO L82 PathProgramCache]: Analyzing trace with hash 120876845, now seen corresponding path program 8 times [2018-11-23 13:06:49,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:49,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:49,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:49,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:49,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:49,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {1570#true} call ULTIMATE.init(); {1570#true} is VALID [2018-11-23 13:06:49,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {1570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1570#true} is VALID [2018-11-23 13:06:49,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {1570#true} assume true; {1570#true} is VALID [2018-11-23 13:06:49,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1570#true} {1570#true} #35#return; {1570#true} is VALID [2018-11-23 13:06:49,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {1570#true} call #t~ret4 := main(); {1570#true} is VALID [2018-11-23 13:06:49,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {1570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1572#(= main_~i~0 0)} is VALID [2018-11-23 13:06:49,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {1572#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1572#(= main_~i~0 0)} is VALID [2018-11-23 13:06:49,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {1572#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:49,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:49,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {1573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:49,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:49,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:49,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {1575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:49,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {1575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:49,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:49,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:49,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {1577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:49,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {1577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:49,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {1578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:49,946 INFO L273 TraceCheckUtils]: 19: Hoare triple {1578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:49,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:49,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {1579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1580#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:49,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#(<= main_~i~0 8)} assume !(~i~0 < 2048); {1571#false} is VALID [2018-11-23 13:06:49,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1571#false} is VALID [2018-11-23 13:06:49,949 INFO L256 TraceCheckUtils]: 24: Hoare triple {1571#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1571#false} is VALID [2018-11-23 13:06:49,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {1571#false} ~cond := #in~cond; {1571#false} is VALID [2018-11-23 13:06:49,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {1571#false} assume 0 == ~cond; {1571#false} is VALID [2018-11-23 13:06:49,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {1571#false} assume !false; {1571#false} is VALID [2018-11-23 13:06:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:49,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:49,952 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 13:06:49,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:50,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:50,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:50,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:50,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {1570#true} call ULTIMATE.init(); {1570#true} is VALID [2018-11-23 13:06:50,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {1570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1570#true} is VALID [2018-11-23 13:06:50,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {1570#true} assume true; {1570#true} is VALID [2018-11-23 13:06:50,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1570#true} {1570#true} #35#return; {1570#true} is VALID [2018-11-23 13:06:50,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {1570#true} call #t~ret4 := main(); {1570#true} is VALID [2018-11-23 13:06:50,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {1570#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1599#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:50,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {1599#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1599#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:50,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:50,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {1573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1573#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:50,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {1573#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:50,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1574#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:50,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:50,216 INFO L273 TraceCheckUtils]: 12: Hoare triple {1575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1575#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:50,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {1575#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:50,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {1576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1576#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:50,219 INFO L273 TraceCheckUtils]: 15: Hoare triple {1576#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:50,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {1577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1577#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:50,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {1577#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:50,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {1578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1578#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:50,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {1578#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:50,223 INFO L273 TraceCheckUtils]: 20: Hoare triple {1579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1579#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:50,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {1579#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1580#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:50,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#(<= main_~i~0 8)} assume !(~i~0 < 2048); {1571#false} is VALID [2018-11-23 13:06:50,225 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1571#false} is VALID [2018-11-23 13:06:50,225 INFO L256 TraceCheckUtils]: 24: Hoare triple {1571#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1571#false} is VALID [2018-11-23 13:06:50,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {1571#false} ~cond := #in~cond; {1571#false} is VALID [2018-11-23 13:06:50,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {1571#false} assume 0 == ~cond; {1571#false} is VALID [2018-11-23 13:06:50,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {1571#false} assume !false; {1571#false} is VALID [2018-11-23 13:06:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:50,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:50,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:06:50,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-23 13:06:50,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:50,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:06:50,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:50,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:06:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:06:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:06:50,282 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-11-23 13:06:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:50,595 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:06:50,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:06:50,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-23 13:06:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:06:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:06:50,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2018-11-23 13:06:50,676 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 13:06:50,677 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:06:50,677 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:06:50,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 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 13:06:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:06:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 13:06:50,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:50,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 13:06:50,690 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 13:06:50,690 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 13:06:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:50,692 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:06:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:06:50,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:50,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:50,693 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 13:06:50,693 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 13:06:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:50,694 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:06:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:06:50,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:50,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:50,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:50,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:06:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:06:50,696 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-11-23 13:06:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:50,696 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:06:50,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:06:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:06:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:06:50,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:50,697 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:50,698 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:50,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash -642190641, now seen corresponding path program 9 times [2018-11-23 13:06:50,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:50,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:50,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:50,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:50,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:50,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {1832#true} call ULTIMATE.init(); {1832#true} is VALID [2018-11-23 13:06:50,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {1832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1832#true} is VALID [2018-11-23 13:06:50,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {1832#true} assume true; {1832#true} is VALID [2018-11-23 13:06:50,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1832#true} {1832#true} #35#return; {1832#true} is VALID [2018-11-23 13:06:50,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {1832#true} call #t~ret4 := main(); {1832#true} is VALID [2018-11-23 13:06:50,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {1832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1834#(= main_~i~0 0)} is VALID [2018-11-23 13:06:50,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1834#(= main_~i~0 0)} is VALID [2018-11-23 13:06:50,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:50,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {1835#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:50,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {1835#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:50,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:50,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:50,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {1837#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:50,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {1837#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:50,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {1838#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:50,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {1838#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:50,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:50,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:50,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {1840#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:50,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {1840#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:50,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {1841#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:50,991 INFO L273 TraceCheckUtils]: 21: Hoare triple {1841#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:50,994 INFO L273 TraceCheckUtils]: 22: Hoare triple {1842#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:50,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {1842#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1843#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:51,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#(<= main_~i~0 9)} assume !(~i~0 < 2048); {1833#false} is VALID [2018-11-23 13:06:51,001 INFO L273 TraceCheckUtils]: 25: Hoare triple {1833#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1833#false} is VALID [2018-11-23 13:06:51,001 INFO L256 TraceCheckUtils]: 26: Hoare triple {1833#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1833#false} is VALID [2018-11-23 13:06:51,002 INFO L273 TraceCheckUtils]: 27: Hoare triple {1833#false} ~cond := #in~cond; {1833#false} is VALID [2018-11-23 13:06:51,002 INFO L273 TraceCheckUtils]: 28: Hoare triple {1833#false} assume 0 == ~cond; {1833#false} is VALID [2018-11-23 13:06:51,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2018-11-23 13:06:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:51,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:51,003 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 13:06:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:51,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:06:51,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:51,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:51,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {1832#true} call ULTIMATE.init(); {1832#true} is VALID [2018-11-23 13:06:51,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {1832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1832#true} is VALID [2018-11-23 13:06:51,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {1832#true} assume true; {1832#true} is VALID [2018-11-23 13:06:51,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1832#true} {1832#true} #35#return; {1832#true} is VALID [2018-11-23 13:06:51,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {1832#true} call #t~ret4 := main(); {1832#true} is VALID [2018-11-23 13:06:51,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {1832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1862#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:51,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {1862#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1862#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:51,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {1862#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:51,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {1835#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1835#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:51,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {1835#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:51,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {1836#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1836#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:51,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {1836#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:51,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {1837#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1837#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:51,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {1837#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:51,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {1838#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1838#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:51,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {1838#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:51,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {1839#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1839#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:51,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {1839#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:51,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {1840#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1840#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:51,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {1840#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:51,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {1841#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1841#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:51,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {1841#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:51,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {1842#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1842#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:51,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {1842#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1843#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:51,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#(<= main_~i~0 9)} assume !(~i~0 < 2048); {1833#false} is VALID [2018-11-23 13:06:51,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {1833#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1833#false} is VALID [2018-11-23 13:06:51,346 INFO L256 TraceCheckUtils]: 26: Hoare triple {1833#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1833#false} is VALID [2018-11-23 13:06:51,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {1833#false} ~cond := #in~cond; {1833#false} is VALID [2018-11-23 13:06:51,346 INFO L273 TraceCheckUtils]: 28: Hoare triple {1833#false} assume 0 == ~cond; {1833#false} is VALID [2018-11-23 13:06:51,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {1833#false} assume !false; {1833#false} is VALID [2018-11-23 13:06:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:51,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:51,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:06:51,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 13:06:51,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:51,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:06:51,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:51,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:06:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:06:51,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:06:51,403 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-11-23 13:06:51,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:51,539 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:06:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:06:51,539 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 13:06:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 13:06:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2018-11-23 13:06:51,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2018-11-23 13:06:51,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:51,703 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:06:51,703 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:06:51,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:06:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:06:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 13:06:51,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:51,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 13:06:51,738 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 13:06:51,738 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 13:06:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:51,739 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:06:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:06:51,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:51,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:51,740 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 13:06:51,740 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 13:06:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:51,741 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:06:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:06:51,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:51,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:51,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:51,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:06:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:06:51,743 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-11-23 13:06:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:51,744 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:06:51,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:06:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:06:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:06:51,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:51,745 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:51,745 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:51,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:51,746 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 10 times [2018-11-23 13:06:51,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:51,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:51,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:51,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:51,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:51,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 13:06:51,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 13:06:51,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 13:06:51,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #35#return; {2111#true} is VALID [2018-11-23 13:06:51,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret4 := main(); {2111#true} is VALID [2018-11-23 13:06:51,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2113#(= main_~i~0 0)} is VALID [2018-11-23 13:06:51,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {2113#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2113#(= main_~i~0 0)} is VALID [2018-11-23 13:06:51,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {2113#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:51,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {2114#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:51,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {2114#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:51,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {2115#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:51,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {2115#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:51,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {2116#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:51,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {2116#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:51,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {2117#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:51,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {2117#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:51,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {2118#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:51,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {2118#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:51,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:51,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:51,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {2120#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:51,926 INFO L273 TraceCheckUtils]: 21: Hoare triple {2120#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:51,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:51,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:51,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:51,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2123#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:51,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#(<= main_~i~0 10)} assume !(~i~0 < 2048); {2112#false} is VALID [2018-11-23 13:06:51,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {2112#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2112#false} is VALID [2018-11-23 13:06:51,930 INFO L256 TraceCheckUtils]: 28: Hoare triple {2112#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2112#false} is VALID [2018-11-23 13:06:51,930 INFO L273 TraceCheckUtils]: 29: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 13:06:51,930 INFO L273 TraceCheckUtils]: 30: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 13:06:51,930 INFO L273 TraceCheckUtils]: 31: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 13:06:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:51,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:51,932 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 13:06:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:51,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:51,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:51,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:52,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {2111#true} call ULTIMATE.init(); {2111#true} is VALID [2018-11-23 13:06:52,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {2111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2111#true} is VALID [2018-11-23 13:06:52,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {2111#true} assume true; {2111#true} is VALID [2018-11-23 13:06:52,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2111#true} {2111#true} #35#return; {2111#true} is VALID [2018-11-23 13:06:52,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {2111#true} call #t~ret4 := main(); {2111#true} is VALID [2018-11-23 13:06:52,159 INFO L273 TraceCheckUtils]: 5: Hoare triple {2111#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2142#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:52,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {2142#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2142#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:52,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {2142#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:52,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {2114#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2114#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:52,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {2114#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:52,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {2115#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2115#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:52,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {2115#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:52,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {2116#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2116#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:52,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {2116#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:52,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {2117#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2117#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:52,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {2117#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:52,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {2118#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2118#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:52,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {2118#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:52,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2119#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:52,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:52,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {2120#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2120#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:52,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {2120#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:52,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2121#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:52,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:52,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2122#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:52,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2123#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:52,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {2123#(<= main_~i~0 10)} assume !(~i~0 < 2048); {2112#false} is VALID [2018-11-23 13:06:52,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {2112#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2112#false} is VALID [2018-11-23 13:06:52,175 INFO L256 TraceCheckUtils]: 28: Hoare triple {2112#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2112#false} is VALID [2018-11-23 13:06:52,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {2112#false} ~cond := #in~cond; {2112#false} is VALID [2018-11-23 13:06:52,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {2112#false} assume 0 == ~cond; {2112#false} is VALID [2018-11-23 13:06:52,176 INFO L273 TraceCheckUtils]: 31: Hoare triple {2112#false} assume !false; {2112#false} is VALID [2018-11-23 13:06:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:52,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:52,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:06:52,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:06:52,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:52,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:06:52,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:52,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:06:52,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:06:52,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:06:52,272 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-11-23 13:06:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,646 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:06:52,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:06:52,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 13:06:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 13:06:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 13:06:52,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2018-11-23 13:06:52,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:52,715 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:06:52,715 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:06:52,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:06:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:06:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 13:06:52,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:52,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 13:06:52,735 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 13:06:52,735 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 13:06:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,736 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:06:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:06:52,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:52,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:52,737 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 13:06:52,737 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 13:06:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:52,738 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:06:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:06:52,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:52,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:52,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:52,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:06:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-23 13:06:52,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-11-23 13:06:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:52,739 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-23 13:06:52,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:06:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-23 13:06:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:06:52,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:52,740 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:52,741 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:52,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1285617811, now seen corresponding path program 11 times [2018-11-23 13:06:52,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:52,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:52,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:52,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2018-11-23 13:06:53,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2407#true} is VALID [2018-11-23 13:06:53,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2018-11-23 13:06:53,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #35#return; {2407#true} is VALID [2018-11-23 13:06:53,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret4 := main(); {2407#true} is VALID [2018-11-23 13:06:53,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2409#(= main_~i~0 0)} is VALID [2018-11-23 13:06:53,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {2409#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2409#(= main_~i~0 0)} is VALID [2018-11-23 13:06:53,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {2409#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:53,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {2410#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:53,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {2410#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:53,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:53,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {2411#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:53,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {2412#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:53,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {2412#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:53,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {2413#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:53,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:53,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {2414#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:53,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {2414#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:53,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {2415#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:53,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {2415#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:53,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {2416#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:53,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {2416#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:53,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:53,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {2417#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:53,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:53,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:53,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:53,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:53,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#(<= main_~i~0 11)} assume !(~i~0 < 2048); {2408#false} is VALID [2018-11-23 13:06:53,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {2408#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2408#false} is VALID [2018-11-23 13:06:53,037 INFO L256 TraceCheckUtils]: 30: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2408#false} is VALID [2018-11-23 13:06:53,037 INFO L273 TraceCheckUtils]: 31: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2018-11-23 13:06:53,037 INFO L273 TraceCheckUtils]: 32: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2018-11-23 13:06:53,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2018-11-23 13:06:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:53,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:53,040 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 13:06:53,048 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:53,095 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:06:53,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:53,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:53,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2018-11-23 13:06:53,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2407#true} is VALID [2018-11-23 13:06:53,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2018-11-23 13:06:53,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #35#return; {2407#true} is VALID [2018-11-23 13:06:53,301 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret4 := main(); {2407#true} is VALID [2018-11-23 13:06:53,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2439#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:53,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {2439#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2439#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:53,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {2439#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:53,305 INFO L273 TraceCheckUtils]: 8: Hoare triple {2410#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2410#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:53,305 INFO L273 TraceCheckUtils]: 9: Hoare triple {2410#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:53,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2411#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:53,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {2411#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:53,309 INFO L273 TraceCheckUtils]: 12: Hoare triple {2412#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:53,309 INFO L273 TraceCheckUtils]: 13: Hoare triple {2412#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:53,309 INFO L273 TraceCheckUtils]: 14: Hoare triple {2413#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2413#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:53,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {2413#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:53,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {2414#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2414#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:53,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {2414#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:53,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {2415#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2415#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:53,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {2415#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:53,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {2416#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2416#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:53,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {2416#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:53,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {2417#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2417#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:53,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {2417#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:53,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2418#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:53,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:53,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {2419#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2419#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:53,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {2419#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2420#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:53,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {2420#(<= main_~i~0 11)} assume !(~i~0 < 2048); {2408#false} is VALID [2018-11-23 13:06:53,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {2408#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2408#false} is VALID [2018-11-23 13:06:53,322 INFO L256 TraceCheckUtils]: 30: Hoare triple {2408#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2408#false} is VALID [2018-11-23 13:06:53,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2018-11-23 13:06:53,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2018-11-23 13:06:53,323 INFO L273 TraceCheckUtils]: 33: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2018-11-23 13:06:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:53,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:53,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:06:53,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:06:53,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:53,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:06:53,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:53,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:06:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:06:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:06:53,394 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-11-23 13:06:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,750 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:06:53,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:06:53,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:06:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2018-11-23 13:06:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2018-11-23 13:06:53,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2018-11-23 13:06:53,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:53,802 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:06:53,802 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:06:53,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:06:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:06:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:06:53,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:53,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 13:06:53,823 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 13:06:53,823 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 13:06:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,824 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:06:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:06:53,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,825 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 13:06:53,825 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 13:06:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:53,826 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:06:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:06:53,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:53,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:53,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:53,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:06:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-11-23 13:06:53,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-11-23 13:06:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:53,828 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-11-23 13:06:53,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:06:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-11-23 13:06:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:06:53,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:53,829 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:53,829 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:53,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1982380725, now seen corresponding path program 12 times [2018-11-23 13:06:53,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:53,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:53,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:53,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:54,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2018-11-23 13:06:54,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {2720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2720#true} is VALID [2018-11-23 13:06:54,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2018-11-23 13:06:54,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #35#return; {2720#true} is VALID [2018-11-23 13:06:54,565 INFO L256 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret4 := main(); {2720#true} is VALID [2018-11-23 13:06:54,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {2720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2722#(= main_~i~0 0)} is VALID [2018-11-23 13:06:54,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {2722#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2722#(= main_~i~0 0)} is VALID [2018-11-23 13:06:54,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {2722#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:54,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {2723#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:54,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {2723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:54,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:54,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:54,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {2725#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:54,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {2725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:54,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {2726#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:54,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {2726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:54,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {2727#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:54,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {2727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:54,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {2728#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:54,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {2728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:54,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:54,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {2729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:54,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:54,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:54,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:54,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:54,580 INFO L273 TraceCheckUtils]: 26: Hoare triple {2732#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:54,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:54,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {2733#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:54,582 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2734#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:54,582 INFO L273 TraceCheckUtils]: 30: Hoare triple {2734#(<= main_~i~0 12)} assume !(~i~0 < 2048); {2721#false} is VALID [2018-11-23 13:06:54,583 INFO L273 TraceCheckUtils]: 31: Hoare triple {2721#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2721#false} is VALID [2018-11-23 13:06:54,583 INFO L256 TraceCheckUtils]: 32: Hoare triple {2721#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2721#false} is VALID [2018-11-23 13:06:54,583 INFO L273 TraceCheckUtils]: 33: Hoare triple {2721#false} ~cond := #in~cond; {2721#false} is VALID [2018-11-23 13:06:54,583 INFO L273 TraceCheckUtils]: 34: Hoare triple {2721#false} assume 0 == ~cond; {2721#false} is VALID [2018-11-23 13:06:54,584 INFO L273 TraceCheckUtils]: 35: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2018-11-23 13:06:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:54,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:54,588 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 13:06:54,601 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:06:54,715 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:06:54,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:54,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:54,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {2720#true} call ULTIMATE.init(); {2720#true} is VALID [2018-11-23 13:06:54,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {2720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2720#true} is VALID [2018-11-23 13:06:54,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {2720#true} assume true; {2720#true} is VALID [2018-11-23 13:06:54,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2720#true} {2720#true} #35#return; {2720#true} is VALID [2018-11-23 13:06:54,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {2720#true} call #t~ret4 := main(); {2720#true} is VALID [2018-11-23 13:06:54,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {2720#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2753#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:54,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {2753#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2753#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:54,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {2753#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:54,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {2723#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2723#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:54,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {2723#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:54,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2724#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:54,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:54,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {2725#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2725#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:54,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {2725#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:54,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {2726#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2726#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:54,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {2726#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:54,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {2727#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2727#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:54,849 INFO L273 TraceCheckUtils]: 17: Hoare triple {2727#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:54,850 INFO L273 TraceCheckUtils]: 18: Hoare triple {2728#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2728#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:54,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {2728#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:54,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {2729#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2729#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:54,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {2729#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:54,852 INFO L273 TraceCheckUtils]: 22: Hoare triple {2730#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2730#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:54,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {2730#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:54,854 INFO L273 TraceCheckUtils]: 24: Hoare triple {2731#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2731#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:54,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {2731#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:54,855 INFO L273 TraceCheckUtils]: 26: Hoare triple {2732#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2732#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:54,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {2732#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:54,856 INFO L273 TraceCheckUtils]: 28: Hoare triple {2733#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2733#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:54,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2734#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:54,858 INFO L273 TraceCheckUtils]: 30: Hoare triple {2734#(<= main_~i~0 12)} assume !(~i~0 < 2048); {2721#false} is VALID [2018-11-23 13:06:54,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {2721#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2721#false} is VALID [2018-11-23 13:06:54,858 INFO L256 TraceCheckUtils]: 32: Hoare triple {2721#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2721#false} is VALID [2018-11-23 13:06:54,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {2721#false} ~cond := #in~cond; {2721#false} is VALID [2018-11-23 13:06:54,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {2721#false} assume 0 == ~cond; {2721#false} is VALID [2018-11-23 13:06:54,859 INFO L273 TraceCheckUtils]: 35: Hoare triple {2721#false} assume !false; {2721#false} is VALID [2018-11-23 13:06:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:54,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:54,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:06:54,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 13:06:54,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:54,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:06:54,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:54,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:06:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:06:54,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:06:54,923 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-11-23 13:06:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:55,151 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:06:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:06:55,151 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-23 13:06:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:06:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2018-11-23 13:06:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:06:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2018-11-23 13:06:55,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2018-11-23 13:06:55,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:55,254 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:06:55,254 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:06:55,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:06:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:06:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:06:55,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:55,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 13:06:55,270 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 13:06:55,271 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 13:06:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:55,271 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:06:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:06:55,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:55,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:55,272 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 13:06:55,272 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 13:06:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:55,273 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:06:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:06:55,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:55,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:55,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:55,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:06:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 13:06:55,275 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-11-23 13:06:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:55,275 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 13:06:55,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:06:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 13:06:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:06:55,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:55,276 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:55,276 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:55,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1556642903, now seen corresponding path program 13 times [2018-11-23 13:06:55,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:55,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:55,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:55,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:55,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 13:06:55,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3050#true} is VALID [2018-11-23 13:06:55,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 13:06:55,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #35#return; {3050#true} is VALID [2018-11-23 13:06:55,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret4 := main(); {3050#true} is VALID [2018-11-23 13:06:55,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3052#(= main_~i~0 0)} is VALID [2018-11-23 13:06:55,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {3052#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3052#(= main_~i~0 0)} is VALID [2018-11-23 13:06:55,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {3052#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:55,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {3053#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:55,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {3053#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:55,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {3054#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:55,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {3054#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:55,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:55,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {3055#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:55,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {3056#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:55,509 INFO L273 TraceCheckUtils]: 15: Hoare triple {3056#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:55,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {3057#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:55,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {3057#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:55,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {3058#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:55,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {3058#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:55,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:55,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {3059#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:55,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {3060#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:55,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {3060#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:55,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {3061#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:55,516 INFO L273 TraceCheckUtils]: 25: Hoare triple {3061#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:55,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:55,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {3062#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:55,518 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:55,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:55,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {3064#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:55,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {3064#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3065#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:55,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(<= main_~i~0 13)} assume !(~i~0 < 2048); {3051#false} is VALID [2018-11-23 13:06:55,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {3051#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3051#false} is VALID [2018-11-23 13:06:55,521 INFO L256 TraceCheckUtils]: 34: Hoare triple {3051#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3051#false} is VALID [2018-11-23 13:06:55,521 INFO L273 TraceCheckUtils]: 35: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2018-11-23 13:06:55,521 INFO L273 TraceCheckUtils]: 36: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 13:06:55,522 INFO L273 TraceCheckUtils]: 37: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 13:06:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:55,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:55,524 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 13:06:55,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:55,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:55,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 13:06:55,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3050#true} is VALID [2018-11-23 13:06:55,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 13:06:55,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #35#return; {3050#true} is VALID [2018-11-23 13:06:55,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret4 := main(); {3050#true} is VALID [2018-11-23 13:06:55,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3084#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:55,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {3084#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3084#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:55,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {3084#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:55,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {3053#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3053#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:55,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {3053#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:55,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {3054#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3054#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:55,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {3054#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:55,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {3055#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3055#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:55,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {3055#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:55,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {3056#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3056#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:55,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {3056#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:55,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {3057#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3057#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:55,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {3057#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:55,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {3058#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3058#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:55,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {3058#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:55,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {3059#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3059#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:55,733 INFO L273 TraceCheckUtils]: 21: Hoare triple {3059#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:55,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {3060#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3060#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:55,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {3060#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:55,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {3061#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3061#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:55,736 INFO L273 TraceCheckUtils]: 25: Hoare triple {3061#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:55,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3062#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:55,737 INFO L273 TraceCheckUtils]: 27: Hoare triple {3062#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:55,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3063#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:55,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:55,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {3064#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3064#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:55,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {3064#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3065#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:55,741 INFO L273 TraceCheckUtils]: 32: Hoare triple {3065#(<= main_~i~0 13)} assume !(~i~0 < 2048); {3051#false} is VALID [2018-11-23 13:06:55,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {3051#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3051#false} is VALID [2018-11-23 13:06:55,741 INFO L256 TraceCheckUtils]: 34: Hoare triple {3051#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3051#false} is VALID [2018-11-23 13:06:55,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {3051#false} ~cond := #in~cond; {3051#false} is VALID [2018-11-23 13:06:55,742 INFO L273 TraceCheckUtils]: 36: Hoare triple {3051#false} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 13:06:55,742 INFO L273 TraceCheckUtils]: 37: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 13:06:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:55,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:55,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:06:55,766 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:06:55,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:55,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:06:55,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:55,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:06:55,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:06:55,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:06:55,814 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-11-23 13:06:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:56,127 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:06:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:06:56,127 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:06:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2018-11-23 13:06:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2018-11-23 13:06:56,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 48 transitions. [2018-11-23 13:06:56,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:56,184 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:06:56,185 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:06:56,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:06:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:06:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 13:06:56,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:56,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 13:06:56,213 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 13:06:56,213 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 13:06:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:56,214 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:06:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:06:56,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:56,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:56,215 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 13:06:56,215 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 13:06:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:56,216 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 13:06:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-23 13:06:56,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:56,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:56,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:56,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:06:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-23 13:06:56,218 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-11-23 13:06:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:56,218 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-23 13:06:56,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:06:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 13:06:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:06:56,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:56,219 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:56,219 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:56,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 444489081, now seen corresponding path program 14 times [2018-11-23 13:06:56,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:56,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:56,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:56,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:56,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:56,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2018-11-23 13:06:56,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3397#true} is VALID [2018-11-23 13:06:56,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2018-11-23 13:06:56,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #35#return; {3397#true} is VALID [2018-11-23 13:06:56,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret4 := main(); {3397#true} is VALID [2018-11-23 13:06:56,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {3397#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3399#(= main_~i~0 0)} is VALID [2018-11-23 13:06:56,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {3399#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3399#(= main_~i~0 0)} is VALID [2018-11-23 13:06:56,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {3399#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:56,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {3400#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:56,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {3400#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:56,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {3401#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:56,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {3401#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:56,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {3402#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:56,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {3402#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:56,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:56,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:56,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {3404#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:56,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:56,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:56,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:56,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {3406#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:56,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {3406#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:56,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {3407#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:56,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {3407#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:56,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {3408#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:56,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {3408#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:56,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:56,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:56,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {3410#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:56,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {3410#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:56,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {3411#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:56,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {3411#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:56,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {3412#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:56,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {3412#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3413#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:56,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(<= main_~i~0 14)} assume !(~i~0 < 2048); {3398#false} is VALID [2018-11-23 13:06:56,638 INFO L273 TraceCheckUtils]: 35: Hoare triple {3398#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3398#false} is VALID [2018-11-23 13:06:56,639 INFO L256 TraceCheckUtils]: 36: Hoare triple {3398#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3398#false} is VALID [2018-11-23 13:06:56,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2018-11-23 13:06:56,639 INFO L273 TraceCheckUtils]: 38: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2018-11-23 13:06:56,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2018-11-23 13:06:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:56,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:56,643 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 13:06:56,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:56,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:56,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:56,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:56,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2018-11-23 13:06:56,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {3397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3397#true} is VALID [2018-11-23 13:06:56,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2018-11-23 13:06:56,925 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #35#return; {3397#true} is VALID [2018-11-23 13:06:56,925 INFO L256 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret4 := main(); {3397#true} is VALID [2018-11-23 13:06:56,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {3397#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3432#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:56,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {3432#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3432#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:56,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {3432#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:56,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {3400#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3400#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:56,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {3400#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:56,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {3401#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3401#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:56,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {3401#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:56,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {3402#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3402#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:56,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {3402#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:56,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {3403#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3403#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:56,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {3403#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:56,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {3404#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3404#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:56,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {3404#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:56,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3405#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:56,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:56,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {3406#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3406#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:56,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {3406#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:56,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {3407#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3407#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:56,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {3407#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:56,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {3408#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3408#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:56,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {3408#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:56,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3409#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:56,941 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:56,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {3410#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3410#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:56,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {3410#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:56,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {3411#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3411#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:56,944 INFO L273 TraceCheckUtils]: 31: Hoare triple {3411#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:56,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {3412#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3412#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:56,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {3412#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3413#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:56,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {3413#(<= main_~i~0 14)} assume !(~i~0 < 2048); {3398#false} is VALID [2018-11-23 13:06:56,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {3398#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3398#false} is VALID [2018-11-23 13:06:56,946 INFO L256 TraceCheckUtils]: 36: Hoare triple {3398#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3398#false} is VALID [2018-11-23 13:06:56,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {3398#false} ~cond := #in~cond; {3398#false} is VALID [2018-11-23 13:06:56,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {3398#false} assume 0 == ~cond; {3398#false} is VALID [2018-11-23 13:06:56,947 INFO L273 TraceCheckUtils]: 39: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2018-11-23 13:06:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:56,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:56,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:06:56,980 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 13:06:56,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:56,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:06:57,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:06:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:06:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:06:57,083 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-11-23 13:06:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,508 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:06:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:06:57,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-11-23 13:06:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:06:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2018-11-23 13:06:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:06:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 50 transitions. [2018-11-23 13:06:57,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 50 transitions. [2018-11-23 13:06:57,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:57,880 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:06:57,881 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:06:57,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:06:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:06:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 13:06:57,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:57,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 13:06:57,898 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 13:06:57,898 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 13:06:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,900 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:06:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:06:57,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:57,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:57,901 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 13:06:57,901 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 13:06:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,902 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-11-23 13:06:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 13:06:57,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:57,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:57,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:57,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:06:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-11-23 13:06:57,904 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-11-23 13:06:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:57,904 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-11-23 13:06:57,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:06:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-11-23 13:06:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:06:57,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:57,905 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:57,906 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:57,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:57,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1111522843, now seen corresponding path program 15 times [2018-11-23 13:06:57,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:57,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:57,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:57,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:57,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:58,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {3761#true} call ULTIMATE.init(); {3761#true} is VALID [2018-11-23 13:06:58,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {3761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3761#true} is VALID [2018-11-23 13:06:58,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {3761#true} assume true; {3761#true} is VALID [2018-11-23 13:06:58,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3761#true} {3761#true} #35#return; {3761#true} is VALID [2018-11-23 13:06:58,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {3761#true} call #t~ret4 := main(); {3761#true} is VALID [2018-11-23 13:06:58,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {3761#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3763#(= main_~i~0 0)} is VALID [2018-11-23 13:06:58,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {3763#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3763#(= main_~i~0 0)} is VALID [2018-11-23 13:06:58,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {3763#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:58,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:58,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {3764#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:58,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {3765#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:58,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {3765#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:58,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:58,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:58,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {3767#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:58,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {3767#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:58,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:58,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:58,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {3769#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:58,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {3769#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:58,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {3770#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:58,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {3770#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:58,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {3771#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:58,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {3771#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:58,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {3772#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:58,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {3772#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:58,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {3773#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:58,281 INFO L273 TraceCheckUtils]: 27: Hoare triple {3773#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:58,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {3774#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:58,282 INFO L273 TraceCheckUtils]: 29: Hoare triple {3774#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:58,282 INFO L273 TraceCheckUtils]: 30: Hoare triple {3775#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:58,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {3775#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:58,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {3776#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:58,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {3776#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:58,288 INFO L273 TraceCheckUtils]: 34: Hoare triple {3777#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:58,288 INFO L273 TraceCheckUtils]: 35: Hoare triple {3777#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:58,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {3778#(<= main_~i~0 15)} assume !(~i~0 < 2048); {3762#false} is VALID [2018-11-23 13:06:58,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {3762#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3762#false} is VALID [2018-11-23 13:06:58,291 INFO L256 TraceCheckUtils]: 38: Hoare triple {3762#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3762#false} is VALID [2018-11-23 13:06:58,291 INFO L273 TraceCheckUtils]: 39: Hoare triple {3762#false} ~cond := #in~cond; {3762#false} is VALID [2018-11-23 13:06:58,291 INFO L273 TraceCheckUtils]: 40: Hoare triple {3762#false} assume 0 == ~cond; {3762#false} is VALID [2018-11-23 13:06:58,291 INFO L273 TraceCheckUtils]: 41: Hoare triple {3762#false} assume !false; {3762#false} is VALID [2018-11-23 13:06:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:58,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:58,293 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 13:06:58,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:58,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 13:06:58,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:58,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:58,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {3761#true} call ULTIMATE.init(); {3761#true} is VALID [2018-11-23 13:06:58,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {3761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3761#true} is VALID [2018-11-23 13:06:58,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {3761#true} assume true; {3761#true} is VALID [2018-11-23 13:06:58,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3761#true} {3761#true} #35#return; {3761#true} is VALID [2018-11-23 13:06:58,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {3761#true} call #t~ret4 := main(); {3761#true} is VALID [2018-11-23 13:06:58,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {3761#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3797#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:58,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {3797#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3797#(<= main_~i~0 0)} is VALID [2018-11-23 13:06:58,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {3797#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:58,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3764#(<= main_~i~0 1)} is VALID [2018-11-23 13:06:58,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {3764#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:58,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {3765#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3765#(<= main_~i~0 2)} is VALID [2018-11-23 13:06:58,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {3765#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:58,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {3766#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3766#(<= main_~i~0 3)} is VALID [2018-11-23 13:06:58,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {3766#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:58,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {3767#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3767#(<= main_~i~0 4)} is VALID [2018-11-23 13:06:58,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {3767#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:58,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {3768#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3768#(<= main_~i~0 5)} is VALID [2018-11-23 13:06:58,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {3768#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:58,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {3769#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3769#(<= main_~i~0 6)} is VALID [2018-11-23 13:06:58,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {3769#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:58,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {3770#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3770#(<= main_~i~0 7)} is VALID [2018-11-23 13:06:58,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {3770#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:58,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {3771#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3771#(<= main_~i~0 8)} is VALID [2018-11-23 13:06:58,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {3771#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:58,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {3772#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3772#(<= main_~i~0 9)} is VALID [2018-11-23 13:06:58,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {3772#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:58,794 INFO L273 TraceCheckUtils]: 26: Hoare triple {3773#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3773#(<= main_~i~0 10)} is VALID [2018-11-23 13:06:58,795 INFO L273 TraceCheckUtils]: 27: Hoare triple {3773#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:58,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {3774#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3774#(<= main_~i~0 11)} is VALID [2018-11-23 13:06:58,796 INFO L273 TraceCheckUtils]: 29: Hoare triple {3774#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:58,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {3775#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3775#(<= main_~i~0 12)} is VALID [2018-11-23 13:06:58,798 INFO L273 TraceCheckUtils]: 31: Hoare triple {3775#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:58,798 INFO L273 TraceCheckUtils]: 32: Hoare triple {3776#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3776#(<= main_~i~0 13)} is VALID [2018-11-23 13:06:58,799 INFO L273 TraceCheckUtils]: 33: Hoare triple {3776#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:58,800 INFO L273 TraceCheckUtils]: 34: Hoare triple {3777#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3777#(<= main_~i~0 14)} is VALID [2018-11-23 13:06:58,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {3777#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3778#(<= main_~i~0 15)} is VALID [2018-11-23 13:06:58,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {3778#(<= main_~i~0 15)} assume !(~i~0 < 2048); {3762#false} is VALID [2018-11-23 13:06:58,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {3762#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3762#false} is VALID [2018-11-23 13:06:58,802 INFO L256 TraceCheckUtils]: 38: Hoare triple {3762#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3762#false} is VALID [2018-11-23 13:06:58,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {3762#false} ~cond := #in~cond; {3762#false} is VALID [2018-11-23 13:06:58,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {3762#false} assume 0 == ~cond; {3762#false} is VALID [2018-11-23 13:06:58,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {3762#false} assume !false; {3762#false} is VALID [2018-11-23 13:06:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:06:58,824 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-23 13:06:58,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:58,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:06:58,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:58,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:06:58,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:06:58,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:06:58,871 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-11-23 13:06:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,016 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:06:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:06:59,016 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-11-23 13:06:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:06:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2018-11-23 13:06:59,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2018-11-23 13:06:59,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:59,576 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:06:59,576 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:06:59,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:06:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:06:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 13:06:59,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:59,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 13:06:59,597 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 13:06:59,597 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 13:06:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,598 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:06:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:06:59,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,599 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 13:06:59,599 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 13:06:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,600 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 13:06:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 13:06:59,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:59,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:06:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-11-23 13:06:59,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-11-23 13:06:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:59,602 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-11-23 13:06:59,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:06:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-11-23 13:06:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:06:59,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:59,603 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:59,603 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:59,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:59,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2114126275, now seen corresponding path program 16 times [2018-11-23 13:06:59,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:59,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:59,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:59,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:00,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2018-11-23 13:07:00,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {4142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4142#true} is VALID [2018-11-23 13:07:00,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2018-11-23 13:07:00,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #35#return; {4142#true} is VALID [2018-11-23 13:07:00,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret4 := main(); {4142#true} is VALID [2018-11-23 13:07:00,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {4142#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4144#(= main_~i~0 0)} is VALID [2018-11-23 13:07:00,507 INFO L273 TraceCheckUtils]: 6: Hoare triple {4144#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4144#(= main_~i~0 0)} is VALID [2018-11-23 13:07:00,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {4144#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:00,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {4145#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:00,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {4145#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:00,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {4146#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:00,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {4146#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:00,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {4147#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:00,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {4147#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:00,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {4148#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:00,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {4148#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:00,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {4149#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:00,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {4149#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:00,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {4150#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:00,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {4150#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:00,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {4151#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:00,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {4151#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:00,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {4152#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:00,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {4152#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:00,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {4153#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:00,520 INFO L273 TraceCheckUtils]: 25: Hoare triple {4153#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:00,520 INFO L273 TraceCheckUtils]: 26: Hoare triple {4154#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:00,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {4154#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:00,522 INFO L273 TraceCheckUtils]: 28: Hoare triple {4155#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:00,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {4155#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:00,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {4156#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:00,524 INFO L273 TraceCheckUtils]: 31: Hoare triple {4156#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:00,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {4157#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:00,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {4157#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:00,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {4158#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:00,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {4158#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:00,527 INFO L273 TraceCheckUtils]: 36: Hoare triple {4159#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:00,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {4159#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4160#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:00,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {4160#(<= main_~i~0 16)} assume !(~i~0 < 2048); {4143#false} is VALID [2018-11-23 13:07:00,528 INFO L273 TraceCheckUtils]: 39: Hoare triple {4143#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4143#false} is VALID [2018-11-23 13:07:00,528 INFO L256 TraceCheckUtils]: 40: Hoare triple {4143#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4143#false} is VALID [2018-11-23 13:07:00,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {4143#false} ~cond := #in~cond; {4143#false} is VALID [2018-11-23 13:07:00,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {4143#false} assume 0 == ~cond; {4143#false} is VALID [2018-11-23 13:07:00,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2018-11-23 13:07:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:00,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:00,532 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 13:07:00,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:00,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:00,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:00,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:00,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {4142#true} call ULTIMATE.init(); {4142#true} is VALID [2018-11-23 13:07:00,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {4142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4142#true} is VALID [2018-11-23 13:07:00,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {4142#true} assume true; {4142#true} is VALID [2018-11-23 13:07:00,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4142#true} {4142#true} #35#return; {4142#true} is VALID [2018-11-23 13:07:00,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {4142#true} call #t~ret4 := main(); {4142#true} is VALID [2018-11-23 13:07:00,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {4142#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4179#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:00,776 INFO L273 TraceCheckUtils]: 6: Hoare triple {4179#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4179#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:00,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {4179#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:00,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {4145#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4145#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:00,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {4145#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:00,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {4146#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4146#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:00,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {4146#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:00,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {4147#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4147#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:00,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {4147#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:00,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {4148#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4148#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:00,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {4148#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:00,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {4149#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4149#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:00,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {4149#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:00,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {4150#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4150#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:00,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {4150#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:00,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {4151#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4151#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:00,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {4151#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:00,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {4152#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4152#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:00,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {4152#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:00,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {4153#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4153#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:00,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {4153#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:00,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {4154#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4154#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:00,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {4154#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:00,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {4155#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4155#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:00,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {4155#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:00,791 INFO L273 TraceCheckUtils]: 30: Hoare triple {4156#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4156#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:00,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {4156#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:00,792 INFO L273 TraceCheckUtils]: 32: Hoare triple {4157#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4157#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:00,793 INFO L273 TraceCheckUtils]: 33: Hoare triple {4157#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:00,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {4158#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4158#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:00,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {4158#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:00,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {4159#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4159#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:00,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {4159#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4160#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:00,796 INFO L273 TraceCheckUtils]: 38: Hoare triple {4160#(<= main_~i~0 16)} assume !(~i~0 < 2048); {4143#false} is VALID [2018-11-23 13:07:00,797 INFO L273 TraceCheckUtils]: 39: Hoare triple {4143#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4143#false} is VALID [2018-11-23 13:07:00,797 INFO L256 TraceCheckUtils]: 40: Hoare triple {4143#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4143#false} is VALID [2018-11-23 13:07:00,797 INFO L273 TraceCheckUtils]: 41: Hoare triple {4143#false} ~cond := #in~cond; {4143#false} is VALID [2018-11-23 13:07:00,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {4143#false} assume 0 == ~cond; {4143#false} is VALID [2018-11-23 13:07:00,798 INFO L273 TraceCheckUtils]: 43: Hoare triple {4143#false} assume !false; {4143#false} is VALID [2018-11-23 13:07:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:00,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:00,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:07:00,819 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-23 13:07:00,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:00,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:07:00,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:00,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:07:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:07:00,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:07:00,866 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-11-23 13:07:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:01,007 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:07:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:07:01,008 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-11-23 13:07:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:07:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2018-11-23 13:07:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:07:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2018-11-23 13:07:01,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 54 transitions. [2018-11-23 13:07:01,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:01,506 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:07:01,507 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:07:01,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:07:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:07:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 13:07:01,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:01,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 13:07:01,529 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 13:07:01,529 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 13:07:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:01,532 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:07:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:07:01,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:01,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:01,532 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 13:07:01,532 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 13:07:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:01,533 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 13:07:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-23 13:07:01,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:01,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:01,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:01,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:07:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-23 13:07:01,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-11-23 13:07:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:01,535 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-23 13:07:01,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:07:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-23 13:07:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:07:01,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:01,536 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:01,536 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:01,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash -996540961, now seen corresponding path program 17 times [2018-11-23 13:07:01,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:01,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:01,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {4540#true} call ULTIMATE.init(); {4540#true} is VALID [2018-11-23 13:07:01,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {4540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4540#true} is VALID [2018-11-23 13:07:01,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {4540#true} assume true; {4540#true} is VALID [2018-11-23 13:07:01,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4540#true} {4540#true} #35#return; {4540#true} is VALID [2018-11-23 13:07:01,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {4540#true} call #t~ret4 := main(); {4540#true} is VALID [2018-11-23 13:07:01,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {4540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4542#(= main_~i~0 0)} is VALID [2018-11-23 13:07:01,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {4542#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4542#(= main_~i~0 0)} is VALID [2018-11-23 13:07:01,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {4542#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:01,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {4543#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:01,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {4543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:01,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:01,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {4544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:01,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {4545#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:01,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {4545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:01,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {4546#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:01,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {4546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:01,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {4547#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:01,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {4547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:01,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {4548#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:01,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {4548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:01,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {4549#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:01,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {4549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:01,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {4550#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:01,819 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:01,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:01,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {4551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:01,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {4552#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:01,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {4552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:01,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {4553#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:01,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {4553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:01,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {4554#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:01,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {4554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:01,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {4555#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:01,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {4555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:01,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {4556#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:01,827 INFO L273 TraceCheckUtils]: 35: Hoare triple {4556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:01,828 INFO L273 TraceCheckUtils]: 36: Hoare triple {4557#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:01,828 INFO L273 TraceCheckUtils]: 37: Hoare triple {4557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:01,829 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:01,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4559#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:01,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {4559#(<= main_~i~0 17)} assume !(~i~0 < 2048); {4541#false} is VALID [2018-11-23 13:07:01,831 INFO L273 TraceCheckUtils]: 41: Hoare triple {4541#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4541#false} is VALID [2018-11-23 13:07:01,831 INFO L256 TraceCheckUtils]: 42: Hoare triple {4541#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4541#false} is VALID [2018-11-23 13:07:01,831 INFO L273 TraceCheckUtils]: 43: Hoare triple {4541#false} ~cond := #in~cond; {4541#false} is VALID [2018-11-23 13:07:01,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {4541#false} assume 0 == ~cond; {4541#false} is VALID [2018-11-23 13:07:01,831 INFO L273 TraceCheckUtils]: 45: Hoare triple {4541#false} assume !false; {4541#false} is VALID [2018-11-23 13:07:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:01,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:01,834 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 13:07:01,844 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:01,979 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 13:07:01,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:02,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {4540#true} call ULTIMATE.init(); {4540#true} is VALID [2018-11-23 13:07:02,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {4540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4540#true} is VALID [2018-11-23 13:07:02,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {4540#true} assume true; {4540#true} is VALID [2018-11-23 13:07:02,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4540#true} {4540#true} #35#return; {4540#true} is VALID [2018-11-23 13:07:02,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {4540#true} call #t~ret4 := main(); {4540#true} is VALID [2018-11-23 13:07:02,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {4540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4578#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:02,201 INFO L273 TraceCheckUtils]: 6: Hoare triple {4578#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4578#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:02,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {4578#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:02,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {4543#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4543#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:02,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {4543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:02,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {4544#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4544#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:02,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {4544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:02,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {4545#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4545#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:02,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {4545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:02,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {4546#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4546#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:02,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {4546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:02,206 INFO L273 TraceCheckUtils]: 16: Hoare triple {4547#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4547#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:02,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {4547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:02,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {4548#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4548#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:02,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {4548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:02,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {4549#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4549#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:02,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {4549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:02,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {4550#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4550#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:02,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {4550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:02,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {4551#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4551#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:02,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {4551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:02,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {4552#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4552#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:02,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {4552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:02,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {4553#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4553#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:02,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {4553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:02,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {4554#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4554#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:02,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {4554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:02,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {4555#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4555#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:02,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {4555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:02,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {4556#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4556#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:02,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {4556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:02,219 INFO L273 TraceCheckUtils]: 36: Hoare triple {4557#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4557#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:02,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {4557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:02,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {4558#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4558#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:02,221 INFO L273 TraceCheckUtils]: 39: Hoare triple {4558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4559#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:02,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {4559#(<= main_~i~0 17)} assume !(~i~0 < 2048); {4541#false} is VALID [2018-11-23 13:07:02,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {4541#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4541#false} is VALID [2018-11-23 13:07:02,222 INFO L256 TraceCheckUtils]: 42: Hoare triple {4541#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4541#false} is VALID [2018-11-23 13:07:02,222 INFO L273 TraceCheckUtils]: 43: Hoare triple {4541#false} ~cond := #in~cond; {4541#false} is VALID [2018-11-23 13:07:02,223 INFO L273 TraceCheckUtils]: 44: Hoare triple {4541#false} assume 0 == ~cond; {4541#false} is VALID [2018-11-23 13:07:02,223 INFO L273 TraceCheckUtils]: 45: Hoare triple {4541#false} assume !false; {4541#false} is VALID [2018-11-23 13:07:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:02,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:07:02,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-23 13:07:02,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:02,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:07:02,295 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 13:07:02,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:07:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:07:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:07:02,296 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-11-23 13:07:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,616 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:07:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:07:02,616 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-23 13:07:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-11-23 13:07:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2018-11-23 13:07:02,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 56 transitions. [2018-11-23 13:07:02,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:02,697 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:07:02,697 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:07:02,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:07:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:07:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 13:07:02,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:02,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 13:07:02,787 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 13:07:02,788 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 13:07:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,789 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:07:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:07:02,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,790 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 13:07:02,790 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 13:07:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,791 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 13:07:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-23 13:07:02,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:02,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:07:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-23 13:07:02,793 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-11-23 13:07:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:02,793 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-23 13:07:02,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:07:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 13:07:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:07:02,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:02,794 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:02,794 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:02,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:02,795 INFO L82 PathProgramCache]: Analyzing trace with hash -738878207, now seen corresponding path program 18 times [2018-11-23 13:07:02,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:02,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:03,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {4955#true} call ULTIMATE.init(); {4955#true} is VALID [2018-11-23 13:07:03,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {4955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4955#true} is VALID [2018-11-23 13:07:04,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {4955#true} assume true; {4955#true} is VALID [2018-11-23 13:07:04,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4955#true} {4955#true} #35#return; {4955#true} is VALID [2018-11-23 13:07:04,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {4955#true} call #t~ret4 := main(); {4955#true} is VALID [2018-11-23 13:07:04,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {4955#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4957#(= main_~i~0 0)} is VALID [2018-11-23 13:07:04,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {4957#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4957#(= main_~i~0 0)} is VALID [2018-11-23 13:07:04,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {4957#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:04,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {4958#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:04,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {4958#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:04,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {4959#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:04,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:04,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {4960#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:04,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {4960#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:04,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {4961#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:04,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {4961#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:04,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {4962#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:04,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {4962#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:04,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {4963#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:04,008 INFO L273 TraceCheckUtils]: 19: Hoare triple {4963#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:04,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {4964#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:04,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {4964#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:04,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:04,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:04,011 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:04,012 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:04,012 INFO L273 TraceCheckUtils]: 26: Hoare triple {4967#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:04,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {4967#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:04,014 INFO L273 TraceCheckUtils]: 28: Hoare triple {4968#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:04,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:04,015 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:04,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {4969#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:04,016 INFO L273 TraceCheckUtils]: 32: Hoare triple {4970#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:04,017 INFO L273 TraceCheckUtils]: 33: Hoare triple {4970#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:04,018 INFO L273 TraceCheckUtils]: 34: Hoare triple {4971#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:04,018 INFO L273 TraceCheckUtils]: 35: Hoare triple {4971#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:04,019 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:04,020 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:04,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:04,021 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:04,021 INFO L273 TraceCheckUtils]: 40: Hoare triple {4974#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:04,022 INFO L273 TraceCheckUtils]: 41: Hoare triple {4974#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4975#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:04,023 INFO L273 TraceCheckUtils]: 42: Hoare triple {4975#(<= main_~i~0 18)} assume !(~i~0 < 2048); {4956#false} is VALID [2018-11-23 13:07:04,023 INFO L273 TraceCheckUtils]: 43: Hoare triple {4956#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4956#false} is VALID [2018-11-23 13:07:04,023 INFO L256 TraceCheckUtils]: 44: Hoare triple {4956#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4956#false} is VALID [2018-11-23 13:07:04,023 INFO L273 TraceCheckUtils]: 45: Hoare triple {4956#false} ~cond := #in~cond; {4956#false} is VALID [2018-11-23 13:07:04,024 INFO L273 TraceCheckUtils]: 46: Hoare triple {4956#false} assume 0 == ~cond; {4956#false} is VALID [2018-11-23 13:07:04,024 INFO L273 TraceCheckUtils]: 47: Hoare triple {4956#false} assume !false; {4956#false} is VALID [2018-11-23 13:07:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:04,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:04,026 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 13:07:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:04,670 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:07:04,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:04,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:04,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {4955#true} call ULTIMATE.init(); {4955#true} is VALID [2018-11-23 13:07:04,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {4955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4955#true} is VALID [2018-11-23 13:07:04,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {4955#true} assume true; {4955#true} is VALID [2018-11-23 13:07:04,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4955#true} {4955#true} #35#return; {4955#true} is VALID [2018-11-23 13:07:04,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {4955#true} call #t~ret4 := main(); {4955#true} is VALID [2018-11-23 13:07:04,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {4955#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4994#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:04,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {4994#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4994#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:04,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {4994#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:04,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {4958#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4958#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:04,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {4958#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:04,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {4959#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4959#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:04,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:04,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {4960#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4960#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:04,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {4960#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:04,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {4961#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4961#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:04,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {4961#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:04,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {4962#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4962#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:04,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {4962#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:04,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {4963#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4963#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:04,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {4963#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:04,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {4964#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4964#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:04,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {4964#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:04,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {4965#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4965#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:04,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {4965#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:04,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {4966#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4966#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:04,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {4966#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:04,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {4967#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4967#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:04,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {4967#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:04,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {4968#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4968#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:04,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {4968#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:04,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {4969#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4969#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:04,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {4969#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:04,955 INFO L273 TraceCheckUtils]: 32: Hoare triple {4970#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4970#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:04,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {4970#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:04,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {4971#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4971#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:04,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {4971#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:04,958 INFO L273 TraceCheckUtils]: 36: Hoare triple {4972#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4972#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:04,959 INFO L273 TraceCheckUtils]: 37: Hoare triple {4972#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:04,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {4973#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4973#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:04,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {4973#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:04,961 INFO L273 TraceCheckUtils]: 40: Hoare triple {4974#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4974#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:04,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {4974#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4975#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:04,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {4975#(<= main_~i~0 18)} assume !(~i~0 < 2048); {4956#false} is VALID [2018-11-23 13:07:04,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {4956#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4956#false} is VALID [2018-11-23 13:07:04,962 INFO L256 TraceCheckUtils]: 44: Hoare triple {4956#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4956#false} is VALID [2018-11-23 13:07:04,963 INFO L273 TraceCheckUtils]: 45: Hoare triple {4956#false} ~cond := #in~cond; {4956#false} is VALID [2018-11-23 13:07:04,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {4956#false} assume 0 == ~cond; {4956#false} is VALID [2018-11-23 13:07:04,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {4956#false} assume !false; {4956#false} is VALID [2018-11-23 13:07:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:04,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:04,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:07:04,986 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:07:04,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:04,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:07:05,037 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 13:07:05,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:07:05,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:07:05,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:05,038 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-11-23 13:07:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,589 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:07:05,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:07:05,589 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:07:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2018-11-23 13:07:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2018-11-23 13:07:05,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 58 transitions. [2018-11-23 13:07:05,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:05,656 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:07:05,656 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:07:05,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:07:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 13:07:05,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:05,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 13:07:05,688 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 13:07:05,688 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 13:07:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,689 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:07:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:07:05,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:05,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:05,690 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 13:07:05,690 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 13:07:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,691 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-11-23 13:07:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-11-23 13:07:05,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:05,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:05,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:05,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:07:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-23 13:07:05,694 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-11-23 13:07:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:05,694 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-23 13:07:05,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:07:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 13:07:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:07:05,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:05,695 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:05,695 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:05,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:05,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2061892515, now seen corresponding path program 19 times [2018-11-23 13:07:05,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:05,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:05,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:06,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {5387#true} call ULTIMATE.init(); {5387#true} is VALID [2018-11-23 13:07:06,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {5387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5387#true} is VALID [2018-11-23 13:07:06,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {5387#true} assume true; {5387#true} is VALID [2018-11-23 13:07:06,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5387#true} {5387#true} #35#return; {5387#true} is VALID [2018-11-23 13:07:06,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {5387#true} call #t~ret4 := main(); {5387#true} is VALID [2018-11-23 13:07:06,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {5387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5389#(= main_~i~0 0)} is VALID [2018-11-23 13:07:06,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {5389#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5389#(= main_~i~0 0)} is VALID [2018-11-23 13:07:06,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {5389#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:06,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {5390#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:06,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {5390#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:06,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {5391#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:06,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {5391#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:06,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {5392#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:06,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {5392#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:06,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {5393#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:06,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {5393#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:06,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {5394#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:06,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {5394#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:06,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {5395#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:06,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {5395#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:06,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {5396#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:06,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {5396#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:06,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {5397#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:06,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {5397#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:06,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:06,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {5398#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:06,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {5399#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:06,514 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:06,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {5400#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:06,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {5400#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:06,516 INFO L273 TraceCheckUtils]: 30: Hoare triple {5401#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:06,517 INFO L273 TraceCheckUtils]: 31: Hoare triple {5401#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:06,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {5402#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:06,518 INFO L273 TraceCheckUtils]: 33: Hoare triple {5402#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:06,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {5403#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:06,520 INFO L273 TraceCheckUtils]: 35: Hoare triple {5403#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:06,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {5404#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:06,521 INFO L273 TraceCheckUtils]: 37: Hoare triple {5404#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:06,522 INFO L273 TraceCheckUtils]: 38: Hoare triple {5405#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:06,523 INFO L273 TraceCheckUtils]: 39: Hoare triple {5405#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:06,523 INFO L273 TraceCheckUtils]: 40: Hoare triple {5406#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:06,524 INFO L273 TraceCheckUtils]: 41: Hoare triple {5406#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:06,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {5407#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:06,526 INFO L273 TraceCheckUtils]: 43: Hoare triple {5407#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5408#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:06,526 INFO L273 TraceCheckUtils]: 44: Hoare triple {5408#(<= main_~i~0 19)} assume !(~i~0 < 2048); {5388#false} is VALID [2018-11-23 13:07:06,527 INFO L273 TraceCheckUtils]: 45: Hoare triple {5388#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5388#false} is VALID [2018-11-23 13:07:06,527 INFO L256 TraceCheckUtils]: 46: Hoare triple {5388#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5388#false} is VALID [2018-11-23 13:07:06,527 INFO L273 TraceCheckUtils]: 47: Hoare triple {5388#false} ~cond := #in~cond; {5388#false} is VALID [2018-11-23 13:07:06,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {5388#false} assume 0 == ~cond; {5388#false} is VALID [2018-11-23 13:07:06,528 INFO L273 TraceCheckUtils]: 49: Hoare triple {5388#false} assume !false; {5388#false} is VALID [2018-11-23 13:07:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:06,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:06,532 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 13:07:06,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:06,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:06,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {5387#true} call ULTIMATE.init(); {5387#true} is VALID [2018-11-23 13:07:06,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {5387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5387#true} is VALID [2018-11-23 13:07:06,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {5387#true} assume true; {5387#true} is VALID [2018-11-23 13:07:06,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5387#true} {5387#true} #35#return; {5387#true} is VALID [2018-11-23 13:07:06,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {5387#true} call #t~ret4 := main(); {5387#true} is VALID [2018-11-23 13:07:06,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {5387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5427#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:06,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {5427#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5427#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:06,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {5427#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:06,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {5390#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5390#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:06,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {5390#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:06,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {5391#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5391#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:06,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {5391#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:06,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {5392#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5392#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:06,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {5392#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:06,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {5393#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5393#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:06,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {5393#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:06,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {5394#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5394#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:06,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {5394#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:06,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {5395#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5395#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:06,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {5395#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:06,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {5396#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5396#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:06,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {5396#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:06,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {5397#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5397#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:06,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {5397#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:06,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {5398#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5398#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:06,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {5398#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:06,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {5399#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5399#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:06,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:06,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {5400#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5400#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:06,795 INFO L273 TraceCheckUtils]: 29: Hoare triple {5400#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:06,796 INFO L273 TraceCheckUtils]: 30: Hoare triple {5401#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5401#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:06,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {5401#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:06,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {5402#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5402#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:06,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {5402#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:06,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {5403#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5403#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:06,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {5403#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:06,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {5404#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5404#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:06,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {5404#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:06,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {5405#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5405#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:06,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {5405#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:06,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {5406#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5406#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:06,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {5406#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:06,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {5407#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5407#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:06,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {5407#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5408#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:06,806 INFO L273 TraceCheckUtils]: 44: Hoare triple {5408#(<= main_~i~0 19)} assume !(~i~0 < 2048); {5388#false} is VALID [2018-11-23 13:07:06,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {5388#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5388#false} is VALID [2018-11-23 13:07:06,806 INFO L256 TraceCheckUtils]: 46: Hoare triple {5388#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5388#false} is VALID [2018-11-23 13:07:06,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {5388#false} ~cond := #in~cond; {5388#false} is VALID [2018-11-23 13:07:06,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {5388#false} assume 0 == ~cond; {5388#false} is VALID [2018-11-23 13:07:06,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {5388#false} assume !false; {5388#false} is VALID [2018-11-23 13:07:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:06,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:06,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:07:06,831 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-11-23 13:07:06,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:06,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:07:06,916 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 13:07:06,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:07:06,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:07:06,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:06,919 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-11-23 13:07:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:07,113 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:07:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:07:07,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-11-23 13:07:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2018-11-23 13:07:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 60 transitions. [2018-11-23 13:07:07,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 60 transitions. [2018-11-23 13:07:07,180 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 13:07:07,182 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:07:07,182 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:07:07,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:07:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 13:07:07,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:07,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 13:07:07,239 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 13:07:07,239 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 13:07:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:07,240 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:07:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:07:07,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:07,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:07,241 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 13:07:07,241 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 13:07:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:07,242 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-23 13:07:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 13:07:07,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:07,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:07,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:07,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:07:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-23 13:07:07,244 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-11-23 13:07:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:07,244 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-23 13:07:07,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:07:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-23 13:07:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:07:07,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:07,244 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:07,245 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:07,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash 658061765, now seen corresponding path program 20 times [2018-11-23 13:07:07,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:07,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:07,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:07,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:07,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:07,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 13:07:07,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 13:07:07,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 13:07:07,599 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #35#return; {5836#true} is VALID [2018-11-23 13:07:07,599 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret4 := main(); {5836#true} is VALID [2018-11-23 13:07:07,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5838#(= main_~i~0 0)} is VALID [2018-11-23 13:07:07,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {5838#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5838#(= main_~i~0 0)} is VALID [2018-11-23 13:07:07,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {5838#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:07,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {5839#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:07,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {5839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:07,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {5840#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:07,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {5840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:07,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:07,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {5841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:07,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {5842#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:07,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {5842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:07,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {5843#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:07,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {5843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:07,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:07,607 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:07,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {5845#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:07,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {5845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:07,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {5846#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:07,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {5846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:07,610 INFO L273 TraceCheckUtils]: 24: Hoare triple {5847#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:07,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {5847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:07,611 INFO L273 TraceCheckUtils]: 26: Hoare triple {5848#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:07,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {5848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:07,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {5849#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:07,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {5849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:07,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {5850#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:07,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {5850#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:07,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {5851#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:07,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {5851#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:07,617 INFO L273 TraceCheckUtils]: 34: Hoare triple {5852#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:07,617 INFO L273 TraceCheckUtils]: 35: Hoare triple {5852#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:07,618 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:07,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:07,619 INFO L273 TraceCheckUtils]: 38: Hoare triple {5854#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:07,620 INFO L273 TraceCheckUtils]: 39: Hoare triple {5854#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:07,620 INFO L273 TraceCheckUtils]: 40: Hoare triple {5855#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:07,621 INFO L273 TraceCheckUtils]: 41: Hoare triple {5855#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:07,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {5856#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:07,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {5856#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:07,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {5857#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:07,624 INFO L273 TraceCheckUtils]: 45: Hoare triple {5857#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:07,624 INFO L273 TraceCheckUtils]: 46: Hoare triple {5858#(<= main_~i~0 20)} assume !(~i~0 < 2048); {5837#false} is VALID [2018-11-23 13:07:07,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5837#false} is VALID [2018-11-23 13:07:07,625 INFO L256 TraceCheckUtils]: 48: Hoare triple {5837#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5837#false} is VALID [2018-11-23 13:07:07,625 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 13:07:07,625 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 13:07:07,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 13:07:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:07,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:07,629 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 13:07:07,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:07,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:07,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:07,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:07,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {5836#true} call ULTIMATE.init(); {5836#true} is VALID [2018-11-23 13:07:07,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {5836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5836#true} is VALID [2018-11-23 13:07:07,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {5836#true} assume true; {5836#true} is VALID [2018-11-23 13:07:07,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5836#true} {5836#true} #35#return; {5836#true} is VALID [2018-11-23 13:07:07,962 INFO L256 TraceCheckUtils]: 4: Hoare triple {5836#true} call #t~ret4 := main(); {5836#true} is VALID [2018-11-23 13:07:07,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {5836#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5877#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:07,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {5877#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5877#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:07,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {5877#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:07,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {5839#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5839#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:07,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {5839#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:07,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {5840#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5840#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:07,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {5840#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:07,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5841#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:07,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {5841#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:07,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {5842#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5842#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:07,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {5842#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:07,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {5843#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5843#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:07,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {5843#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:07,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {5844#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5844#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:07,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {5844#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:07,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {5845#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5845#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:07,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {5845#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:07,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {5846#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5846#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:07,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {5846#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:07,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {5847#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5847#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:07,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {5847#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:07,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {5848#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5848#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:07,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {5848#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:07,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {5849#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5849#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:07,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {5849#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:07,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {5850#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5850#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:07,978 INFO L273 TraceCheckUtils]: 31: Hoare triple {5850#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:07,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {5851#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5851#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:07,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {5851#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:07,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {5852#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5852#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:07,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {5852#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:07,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {5853#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5853#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:07,982 INFO L273 TraceCheckUtils]: 37: Hoare triple {5853#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:07,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {5854#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5854#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:07,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {5854#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:07,984 INFO L273 TraceCheckUtils]: 40: Hoare triple {5855#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5855#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:07,984 INFO L273 TraceCheckUtils]: 41: Hoare triple {5855#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:07,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {5856#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5856#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:07,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {5856#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:07,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {5857#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5857#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:07,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {5857#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5858#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:07,988 INFO L273 TraceCheckUtils]: 46: Hoare triple {5858#(<= main_~i~0 20)} assume !(~i~0 < 2048); {5837#false} is VALID [2018-11-23 13:07:07,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {5837#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5837#false} is VALID [2018-11-23 13:07:07,988 INFO L256 TraceCheckUtils]: 48: Hoare triple {5837#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {5837#false} is VALID [2018-11-23 13:07:07,988 INFO L273 TraceCheckUtils]: 49: Hoare triple {5837#false} ~cond := #in~cond; {5837#false} is VALID [2018-11-23 13:07:07,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {5837#false} assume 0 == ~cond; {5837#false} is VALID [2018-11-23 13:07:07,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {5837#false} assume !false; {5837#false} is VALID [2018-11-23 13:07:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:08,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:08,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:07:08,017 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 13:07:08,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:08,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:07:08,070 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 13:07:08,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:07:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:07:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:08,071 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2018-11-23 13:07:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,248 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:07:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:07:08,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-11-23 13:07:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2018-11-23 13:07:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2018-11-23 13:07:08,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 62 transitions. [2018-11-23 13:07:08,310 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 13:07:08,311 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:07:08,311 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:07:08,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:07:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 13:07:08,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:08,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-23 13:07:08,774 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-23 13:07:08,774 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-23 13:07:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,775 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:07:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:07:08,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:08,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:08,776 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-23 13:07:08,776 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-23 13:07:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,777 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 13:07:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 13:07:08,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:08,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:08,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:08,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:07:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-23 13:07:08,779 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-11-23 13:07:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:08,779 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-23 13:07:08,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:07:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 13:07:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:07:08,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:08,780 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:08,780 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:08,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash 196441959, now seen corresponding path program 21 times [2018-11-23 13:07:08,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:08,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:08,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:08,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:08,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:09,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 13:07:09,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6302#true} is VALID [2018-11-23 13:07:09,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 13:07:09,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6302#true} {6302#true} #35#return; {6302#true} is VALID [2018-11-23 13:07:09,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {6302#true} call #t~ret4 := main(); {6302#true} is VALID [2018-11-23 13:07:09,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6304#(= main_~i~0 0)} is VALID [2018-11-23 13:07:09,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {6304#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6304#(= main_~i~0 0)} is VALID [2018-11-23 13:07:09,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {6304#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:09,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {6305#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:09,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {6305#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:09,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {6306#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:09,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {6306#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:09,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {6307#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:09,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {6307#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:09,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {6308#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:09,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {6308#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:09,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {6309#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:09,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {6309#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:09,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {6310#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:09,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {6310#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:09,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {6311#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:09,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {6311#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:09,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {6312#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:09,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {6312#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:09,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {6313#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:09,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {6313#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:09,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {6314#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:09,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {6314#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:09,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:09,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:09,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:09,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:09,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {6317#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:09,215 INFO L273 TraceCheckUtils]: 33: Hoare triple {6317#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:09,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {6318#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:09,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {6318#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:09,217 INFO L273 TraceCheckUtils]: 36: Hoare triple {6319#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:09,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {6319#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:09,218 INFO L273 TraceCheckUtils]: 38: Hoare triple {6320#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:09,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {6320#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:09,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:09,220 INFO L273 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:09,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {6322#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:09,221 INFO L273 TraceCheckUtils]: 43: Hoare triple {6322#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:09,222 INFO L273 TraceCheckUtils]: 44: Hoare triple {6323#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:09,223 INFO L273 TraceCheckUtils]: 45: Hoare triple {6323#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:09,223 INFO L273 TraceCheckUtils]: 46: Hoare triple {6324#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:09,224 INFO L273 TraceCheckUtils]: 47: Hoare triple {6324#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6325#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:09,225 INFO L273 TraceCheckUtils]: 48: Hoare triple {6325#(<= main_~i~0 21)} assume !(~i~0 < 2048); {6303#false} is VALID [2018-11-23 13:07:09,225 INFO L273 TraceCheckUtils]: 49: Hoare triple {6303#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6303#false} is VALID [2018-11-23 13:07:09,225 INFO L256 TraceCheckUtils]: 50: Hoare triple {6303#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6303#false} is VALID [2018-11-23 13:07:09,225 INFO L273 TraceCheckUtils]: 51: Hoare triple {6303#false} ~cond := #in~cond; {6303#false} is VALID [2018-11-23 13:07:09,226 INFO L273 TraceCheckUtils]: 52: Hoare triple {6303#false} assume 0 == ~cond; {6303#false} is VALID [2018-11-23 13:07:09,226 INFO L273 TraceCheckUtils]: 53: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 13:07:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:09,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:09,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:09,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:11,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 13:07:11,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:11,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:11,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {6302#true} call ULTIMATE.init(); {6302#true} is VALID [2018-11-23 13:07:11,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {6302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6302#true} is VALID [2018-11-23 13:07:11,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {6302#true} assume true; {6302#true} is VALID [2018-11-23 13:07:11,378 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6302#true} {6302#true} #35#return; {6302#true} is VALID [2018-11-23 13:07:11,378 INFO L256 TraceCheckUtils]: 4: Hoare triple {6302#true} call #t~ret4 := main(); {6302#true} is VALID [2018-11-23 13:07:11,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {6302#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6344#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:11,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {6344#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6344#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:11,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {6344#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:11,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {6305#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6305#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:11,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {6305#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:11,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {6306#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6306#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:11,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {6306#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:11,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {6307#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6307#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:11,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {6307#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:11,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {6308#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6308#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:11,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {6308#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:11,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {6309#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6309#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:11,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {6309#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:11,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {6310#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6310#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:11,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {6310#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:11,388 INFO L273 TraceCheckUtils]: 20: Hoare triple {6311#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6311#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:11,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {6311#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:11,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {6312#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6312#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:11,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {6312#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:11,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {6313#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6313#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:11,391 INFO L273 TraceCheckUtils]: 25: Hoare triple {6313#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:11,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {6314#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6314#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:11,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {6314#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:11,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {6315#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6315#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:11,394 INFO L273 TraceCheckUtils]: 29: Hoare triple {6315#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:11,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6316#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:11,395 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:11,396 INFO L273 TraceCheckUtils]: 32: Hoare triple {6317#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6317#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:11,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {6317#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:11,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {6318#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6318#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:11,398 INFO L273 TraceCheckUtils]: 35: Hoare triple {6318#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:11,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {6319#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6319#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:11,399 INFO L273 TraceCheckUtils]: 37: Hoare triple {6319#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:11,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {6320#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6320#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:11,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {6320#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:11,401 INFO L273 TraceCheckUtils]: 40: Hoare triple {6321#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6321#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:11,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {6321#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:11,402 INFO L273 TraceCheckUtils]: 42: Hoare triple {6322#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6322#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:11,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {6322#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:11,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {6323#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6323#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:11,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {6323#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:11,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {6324#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6324#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:11,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {6324#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6325#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:11,406 INFO L273 TraceCheckUtils]: 48: Hoare triple {6325#(<= main_~i~0 21)} assume !(~i~0 < 2048); {6303#false} is VALID [2018-11-23 13:07:11,406 INFO L273 TraceCheckUtils]: 49: Hoare triple {6303#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6303#false} is VALID [2018-11-23 13:07:11,407 INFO L256 TraceCheckUtils]: 50: Hoare triple {6303#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6303#false} is VALID [2018-11-23 13:07:11,407 INFO L273 TraceCheckUtils]: 51: Hoare triple {6303#false} ~cond := #in~cond; {6303#false} is VALID [2018-11-23 13:07:11,407 INFO L273 TraceCheckUtils]: 52: Hoare triple {6303#false} assume 0 == ~cond; {6303#false} is VALID [2018-11-23 13:07:11,407 INFO L273 TraceCheckUtils]: 53: Hoare triple {6303#false} assume !false; {6303#false} is VALID [2018-11-23 13:07:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:11,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:11,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:07:11,430 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-11-23 13:07:11,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:11,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:07:11,488 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 13:07:11,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:07:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:07:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:07:11,490 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-11-23 13:07:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:11,932 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:07:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:07:11,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-11-23 13:07:11,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:07:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 13:07:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:07:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 13:07:11,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2018-11-23 13:07:12,014 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 13:07:12,016 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:07:12,016 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:07:12,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:07:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:07:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:07:12,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:12,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 13:07:12,052 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 13:07:12,052 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 13:07:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,054 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:07:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:07:12,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:12,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:12,054 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 13:07:12,054 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 13:07:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:12,055 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 13:07:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-23 13:07:12,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:12,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:12,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:12,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:07:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 13:07:12,056 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-11-23 13:07:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:12,056 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 13:07:12,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:07:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 13:07:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:07:12,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:12,057 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:12,057 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:12,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 22 times [2018-11-23 13:07:12,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:12,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:12,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {6785#true} call ULTIMATE.init(); {6785#true} is VALID [2018-11-23 13:07:12,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {6785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6785#true} is VALID [2018-11-23 13:07:12,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2018-11-23 13:07:12,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6785#true} #35#return; {6785#true} is VALID [2018-11-23 13:07:12,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {6785#true} call #t~ret4 := main(); {6785#true} is VALID [2018-11-23 13:07:12,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {6785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6787#(= main_~i~0 0)} is VALID [2018-11-23 13:07:12,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {6787#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6787#(= main_~i~0 0)} is VALID [2018-11-23 13:07:12,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {6787#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:12,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:12,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:12,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {6789#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:12,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {6789#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:12,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:12,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {6790#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:12,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {6791#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:12,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {6791#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:12,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:12,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:12,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:12,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:12,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {6794#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:12,513 INFO L273 TraceCheckUtils]: 21: Hoare triple {6794#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:12,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {6795#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:12,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {6795#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:12,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {6796#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:12,516 INFO L273 TraceCheckUtils]: 25: Hoare triple {6796#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:12,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {6797#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:12,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {6797#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:12,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {6798#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:12,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {6798#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:12,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {6799#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:12,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {6799#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:12,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {6800#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:12,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {6800#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:12,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {6801#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:12,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {6801#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:12,522 INFO L273 TraceCheckUtils]: 36: Hoare triple {6802#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:12,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {6802#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:12,524 INFO L273 TraceCheckUtils]: 38: Hoare triple {6803#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:12,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {6803#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:12,525 INFO L273 TraceCheckUtils]: 40: Hoare triple {6804#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:12,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {6804#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:12,526 INFO L273 TraceCheckUtils]: 42: Hoare triple {6805#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:12,527 INFO L273 TraceCheckUtils]: 43: Hoare triple {6805#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:12,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {6806#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:12,528 INFO L273 TraceCheckUtils]: 45: Hoare triple {6806#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:12,529 INFO L273 TraceCheckUtils]: 46: Hoare triple {6807#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:12,529 INFO L273 TraceCheckUtils]: 47: Hoare triple {6807#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:12,530 INFO L273 TraceCheckUtils]: 48: Hoare triple {6808#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:12,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {6808#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6809#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:12,531 INFO L273 TraceCheckUtils]: 50: Hoare triple {6809#(<= main_~i~0 22)} assume !(~i~0 < 2048); {6786#false} is VALID [2018-11-23 13:07:12,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {6786#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6786#false} is VALID [2018-11-23 13:07:12,532 INFO L256 TraceCheckUtils]: 52: Hoare triple {6786#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6786#false} is VALID [2018-11-23 13:07:12,532 INFO L273 TraceCheckUtils]: 53: Hoare triple {6786#false} ~cond := #in~cond; {6786#false} is VALID [2018-11-23 13:07:12,532 INFO L273 TraceCheckUtils]: 54: Hoare triple {6786#false} assume 0 == ~cond; {6786#false} is VALID [2018-11-23 13:07:12,532 INFO L273 TraceCheckUtils]: 55: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2018-11-23 13:07:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:12,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:12,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:12,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:12,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:12,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:12,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:12,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {6785#true} call ULTIMATE.init(); {6785#true} is VALID [2018-11-23 13:07:12,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {6785#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6785#true} is VALID [2018-11-23 13:07:12,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {6785#true} assume true; {6785#true} is VALID [2018-11-23 13:07:12,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6785#true} {6785#true} #35#return; {6785#true} is VALID [2018-11-23 13:07:12,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {6785#true} call #t~ret4 := main(); {6785#true} is VALID [2018-11-23 13:07:12,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {6785#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6828#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:12,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {6828#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6828#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:12,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {6828#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:12,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6788#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:12,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:12,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {6789#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6789#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:12,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {6789#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:12,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {6790#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6790#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:12,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {6790#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:12,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {6791#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6791#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:12,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {6791#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:12,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6792#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:12,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:12,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6793#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:12,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:12,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {6794#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6794#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:12,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {6794#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:12,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {6795#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6795#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:12,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {6795#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:12,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {6796#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6796#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:12,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {6796#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:12,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {6797#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6797#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:12,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {6797#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:12,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {6798#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6798#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:12,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {6798#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:12,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {6799#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6799#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:12,919 INFO L273 TraceCheckUtils]: 31: Hoare triple {6799#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:12,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {6800#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6800#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:12,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {6800#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:12,951 INFO L273 TraceCheckUtils]: 34: Hoare triple {6801#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6801#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:12,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {6801#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:12,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {6802#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6802#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:12,989 INFO L273 TraceCheckUtils]: 37: Hoare triple {6802#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:12,998 INFO L273 TraceCheckUtils]: 38: Hoare triple {6803#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6803#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:13,008 INFO L273 TraceCheckUtils]: 39: Hoare triple {6803#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:13,023 INFO L273 TraceCheckUtils]: 40: Hoare triple {6804#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6804#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:13,032 INFO L273 TraceCheckUtils]: 41: Hoare triple {6804#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:13,044 INFO L273 TraceCheckUtils]: 42: Hoare triple {6805#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6805#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:13,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {6805#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:13,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {6806#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6806#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:13,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {6806#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:13,091 INFO L273 TraceCheckUtils]: 46: Hoare triple {6807#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6807#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:13,104 INFO L273 TraceCheckUtils]: 47: Hoare triple {6807#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:13,116 INFO L273 TraceCheckUtils]: 48: Hoare triple {6808#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6808#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:13,129 INFO L273 TraceCheckUtils]: 49: Hoare triple {6808#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6809#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:13,141 INFO L273 TraceCheckUtils]: 50: Hoare triple {6809#(<= main_~i~0 22)} assume !(~i~0 < 2048); {6786#false} is VALID [2018-11-23 13:07:13,142 INFO L273 TraceCheckUtils]: 51: Hoare triple {6786#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6786#false} is VALID [2018-11-23 13:07:13,142 INFO L256 TraceCheckUtils]: 52: Hoare triple {6786#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {6786#false} is VALID [2018-11-23 13:07:13,142 INFO L273 TraceCheckUtils]: 53: Hoare triple {6786#false} ~cond := #in~cond; {6786#false} is VALID [2018-11-23 13:07:13,142 INFO L273 TraceCheckUtils]: 54: Hoare triple {6786#false} assume 0 == ~cond; {6786#false} is VALID [2018-11-23 13:07:13,142 INFO L273 TraceCheckUtils]: 55: Hoare triple {6786#false} assume !false; {6786#false} is VALID [2018-11-23 13:07:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:13,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:13,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 13:07:13,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:07:13,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:13,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:07:13,694 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 13:07:13,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:07:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:07:13,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:07:13,695 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-11-23 13:07:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:14,168 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:07:14,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:07:14,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:07:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:07:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2018-11-23 13:07:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:07:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2018-11-23 13:07:14,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 66 transitions. [2018-11-23 13:07:14,233 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 13:07:14,234 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:07:14,235 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:07:14,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:07:14,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:07:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 13:07:14,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:14,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 13:07:14,253 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 13:07:14,253 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 13:07:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:14,254 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:07:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:07:14,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:14,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:14,255 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 13:07:14,255 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 13:07:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:14,256 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-23 13:07:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-23 13:07:14,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:14,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:14,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:14,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:07:14,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-23 13:07:14,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-11-23 13:07:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:14,258 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-23 13:07:14,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:07:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-23 13:07:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:07:14,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:14,259 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:14,259 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:14,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:14,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1830383915, now seen corresponding path program 23 times [2018-11-23 13:07:14,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:14,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:14,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:14,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:14,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:15,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {7285#true} call ULTIMATE.init(); {7285#true} is VALID [2018-11-23 13:07:15,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {7285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7285#true} is VALID [2018-11-23 13:07:15,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {7285#true} assume true; {7285#true} is VALID [2018-11-23 13:07:15,579 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} #35#return; {7285#true} is VALID [2018-11-23 13:07:15,579 INFO L256 TraceCheckUtils]: 4: Hoare triple {7285#true} call #t~ret4 := main(); {7285#true} is VALID [2018-11-23 13:07:15,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {7285#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7287#(= main_~i~0 0)} is VALID [2018-11-23 13:07:15,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {7287#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7287#(= main_~i~0 0)} is VALID [2018-11-23 13:07:15,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {7287#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:15,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {7288#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:15,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {7288#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:15,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {7289#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:15,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {7289#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:15,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {7290#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:15,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {7290#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:15,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {7291#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:15,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {7291#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:15,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {7292#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:15,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {7292#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:15,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:15,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:15,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {7294#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:15,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {7294#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:15,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {7295#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:15,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {7295#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:15,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:15,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:15,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {7297#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:15,591 INFO L273 TraceCheckUtils]: 27: Hoare triple {7297#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:15,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {7298#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:15,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {7298#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:15,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {7299#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:15,594 INFO L273 TraceCheckUtils]: 31: Hoare triple {7299#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:15,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {7300#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:15,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {7300#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:15,595 INFO L273 TraceCheckUtils]: 34: Hoare triple {7301#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:15,596 INFO L273 TraceCheckUtils]: 35: Hoare triple {7301#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:15,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {7302#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:15,597 INFO L273 TraceCheckUtils]: 37: Hoare triple {7302#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:15,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {7303#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:15,598 INFO L273 TraceCheckUtils]: 39: Hoare triple {7303#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:15,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {7304#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:15,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {7304#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:15,600 INFO L273 TraceCheckUtils]: 42: Hoare triple {7305#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:15,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {7305#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:15,601 INFO L273 TraceCheckUtils]: 44: Hoare triple {7306#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:15,602 INFO L273 TraceCheckUtils]: 45: Hoare triple {7306#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:15,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {7307#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:15,603 INFO L273 TraceCheckUtils]: 47: Hoare triple {7307#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:15,604 INFO L273 TraceCheckUtils]: 48: Hoare triple {7308#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:15,604 INFO L273 TraceCheckUtils]: 49: Hoare triple {7308#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:15,605 INFO L273 TraceCheckUtils]: 50: Hoare triple {7309#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:15,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {7309#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7310#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:15,606 INFO L273 TraceCheckUtils]: 52: Hoare triple {7310#(<= main_~i~0 23)} assume !(~i~0 < 2048); {7286#false} is VALID [2018-11-23 13:07:15,607 INFO L273 TraceCheckUtils]: 53: Hoare triple {7286#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7286#false} is VALID [2018-11-23 13:07:15,607 INFO L256 TraceCheckUtils]: 54: Hoare triple {7286#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7286#false} is VALID [2018-11-23 13:07:15,607 INFO L273 TraceCheckUtils]: 55: Hoare triple {7286#false} ~cond := #in~cond; {7286#false} is VALID [2018-11-23 13:07:15,607 INFO L273 TraceCheckUtils]: 56: Hoare triple {7286#false} assume 0 == ~cond; {7286#false} is VALID [2018-11-23 13:07:15,607 INFO L273 TraceCheckUtils]: 57: Hoare triple {7286#false} assume !false; {7286#false} is VALID [2018-11-23 13:07:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:15,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:15,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:15,620 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:15,930 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 13:07:15,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:15,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:16,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {7285#true} call ULTIMATE.init(); {7285#true} is VALID [2018-11-23 13:07:16,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {7285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7285#true} is VALID [2018-11-23 13:07:16,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {7285#true} assume true; {7285#true} is VALID [2018-11-23 13:07:16,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} #35#return; {7285#true} is VALID [2018-11-23 13:07:16,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {7285#true} call #t~ret4 := main(); {7285#true} is VALID [2018-11-23 13:07:16,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {7285#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7329#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:16,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {7329#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7329#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:16,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {7329#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:16,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {7288#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7288#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:16,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {7288#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:16,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {7289#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7289#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:16,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {7289#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:16,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {7290#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7290#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:16,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {7290#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:16,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {7291#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7291#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:16,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {7291#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:16,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {7292#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7292#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:16,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {7292#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:16,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7293#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:16,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:16,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {7294#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7294#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:16,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {7294#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:16,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {7295#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7295#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:16,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {7295#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:16,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {7296#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7296#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:16,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {7296#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:16,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {7297#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7297#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:16,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {7297#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:16,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {7298#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7298#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:16,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {7298#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:16,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {7299#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7299#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:16,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {7299#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:16,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {7300#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7300#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:16,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {7300#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:16,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {7301#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7301#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:16,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {7301#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:16,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {7302#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7302#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:16,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {7302#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:16,177 INFO L273 TraceCheckUtils]: 38: Hoare triple {7303#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7303#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:16,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {7303#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:16,178 INFO L273 TraceCheckUtils]: 40: Hoare triple {7304#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7304#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:16,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {7304#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:16,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {7305#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7305#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:16,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {7305#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:16,181 INFO L273 TraceCheckUtils]: 44: Hoare triple {7306#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7306#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:16,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {7306#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:16,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {7307#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7307#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:16,183 INFO L273 TraceCheckUtils]: 47: Hoare triple {7307#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:16,183 INFO L273 TraceCheckUtils]: 48: Hoare triple {7308#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7308#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:16,184 INFO L273 TraceCheckUtils]: 49: Hoare triple {7308#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:16,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {7309#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7309#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:16,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {7309#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7310#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:16,186 INFO L273 TraceCheckUtils]: 52: Hoare triple {7310#(<= main_~i~0 23)} assume !(~i~0 < 2048); {7286#false} is VALID [2018-11-23 13:07:16,186 INFO L273 TraceCheckUtils]: 53: Hoare triple {7286#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7286#false} is VALID [2018-11-23 13:07:16,186 INFO L256 TraceCheckUtils]: 54: Hoare triple {7286#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7286#false} is VALID [2018-11-23 13:07:16,186 INFO L273 TraceCheckUtils]: 55: Hoare triple {7286#false} ~cond := #in~cond; {7286#false} is VALID [2018-11-23 13:07:16,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {7286#false} assume 0 == ~cond; {7286#false} is VALID [2018-11-23 13:07:16,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {7286#false} assume !false; {7286#false} is VALID [2018-11-23 13:07:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:16,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:16,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 13:07:16,209 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-11-23 13:07:16,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:16,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:07:16,274 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 13:07:16,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:07:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:07:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:07:16,275 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-11-23 13:07:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:16,561 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:07:16,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:07:16,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-11-23 13:07:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:07:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2018-11-23 13:07:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:07:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2018-11-23 13:07:16,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2018-11-23 13:07:16,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:16,632 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:07:16,632 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:07:16,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:07:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:07:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 13:07:16,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:16,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 13:07:16,655 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 13:07:16,655 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 13:07:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:16,657 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:07:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:07:16,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:16,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:16,657 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 13:07:16,657 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 13:07:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:16,658 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-11-23 13:07:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-23 13:07:16,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:16,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:16,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:16,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:07:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-23 13:07:16,660 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-11-23 13:07:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:16,661 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-23 13:07:16,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:07:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-23 13:07:16,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:07:16,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:16,662 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:16,662 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:16,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:16,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1516596557, now seen corresponding path program 24 times [2018-11-23 13:07:16,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:16,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:16,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:16,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:16,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:18,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {7802#true} call ULTIMATE.init(); {7802#true} is VALID [2018-11-23 13:07:18,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {7802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7802#true} is VALID [2018-11-23 13:07:18,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {7802#true} assume true; {7802#true} is VALID [2018-11-23 13:07:18,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7802#true} {7802#true} #35#return; {7802#true} is VALID [2018-11-23 13:07:18,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {7802#true} call #t~ret4 := main(); {7802#true} is VALID [2018-11-23 13:07:18,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {7802#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7804#(= main_~i~0 0)} is VALID [2018-11-23 13:07:18,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {7804#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7804#(= main_~i~0 0)} is VALID [2018-11-23 13:07:18,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {7804#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:18,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:18,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {7805#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:18,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {7806#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:18,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {7806#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:18,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:18,133 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:18,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {7808#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:18,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {7808#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:18,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {7809#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:18,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {7809#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:18,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:18,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:18,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {7811#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:18,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {7811#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:18,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {7812#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:18,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {7812#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:18,140 INFO L273 TraceCheckUtils]: 24: Hoare triple {7813#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:18,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {7813#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:18,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {7814#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:18,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {7814#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:18,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {7815#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:18,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {7815#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:18,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {7816#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:18,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {7816#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:18,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {7817#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:18,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {7817#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:18,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {7818#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:18,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {7818#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:18,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {7819#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:18,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {7819#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:18,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {7820#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:18,149 INFO L273 TraceCheckUtils]: 39: Hoare triple {7820#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:18,149 INFO L273 TraceCheckUtils]: 40: Hoare triple {7821#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:18,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {7821#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:18,150 INFO L273 TraceCheckUtils]: 42: Hoare triple {7822#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:18,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {7822#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:18,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {7823#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:18,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {7823#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:18,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {7824#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:18,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {7824#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:18,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {7825#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:18,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {7825#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:18,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {7826#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:18,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {7826#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:18,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {7827#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:18,157 INFO L273 TraceCheckUtils]: 53: Hoare triple {7827#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7828#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:18,158 INFO L273 TraceCheckUtils]: 54: Hoare triple {7828#(<= main_~i~0 24)} assume !(~i~0 < 2048); {7803#false} is VALID [2018-11-23 13:07:18,158 INFO L273 TraceCheckUtils]: 55: Hoare triple {7803#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7803#false} is VALID [2018-11-23 13:07:18,158 INFO L256 TraceCheckUtils]: 56: Hoare triple {7803#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7803#false} is VALID [2018-11-23 13:07:18,158 INFO L273 TraceCheckUtils]: 57: Hoare triple {7803#false} ~cond := #in~cond; {7803#false} is VALID [2018-11-23 13:07:18,158 INFO L273 TraceCheckUtils]: 58: Hoare triple {7803#false} assume 0 == ~cond; {7803#false} is VALID [2018-11-23 13:07:18,159 INFO L273 TraceCheckUtils]: 59: Hoare triple {7803#false} assume !false; {7803#false} is VALID [2018-11-23 13:07:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:18,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:18,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:18,171 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:22,677 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 13:07:22,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:22,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:22,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {7802#true} call ULTIMATE.init(); {7802#true} is VALID [2018-11-23 13:07:22,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {7802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7802#true} is VALID [2018-11-23 13:07:22,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {7802#true} assume true; {7802#true} is VALID [2018-11-23 13:07:22,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7802#true} {7802#true} #35#return; {7802#true} is VALID [2018-11-23 13:07:22,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {7802#true} call #t~ret4 := main(); {7802#true} is VALID [2018-11-23 13:07:22,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {7802#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7847#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:22,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {7847#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7847#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:22,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {7847#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:22,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7805#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:22,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {7805#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:22,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {7806#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7806#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:22,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {7806#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:22,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {7807#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7807#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:22,885 INFO L273 TraceCheckUtils]: 13: Hoare triple {7807#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:22,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {7808#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7808#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:22,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {7808#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:22,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {7809#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7809#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:22,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {7809#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:22,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7810#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:22,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:22,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {7811#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7811#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:22,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {7811#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:22,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {7812#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7812#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:22,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {7812#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:22,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {7813#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7813#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:22,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {7813#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:22,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {7814#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7814#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:22,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {7814#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:22,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {7815#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7815#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:22,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {7815#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:22,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {7816#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7816#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:22,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {7816#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:22,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {7817#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7817#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:22,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {7817#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:22,898 INFO L273 TraceCheckUtils]: 34: Hoare triple {7818#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7818#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:22,899 INFO L273 TraceCheckUtils]: 35: Hoare triple {7818#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:22,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {7819#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7819#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:22,900 INFO L273 TraceCheckUtils]: 37: Hoare triple {7819#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:22,901 INFO L273 TraceCheckUtils]: 38: Hoare triple {7820#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7820#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:22,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {7820#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:22,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {7821#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7821#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:22,903 INFO L273 TraceCheckUtils]: 41: Hoare triple {7821#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:22,903 INFO L273 TraceCheckUtils]: 42: Hoare triple {7822#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7822#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:22,904 INFO L273 TraceCheckUtils]: 43: Hoare triple {7822#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:22,905 INFO L273 TraceCheckUtils]: 44: Hoare triple {7823#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7823#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:22,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {7823#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:22,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {7824#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7824#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:22,907 INFO L273 TraceCheckUtils]: 47: Hoare triple {7824#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:22,907 INFO L273 TraceCheckUtils]: 48: Hoare triple {7825#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7825#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:22,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {7825#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:22,908 INFO L273 TraceCheckUtils]: 50: Hoare triple {7826#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7826#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:22,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {7826#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:22,910 INFO L273 TraceCheckUtils]: 52: Hoare triple {7827#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7827#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:22,910 INFO L273 TraceCheckUtils]: 53: Hoare triple {7827#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7828#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:22,911 INFO L273 TraceCheckUtils]: 54: Hoare triple {7828#(<= main_~i~0 24)} assume !(~i~0 < 2048); {7803#false} is VALID [2018-11-23 13:07:22,911 INFO L273 TraceCheckUtils]: 55: Hoare triple {7803#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7803#false} is VALID [2018-11-23 13:07:22,912 INFO L256 TraceCheckUtils]: 56: Hoare triple {7803#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {7803#false} is VALID [2018-11-23 13:07:22,912 INFO L273 TraceCheckUtils]: 57: Hoare triple {7803#false} ~cond := #in~cond; {7803#false} is VALID [2018-11-23 13:07:22,912 INFO L273 TraceCheckUtils]: 58: Hoare triple {7803#false} assume 0 == ~cond; {7803#false} is VALID [2018-11-23 13:07:22,912 INFO L273 TraceCheckUtils]: 59: Hoare triple {7803#false} assume !false; {7803#false} is VALID [2018-11-23 13:07:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:22,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:22,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 13:07:22,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-11-23 13:07:22,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:22,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:07:23,000 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 13:07:23,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:07:23,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:07:23,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:07:23,002 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-11-23 13:07:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:23,332 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:07:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:07:23,332 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-11-23 13:07:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:07:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2018-11-23 13:07:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:07:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2018-11-23 13:07:23,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 70 transitions. [2018-11-23 13:07:23,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:23,406 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:07:23,406 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:07:23,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:07:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:07:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-23 13:07:23,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:23,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 63 states. [2018-11-23 13:07:23,430 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 63 states. [2018-11-23 13:07:23,430 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 63 states. [2018-11-23 13:07:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:23,432 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:07:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:07:23,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:23,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:23,433 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 64 states. [2018-11-23 13:07:23,433 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 64 states. [2018-11-23 13:07:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:23,434 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-11-23 13:07:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 13:07:23,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:23,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:23,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:23,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:07:23,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-11-23 13:07:23,435 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-11-23 13:07:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:23,435 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-11-23 13:07:23,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:07:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-11-23 13:07:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:07:23,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:23,436 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:23,436 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:23,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash 614656239, now seen corresponding path program 25 times [2018-11-23 13:07:23,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:23,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:23,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:24,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:07:24,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8336#true} is VALID [2018-11-23 13:07:24,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:07:24,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8336#true} #35#return; {8336#true} is VALID [2018-11-23 13:07:24,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {8336#true} call #t~ret4 := main(); {8336#true} is VALID [2018-11-23 13:07:24,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {8336#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8338#(= main_~i~0 0)} is VALID [2018-11-23 13:07:24,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {8338#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8338#(= main_~i~0 0)} is VALID [2018-11-23 13:07:24,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {8338#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:24,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:24,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {8339#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:24,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:24,410 INFO L273 TraceCheckUtils]: 11: Hoare triple {8340#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:24,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:24,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {8341#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:24,411 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:24,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {8342#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:24,412 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:24,413 INFO L273 TraceCheckUtils]: 17: Hoare triple {8343#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:24,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:24,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {8344#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:24,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:24,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:24,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:24,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {8346#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:24,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:24,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {8347#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:24,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:24,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {8348#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:24,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:24,421 INFO L273 TraceCheckUtils]: 29: Hoare triple {8349#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:24,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:24,422 INFO L273 TraceCheckUtils]: 31: Hoare triple {8350#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:24,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:24,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {8351#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:24,424 INFO L273 TraceCheckUtils]: 34: Hoare triple {8352#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:24,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {8352#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:24,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {8353#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:24,426 INFO L273 TraceCheckUtils]: 37: Hoare triple {8353#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:24,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {8354#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:24,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {8354#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:24,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {8355#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:24,428 INFO L273 TraceCheckUtils]: 41: Hoare triple {8355#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:24,429 INFO L273 TraceCheckUtils]: 42: Hoare triple {8356#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:24,430 INFO L273 TraceCheckUtils]: 43: Hoare triple {8356#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:24,430 INFO L273 TraceCheckUtils]: 44: Hoare triple {8357#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:24,431 INFO L273 TraceCheckUtils]: 45: Hoare triple {8357#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:24,431 INFO L273 TraceCheckUtils]: 46: Hoare triple {8358#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:24,432 INFO L273 TraceCheckUtils]: 47: Hoare triple {8358#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:24,433 INFO L273 TraceCheckUtils]: 48: Hoare triple {8359#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:24,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {8359#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:24,434 INFO L273 TraceCheckUtils]: 50: Hoare triple {8360#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:24,435 INFO L273 TraceCheckUtils]: 51: Hoare triple {8360#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:24,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {8361#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:24,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {8361#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:24,437 INFO L273 TraceCheckUtils]: 54: Hoare triple {8362#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:24,437 INFO L273 TraceCheckUtils]: 55: Hoare triple {8362#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8363#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:24,438 INFO L273 TraceCheckUtils]: 56: Hoare triple {8363#(<= main_~i~0 25)} assume !(~i~0 < 2048); {8337#false} is VALID [2018-11-23 13:07:24,438 INFO L273 TraceCheckUtils]: 57: Hoare triple {8337#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8337#false} is VALID [2018-11-23 13:07:24,438 INFO L256 TraceCheckUtils]: 58: Hoare triple {8337#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:07:24,439 INFO L273 TraceCheckUtils]: 59: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:07:24,439 INFO L273 TraceCheckUtils]: 60: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:07:24,439 INFO L273 TraceCheckUtils]: 61: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:07:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:24,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:24,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:24,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:24,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:24,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:07:24,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8336#true} is VALID [2018-11-23 13:07:24,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:07:24,695 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8336#true} #35#return; {8336#true} is VALID [2018-11-23 13:07:24,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {8336#true} call #t~ret4 := main(); {8336#true} is VALID [2018-11-23 13:07:24,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {8336#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8382#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:24,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {8382#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8382#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:24,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {8382#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:24,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8339#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:24,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {8339#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:24,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8340#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:24,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {8340#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:24,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8341#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:24,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {8341#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:24,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8342#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:24,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {8342#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:24,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8343#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:24,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {8343#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:24,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8344#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:24,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {8344#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:24,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8345#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:24,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:24,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8346#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:24,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {8346#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:24,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8347#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:24,708 INFO L273 TraceCheckUtils]: 25: Hoare triple {8347#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:24,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8348#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:24,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {8348#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:24,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8349#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:24,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {8349#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:24,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8350#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:24,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {8350#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:24,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8351#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:24,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {8351#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:24,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {8352#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8352#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:24,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {8352#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:24,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {8353#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8353#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:24,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {8353#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:24,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {8354#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8354#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:24,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {8354#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:24,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {8355#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8355#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:24,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {8355#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:24,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {8356#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8356#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:24,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {8356#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:24,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {8357#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8357#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:24,721 INFO L273 TraceCheckUtils]: 45: Hoare triple {8357#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:24,721 INFO L273 TraceCheckUtils]: 46: Hoare triple {8358#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8358#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:24,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {8358#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:24,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {8359#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8359#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:24,723 INFO L273 TraceCheckUtils]: 49: Hoare triple {8359#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:24,724 INFO L273 TraceCheckUtils]: 50: Hoare triple {8360#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8360#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:24,724 INFO L273 TraceCheckUtils]: 51: Hoare triple {8360#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:24,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {8361#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8361#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:24,726 INFO L273 TraceCheckUtils]: 53: Hoare triple {8361#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:24,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {8362#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8362#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:24,727 INFO L273 TraceCheckUtils]: 55: Hoare triple {8362#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8363#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:24,727 INFO L273 TraceCheckUtils]: 56: Hoare triple {8363#(<= main_~i~0 25)} assume !(~i~0 < 2048); {8337#false} is VALID [2018-11-23 13:07:24,728 INFO L273 TraceCheckUtils]: 57: Hoare triple {8337#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8337#false} is VALID [2018-11-23 13:07:24,728 INFO L256 TraceCheckUtils]: 58: Hoare triple {8337#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:07:24,728 INFO L273 TraceCheckUtils]: 59: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:07:24,728 INFO L273 TraceCheckUtils]: 60: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:07:24,729 INFO L273 TraceCheckUtils]: 61: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:07:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:24,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:24,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 13:07:24,751 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:07:24,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:24,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:07:24,816 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 13:07:24,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:07:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:07:24,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:07:24,818 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-11-23 13:07:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:25,228 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:07:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:07:25,228 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-11-23 13:07:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2018-11-23 13:07:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2018-11-23 13:07:25,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 72 transitions. [2018-11-23 13:07:25,301 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 13:07:25,302 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:07:25,303 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:07:25,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:07:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:07:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-23 13:07:25,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:25,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-23 13:07:25,331 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-23 13:07:25,331 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-23 13:07:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:25,332 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:07:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:07:25,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:25,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:25,332 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-23 13:07:25,332 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-23 13:07:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:25,333 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 13:07:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 13:07:25,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:25,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:25,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:25,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 13:07:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-23 13:07:25,335 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-11-23 13:07:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:25,336 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-23 13:07:25,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:07:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-23 13:07:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:07:25,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:25,337 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:25,337 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:25,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1433404433, now seen corresponding path program 26 times [2018-11-23 13:07:25,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:25,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:25,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:26,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {8887#true} call ULTIMATE.init(); {8887#true} is VALID [2018-11-23 13:07:26,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {8887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8887#true} is VALID [2018-11-23 13:07:26,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {8887#true} assume true; {8887#true} is VALID [2018-11-23 13:07:26,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8887#true} {8887#true} #35#return; {8887#true} is VALID [2018-11-23 13:07:26,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {8887#true} call #t~ret4 := main(); {8887#true} is VALID [2018-11-23 13:07:26,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {8887#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8889#(= main_~i~0 0)} is VALID [2018-11-23 13:07:26,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {8889#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8889#(= main_~i~0 0)} is VALID [2018-11-23 13:07:26,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {8889#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:26,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {8890#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:26,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {8890#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:26,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {8891#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:26,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {8891#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:26,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {8892#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:26,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {8892#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:26,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {8893#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:26,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {8893#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:26,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {8894#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:26,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {8894#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:26,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {8895#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:26,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {8895#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:26,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {8896#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:26,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {8896#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:26,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {8897#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:26,509 INFO L273 TraceCheckUtils]: 23: Hoare triple {8897#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:26,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {8898#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:26,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {8898#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:26,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {8899#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:26,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {8899#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:26,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {8900#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:26,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {8900#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:26,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {8901#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:26,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {8901#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:26,515 INFO L273 TraceCheckUtils]: 32: Hoare triple {8902#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:26,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {8902#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:26,516 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:26,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {8903#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:26,517 INFO L273 TraceCheckUtils]: 36: Hoare triple {8904#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:26,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {8904#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:26,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {8905#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:26,519 INFO L273 TraceCheckUtils]: 39: Hoare triple {8905#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:26,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {8906#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:26,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {8906#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:26,521 INFO L273 TraceCheckUtils]: 42: Hoare triple {8907#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:26,521 INFO L273 TraceCheckUtils]: 43: Hoare triple {8907#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:26,522 INFO L273 TraceCheckUtils]: 44: Hoare triple {8908#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:26,523 INFO L273 TraceCheckUtils]: 45: Hoare triple {8908#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:26,523 INFO L273 TraceCheckUtils]: 46: Hoare triple {8909#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:26,524 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:26,524 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:26,525 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:26,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:26,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:26,527 INFO L273 TraceCheckUtils]: 52: Hoare triple {8912#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:26,527 INFO L273 TraceCheckUtils]: 53: Hoare triple {8912#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:26,528 INFO L273 TraceCheckUtils]: 54: Hoare triple {8913#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:26,529 INFO L273 TraceCheckUtils]: 55: Hoare triple {8913#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:26,529 INFO L273 TraceCheckUtils]: 56: Hoare triple {8914#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:26,530 INFO L273 TraceCheckUtils]: 57: Hoare triple {8914#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:26,530 INFO L273 TraceCheckUtils]: 58: Hoare triple {8915#(<= main_~i~0 26)} assume !(~i~0 < 2048); {8888#false} is VALID [2018-11-23 13:07:26,531 INFO L273 TraceCheckUtils]: 59: Hoare triple {8888#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8888#false} is VALID [2018-11-23 13:07:26,531 INFO L256 TraceCheckUtils]: 60: Hoare triple {8888#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8888#false} is VALID [2018-11-23 13:07:26,531 INFO L273 TraceCheckUtils]: 61: Hoare triple {8888#false} ~cond := #in~cond; {8888#false} is VALID [2018-11-23 13:07:26,531 INFO L273 TraceCheckUtils]: 62: Hoare triple {8888#false} assume 0 == ~cond; {8888#false} is VALID [2018-11-23 13:07:26,531 INFO L273 TraceCheckUtils]: 63: Hoare triple {8888#false} assume !false; {8888#false} is VALID [2018-11-23 13:07:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:26,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:26,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:26,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:26,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:26,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:26,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:26,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {8887#true} call ULTIMATE.init(); {8887#true} is VALID [2018-11-23 13:07:26,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {8887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8887#true} is VALID [2018-11-23 13:07:26,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {8887#true} assume true; {8887#true} is VALID [2018-11-23 13:07:26,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8887#true} {8887#true} #35#return; {8887#true} is VALID [2018-11-23 13:07:26,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {8887#true} call #t~ret4 := main(); {8887#true} is VALID [2018-11-23 13:07:26,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {8887#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8934#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:26,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {8934#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8934#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:26,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {8934#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:26,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {8890#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8890#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:26,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {8890#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:26,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {8891#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8891#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:26,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {8891#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:26,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {8892#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8892#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:26,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {8892#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:26,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {8893#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8893#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:26,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {8893#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:26,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {8894#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8894#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:26,776 INFO L273 TraceCheckUtils]: 17: Hoare triple {8894#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:26,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {8895#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8895#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:26,777 INFO L273 TraceCheckUtils]: 19: Hoare triple {8895#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:26,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {8896#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8896#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:26,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {8896#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:26,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {8897#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8897#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:26,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {8897#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:26,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {8898#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8898#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:26,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {8898#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:26,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {8899#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8899#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:26,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {8899#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:26,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {8900#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8900#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:26,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {8900#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:26,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {8901#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8901#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:26,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {8901#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:26,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {8902#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8902#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:26,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {8902#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:26,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {8903#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8903#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:26,787 INFO L273 TraceCheckUtils]: 35: Hoare triple {8903#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:26,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {8904#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8904#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:26,788 INFO L273 TraceCheckUtils]: 37: Hoare triple {8904#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:26,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {8905#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8905#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:26,789 INFO L273 TraceCheckUtils]: 39: Hoare triple {8905#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:26,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {8906#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8906#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:26,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {8906#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:26,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {8907#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8907#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:26,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {8907#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:26,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {8908#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8908#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:26,793 INFO L273 TraceCheckUtils]: 45: Hoare triple {8908#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:26,793 INFO L273 TraceCheckUtils]: 46: Hoare triple {8909#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8909#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:26,794 INFO L273 TraceCheckUtils]: 47: Hoare triple {8909#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:26,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {8910#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8910#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:26,795 INFO L273 TraceCheckUtils]: 49: Hoare triple {8910#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:26,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {8911#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8911#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:26,796 INFO L273 TraceCheckUtils]: 51: Hoare triple {8911#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:26,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {8912#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8912#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:26,798 INFO L273 TraceCheckUtils]: 53: Hoare triple {8912#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:26,798 INFO L273 TraceCheckUtils]: 54: Hoare triple {8913#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8913#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:26,799 INFO L273 TraceCheckUtils]: 55: Hoare triple {8913#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:26,799 INFO L273 TraceCheckUtils]: 56: Hoare triple {8914#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8914#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:26,800 INFO L273 TraceCheckUtils]: 57: Hoare triple {8914#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8915#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:26,801 INFO L273 TraceCheckUtils]: 58: Hoare triple {8915#(<= main_~i~0 26)} assume !(~i~0 < 2048); {8888#false} is VALID [2018-11-23 13:07:26,801 INFO L273 TraceCheckUtils]: 59: Hoare triple {8888#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8888#false} is VALID [2018-11-23 13:07:26,801 INFO L256 TraceCheckUtils]: 60: Hoare triple {8888#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {8888#false} is VALID [2018-11-23 13:07:26,801 INFO L273 TraceCheckUtils]: 61: Hoare triple {8888#false} ~cond := #in~cond; {8888#false} is VALID [2018-11-23 13:07:26,801 INFO L273 TraceCheckUtils]: 62: Hoare triple {8888#false} assume 0 == ~cond; {8888#false} is VALID [2018-11-23 13:07:26,802 INFO L273 TraceCheckUtils]: 63: Hoare triple {8888#false} assume !false; {8888#false} is VALID [2018-11-23 13:07:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 13:07:26,826 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:07:26,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:26,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:07:26,889 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 13:07:26,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:07:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:07:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:07:26,891 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2018-11-23 13:07:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:27,201 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:07:27,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:07:27,201 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:07:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:07:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 74 transitions. [2018-11-23 13:07:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:07:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 74 transitions. [2018-11-23 13:07:27,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 74 transitions. [2018-11-23 13:07:27,496 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 13:07:27,497 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:07:27,497 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:07:27,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:07:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:07:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-23 13:07:27,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:27,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 67 states. [2018-11-23 13:07:27,587 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 67 states. [2018-11-23 13:07:27,587 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 67 states. [2018-11-23 13:07:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:27,588 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:07:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:07:27,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:27,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:27,589 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 68 states. [2018-11-23 13:07:27,589 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 68 states. [2018-11-23 13:07:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:27,591 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 13:07:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-23 13:07:27,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:27,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:27,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:27,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:07:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-11-23 13:07:27,593 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-11-23 13:07:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:27,593 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-11-23 13:07:27,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:07:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-11-23 13:07:27,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:07:27,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:27,594 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:27,594 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:27,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:27,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2023563597, now seen corresponding path program 27 times [2018-11-23 13:07:27,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:27,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:27,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:27,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:28,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {9455#true} call ULTIMATE.init(); {9455#true} is VALID [2018-11-23 13:07:28,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {9455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9455#true} is VALID [2018-11-23 13:07:28,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {9455#true} assume true; {9455#true} is VALID [2018-11-23 13:07:28,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9455#true} {9455#true} #35#return; {9455#true} is VALID [2018-11-23 13:07:28,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {9455#true} call #t~ret4 := main(); {9455#true} is VALID [2018-11-23 13:07:28,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9457#(= main_~i~0 0)} is VALID [2018-11-23 13:07:28,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {9457#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9457#(= main_~i~0 0)} is VALID [2018-11-23 13:07:28,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {9457#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:28,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {9458#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:28,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:28,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:28,291 INFO L273 TraceCheckUtils]: 11: Hoare triple {9459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:28,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {9460#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:28,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {9460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:28,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {9461#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:28,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {9461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:28,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {9462#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:28,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {9462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:28,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {9463#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:28,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {9463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:28,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {9464#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:28,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {9464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:28,298 INFO L273 TraceCheckUtils]: 22: Hoare triple {9465#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:28,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {9465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:28,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {9466#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:28,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {9466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:28,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {9467#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:28,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {9467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:28,303 INFO L273 TraceCheckUtils]: 28: Hoare triple {9468#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:28,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {9468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:28,304 INFO L273 TraceCheckUtils]: 30: Hoare triple {9469#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:28,305 INFO L273 TraceCheckUtils]: 31: Hoare triple {9469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:28,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {9470#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:28,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {9470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:28,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {9471#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:28,308 INFO L273 TraceCheckUtils]: 35: Hoare triple {9471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:28,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {9472#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:28,309 INFO L273 TraceCheckUtils]: 37: Hoare triple {9472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:28,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {9473#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:28,311 INFO L273 TraceCheckUtils]: 39: Hoare triple {9473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:28,312 INFO L273 TraceCheckUtils]: 40: Hoare triple {9474#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:28,312 INFO L273 TraceCheckUtils]: 41: Hoare triple {9474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:28,313 INFO L273 TraceCheckUtils]: 42: Hoare triple {9475#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:28,314 INFO L273 TraceCheckUtils]: 43: Hoare triple {9475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:28,314 INFO L273 TraceCheckUtils]: 44: Hoare triple {9476#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:28,315 INFO L273 TraceCheckUtils]: 45: Hoare triple {9476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:28,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {9477#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:28,317 INFO L273 TraceCheckUtils]: 47: Hoare triple {9477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:28,317 INFO L273 TraceCheckUtils]: 48: Hoare triple {9478#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:28,318 INFO L273 TraceCheckUtils]: 49: Hoare triple {9478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:28,319 INFO L273 TraceCheckUtils]: 50: Hoare triple {9479#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:28,320 INFO L273 TraceCheckUtils]: 51: Hoare triple {9479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:28,320 INFO L273 TraceCheckUtils]: 52: Hoare triple {9480#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:28,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {9480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:28,322 INFO L273 TraceCheckUtils]: 54: Hoare triple {9481#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:28,323 INFO L273 TraceCheckUtils]: 55: Hoare triple {9481#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:28,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {9482#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:28,324 INFO L273 TraceCheckUtils]: 57: Hoare triple {9482#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:28,325 INFO L273 TraceCheckUtils]: 58: Hoare triple {9483#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:28,326 INFO L273 TraceCheckUtils]: 59: Hoare triple {9483#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9484#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:28,326 INFO L273 TraceCheckUtils]: 60: Hoare triple {9484#(<= main_~i~0 27)} assume !(~i~0 < 2048); {9456#false} is VALID [2018-11-23 13:07:28,327 INFO L273 TraceCheckUtils]: 61: Hoare triple {9456#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9456#false} is VALID [2018-11-23 13:07:28,327 INFO L256 TraceCheckUtils]: 62: Hoare triple {9456#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9456#false} is VALID [2018-11-23 13:07:28,327 INFO L273 TraceCheckUtils]: 63: Hoare triple {9456#false} ~cond := #in~cond; {9456#false} is VALID [2018-11-23 13:07:28,327 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#false} assume 0 == ~cond; {9456#false} is VALID [2018-11-23 13:07:28,328 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#false} assume !false; {9456#false} is VALID [2018-11-23 13:07:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:28,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:28,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:28,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:37,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 13:07:37,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:37,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:37,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {9455#true} call ULTIMATE.init(); {9455#true} is VALID [2018-11-23 13:07:37,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {9455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9455#true} is VALID [2018-11-23 13:07:37,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {9455#true} assume true; {9455#true} is VALID [2018-11-23 13:07:37,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9455#true} {9455#true} #35#return; {9455#true} is VALID [2018-11-23 13:07:37,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {9455#true} call #t~ret4 := main(); {9455#true} is VALID [2018-11-23 13:07:37,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9503#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:37,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {9503#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9503#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:37,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {9503#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:37,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {9458#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9458#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:37,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:37,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {9459#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9459#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:37,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {9459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:37,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {9460#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9460#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:37,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {9460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:37,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {9461#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9461#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:37,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {9461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:37,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {9462#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9462#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:37,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {9462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:37,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {9463#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9463#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:37,804 INFO L273 TraceCheckUtils]: 19: Hoare triple {9463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:37,805 INFO L273 TraceCheckUtils]: 20: Hoare triple {9464#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:37,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {9464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:37,806 INFO L273 TraceCheckUtils]: 22: Hoare triple {9465#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9465#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:37,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {9465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:37,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {9466#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9466#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:37,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {9466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:37,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {9467#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9467#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:37,809 INFO L273 TraceCheckUtils]: 27: Hoare triple {9467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:37,810 INFO L273 TraceCheckUtils]: 28: Hoare triple {9468#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9468#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:37,810 INFO L273 TraceCheckUtils]: 29: Hoare triple {9468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:37,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {9469#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9469#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:37,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {9469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:37,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {9470#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9470#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:37,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {9470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:37,813 INFO L273 TraceCheckUtils]: 34: Hoare triple {9471#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9471#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:37,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {9471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:37,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {9472#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9472#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:37,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {9472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:37,816 INFO L273 TraceCheckUtils]: 38: Hoare triple {9473#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9473#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:37,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {9473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:37,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {9474#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9474#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:37,818 INFO L273 TraceCheckUtils]: 41: Hoare triple {9474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:37,819 INFO L273 TraceCheckUtils]: 42: Hoare triple {9475#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9475#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:37,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {9475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:37,820 INFO L273 TraceCheckUtils]: 44: Hoare triple {9476#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9476#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:37,821 INFO L273 TraceCheckUtils]: 45: Hoare triple {9476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:37,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {9477#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9477#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:37,822 INFO L273 TraceCheckUtils]: 47: Hoare triple {9477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:37,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {9478#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9478#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:37,823 INFO L273 TraceCheckUtils]: 49: Hoare triple {9478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:37,824 INFO L273 TraceCheckUtils]: 50: Hoare triple {9479#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9479#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:37,824 INFO L273 TraceCheckUtils]: 51: Hoare triple {9479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:37,825 INFO L273 TraceCheckUtils]: 52: Hoare triple {9480#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9480#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:37,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {9480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:37,826 INFO L273 TraceCheckUtils]: 54: Hoare triple {9481#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9481#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:37,827 INFO L273 TraceCheckUtils]: 55: Hoare triple {9481#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:37,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {9482#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9482#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:37,828 INFO L273 TraceCheckUtils]: 57: Hoare triple {9482#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:37,829 INFO L273 TraceCheckUtils]: 58: Hoare triple {9483#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9483#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:37,829 INFO L273 TraceCheckUtils]: 59: Hoare triple {9483#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9484#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:37,830 INFO L273 TraceCheckUtils]: 60: Hoare triple {9484#(<= main_~i~0 27)} assume !(~i~0 < 2048); {9456#false} is VALID [2018-11-23 13:07:37,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {9456#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9456#false} is VALID [2018-11-23 13:07:37,831 INFO L256 TraceCheckUtils]: 62: Hoare triple {9456#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {9456#false} is VALID [2018-11-23 13:07:37,831 INFO L273 TraceCheckUtils]: 63: Hoare triple {9456#false} ~cond := #in~cond; {9456#false} is VALID [2018-11-23 13:07:37,831 INFO L273 TraceCheckUtils]: 64: Hoare triple {9456#false} assume 0 == ~cond; {9456#false} is VALID [2018-11-23 13:07:37,831 INFO L273 TraceCheckUtils]: 65: Hoare triple {9456#false} assume !false; {9456#false} is VALID [2018-11-23 13:07:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:37,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:37,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 13:07:37,857 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-11-23 13:07:37,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:37,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:07:37,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:37,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:07:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:07:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:07:37,930 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-11-23 13:07:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:38,209 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:07:38,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:07:38,209 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-11-23 13:07:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:07:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2018-11-23 13:07:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:07:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 76 transitions. [2018-11-23 13:07:38,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 76 transitions. [2018-11-23 13:07:38,288 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 13:07:38,289 INFO L225 Difference]: With dead ends: 76 [2018-11-23 13:07:38,289 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:07:38,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:07:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:07:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 13:07:38,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:38,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 13:07:38,317 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 13:07:38,317 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 13:07:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:38,319 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:07:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:07:38,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:38,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:38,320 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 13:07:38,320 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 13:07:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:38,320 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-11-23 13:07:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-11-23 13:07:38,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:38,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:38,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:38,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:07:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-23 13:07:38,322 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-11-23 13:07:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:38,322 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-23 13:07:38,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:07:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-23 13:07:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 13:07:38,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:38,323 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:38,323 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:38,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 134846677, now seen corresponding path program 28 times [2018-11-23 13:07:38,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:38,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:38,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:38,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:38,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {10040#true} call ULTIMATE.init(); {10040#true} is VALID [2018-11-23 13:07:38,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {10040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10040#true} is VALID [2018-11-23 13:07:38,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {10040#true} assume true; {10040#true} is VALID [2018-11-23 13:07:38,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10040#true} {10040#true} #35#return; {10040#true} is VALID [2018-11-23 13:07:38,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {10040#true} call #t~ret4 := main(); {10040#true} is VALID [2018-11-23 13:07:38,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {10040#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10042#(= main_~i~0 0)} is VALID [2018-11-23 13:07:38,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {10042#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10042#(= main_~i~0 0)} is VALID [2018-11-23 13:07:38,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {10042#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:38,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {10043#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:38,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {10043#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:38,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {10044#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:38,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {10044#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:38,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {10045#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:38,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {10045#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:38,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {10046#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:38,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {10046#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:38,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {10047#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:38,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {10047#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:38,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {10048#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:38,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {10048#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:38,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {10049#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:38,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {10049#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:38,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {10050#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:38,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {10050#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:38,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {10051#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:38,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {10051#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:38,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {10052#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:38,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {10052#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:38,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {10053#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:38,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {10053#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:38,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {10054#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:38,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {10054#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:38,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {10055#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:38,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {10055#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:38,837 INFO L273 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:38,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:38,838 INFO L273 TraceCheckUtils]: 36: Hoare triple {10057#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:38,839 INFO L273 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:38,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {10058#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:38,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {10058#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:38,841 INFO L273 TraceCheckUtils]: 40: Hoare triple {10059#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:38,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {10059#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:38,842 INFO L273 TraceCheckUtils]: 42: Hoare triple {10060#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:38,843 INFO L273 TraceCheckUtils]: 43: Hoare triple {10060#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:38,844 INFO L273 TraceCheckUtils]: 44: Hoare triple {10061#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:38,844 INFO L273 TraceCheckUtils]: 45: Hoare triple {10061#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:38,845 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:38,846 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:38,846 INFO L273 TraceCheckUtils]: 48: Hoare triple {10063#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:38,847 INFO L273 TraceCheckUtils]: 49: Hoare triple {10063#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:38,847 INFO L273 TraceCheckUtils]: 50: Hoare triple {10064#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:38,848 INFO L273 TraceCheckUtils]: 51: Hoare triple {10064#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:38,849 INFO L273 TraceCheckUtils]: 52: Hoare triple {10065#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:38,849 INFO L273 TraceCheckUtils]: 53: Hoare triple {10065#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:38,850 INFO L273 TraceCheckUtils]: 54: Hoare triple {10066#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:38,851 INFO L273 TraceCheckUtils]: 55: Hoare triple {10066#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:38,851 INFO L273 TraceCheckUtils]: 56: Hoare triple {10067#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:38,852 INFO L273 TraceCheckUtils]: 57: Hoare triple {10067#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:38,852 INFO L273 TraceCheckUtils]: 58: Hoare triple {10068#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:38,853 INFO L273 TraceCheckUtils]: 59: Hoare triple {10068#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:38,854 INFO L273 TraceCheckUtils]: 60: Hoare triple {10069#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:38,854 INFO L273 TraceCheckUtils]: 61: Hoare triple {10069#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10070#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:38,855 INFO L273 TraceCheckUtils]: 62: Hoare triple {10070#(<= main_~i~0 28)} assume !(~i~0 < 2048); {10041#false} is VALID [2018-11-23 13:07:38,855 INFO L273 TraceCheckUtils]: 63: Hoare triple {10041#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10041#false} is VALID [2018-11-23 13:07:38,856 INFO L256 TraceCheckUtils]: 64: Hoare triple {10041#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10041#false} is VALID [2018-11-23 13:07:38,856 INFO L273 TraceCheckUtils]: 65: Hoare triple {10041#false} ~cond := #in~cond; {10041#false} is VALID [2018-11-23 13:07:38,856 INFO L273 TraceCheckUtils]: 66: Hoare triple {10041#false} assume 0 == ~cond; {10041#false} is VALID [2018-11-23 13:07:38,856 INFO L273 TraceCheckUtils]: 67: Hoare triple {10041#false} assume !false; {10041#false} is VALID [2018-11-23 13:07:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:38,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:38,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:38,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:38,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:39,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {10040#true} call ULTIMATE.init(); {10040#true} is VALID [2018-11-23 13:07:39,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {10040#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10040#true} is VALID [2018-11-23 13:07:39,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {10040#true} assume true; {10040#true} is VALID [2018-11-23 13:07:39,128 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10040#true} {10040#true} #35#return; {10040#true} is VALID [2018-11-23 13:07:39,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {10040#true} call #t~ret4 := main(); {10040#true} is VALID [2018-11-23 13:07:39,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {10040#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10089#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:39,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {10089#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10089#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:39,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {10089#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:39,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {10043#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10043#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:39,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {10043#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:39,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {10044#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10044#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:39,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {10044#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:39,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {10045#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10045#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:39,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {10045#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:39,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {10046#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10046#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:39,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {10046#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:39,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {10047#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10047#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:39,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {10047#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:39,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {10048#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10048#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:39,136 INFO L273 TraceCheckUtils]: 19: Hoare triple {10048#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:39,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {10049#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10049#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:39,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {10049#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:39,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {10050#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10050#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:39,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {10050#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:39,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {10051#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10051#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:39,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {10051#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:39,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {10052#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10052#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:39,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {10052#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:39,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {10053#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10053#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:39,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {10053#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:39,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {10054#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10054#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:39,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {10054#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:39,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {10055#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10055#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:39,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {10055#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:39,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {10056#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10056#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:39,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {10056#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:39,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {10057#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10057#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:39,147 INFO L273 TraceCheckUtils]: 37: Hoare triple {10057#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:39,148 INFO L273 TraceCheckUtils]: 38: Hoare triple {10058#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10058#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:39,149 INFO L273 TraceCheckUtils]: 39: Hoare triple {10058#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:39,149 INFO L273 TraceCheckUtils]: 40: Hoare triple {10059#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10059#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:39,150 INFO L273 TraceCheckUtils]: 41: Hoare triple {10059#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:39,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {10060#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10060#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:39,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {10060#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:39,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {10061#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10061#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:39,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {10061#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:39,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {10062#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10062#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:39,154 INFO L273 TraceCheckUtils]: 47: Hoare triple {10062#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:39,154 INFO L273 TraceCheckUtils]: 48: Hoare triple {10063#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10063#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:39,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {10063#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:39,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {10064#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10064#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:39,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {10064#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:39,157 INFO L273 TraceCheckUtils]: 52: Hoare triple {10065#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10065#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:39,158 INFO L273 TraceCheckUtils]: 53: Hoare triple {10065#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:39,158 INFO L273 TraceCheckUtils]: 54: Hoare triple {10066#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10066#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:39,159 INFO L273 TraceCheckUtils]: 55: Hoare triple {10066#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:39,159 INFO L273 TraceCheckUtils]: 56: Hoare triple {10067#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10067#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:39,160 INFO L273 TraceCheckUtils]: 57: Hoare triple {10067#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:39,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {10068#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10068#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:39,161 INFO L273 TraceCheckUtils]: 59: Hoare triple {10068#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:39,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {10069#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10069#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:39,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {10069#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10070#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:39,163 INFO L273 TraceCheckUtils]: 62: Hoare triple {10070#(<= main_~i~0 28)} assume !(~i~0 < 2048); {10041#false} is VALID [2018-11-23 13:07:39,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {10041#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10041#false} is VALID [2018-11-23 13:07:39,164 INFO L256 TraceCheckUtils]: 64: Hoare triple {10041#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10041#false} is VALID [2018-11-23 13:07:39,164 INFO L273 TraceCheckUtils]: 65: Hoare triple {10041#false} ~cond := #in~cond; {10041#false} is VALID [2018-11-23 13:07:39,164 INFO L273 TraceCheckUtils]: 66: Hoare triple {10041#false} assume 0 == ~cond; {10041#false} is VALID [2018-11-23 13:07:39,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {10041#false} assume !false; {10041#false} is VALID [2018-11-23 13:07:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:39,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:39,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 13:07:39,187 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-11-23 13:07:39,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:39,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 13:07:39,273 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 13:07:39,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 13:07:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:07:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:07:39,274 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2018-11-23 13:07:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:39,781 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:07:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:07:39,781 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-11-23 13:07:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:07:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2018-11-23 13:07:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:07:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2018-11-23 13:07:39,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2018-11-23 13:07:39,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:39,863 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:07:39,863 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 13:07:39,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:07:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 13:07:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 13:07:39,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:39,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 13:07:39,891 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 13:07:39,891 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 13:07:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:39,892 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:07:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:07:39,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:39,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:39,893 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 13:07:39,893 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 13:07:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:39,894 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 13:07:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-23 13:07:39,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:39,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:39,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:39,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 13:07:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-23 13:07:39,896 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-11-23 13:07:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:39,896 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-23 13:07:39,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:07:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-23 13:07:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:07:39,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:39,897 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:39,898 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:39,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash -102083977, now seen corresponding path program 29 times [2018-11-23 13:07:39,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:39,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:39,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:39,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:39,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:40,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2018-11-23 13:07:40,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {10642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10642#true} is VALID [2018-11-23 13:07:40,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2018-11-23 13:07:40,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #35#return; {10642#true} is VALID [2018-11-23 13:07:40,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret4 := main(); {10642#true} is VALID [2018-11-23 13:07:40,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {10642#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10644#(= main_~i~0 0)} is VALID [2018-11-23 13:07:40,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {10644#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10644#(= main_~i~0 0)} is VALID [2018-11-23 13:07:40,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {10644#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:40,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {10645#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:40,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {10645#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:40,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {10646#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:40,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {10646#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:40,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {10647#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:40,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {10647#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:40,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {10648#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:40,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {10648#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:40,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {10649#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:40,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {10649#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:40,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {10650#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:40,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {10650#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:40,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {10651#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:40,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {10651#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:40,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {10652#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:40,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {10652#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:40,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {10653#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:40,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {10653#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:40,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {10654#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:40,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {10654#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:40,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {10655#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:40,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {10655#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:40,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {10656#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:40,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {10656#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:40,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {10657#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:40,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {10657#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:40,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {10658#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:40,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {10658#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:40,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {10659#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:40,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {10659#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:40,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {10660#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:40,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {10660#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:40,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {10661#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:40,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {10661#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:40,619 INFO L273 TraceCheckUtils]: 42: Hoare triple {10662#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:40,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {10662#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:40,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {10663#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:40,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {10663#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:40,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {10664#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:40,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {10664#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:40,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {10665#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:40,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {10665#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:40,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {10666#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:40,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {10666#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:40,625 INFO L273 TraceCheckUtils]: 52: Hoare triple {10667#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:40,626 INFO L273 TraceCheckUtils]: 53: Hoare triple {10667#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:40,626 INFO L273 TraceCheckUtils]: 54: Hoare triple {10668#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:40,627 INFO L273 TraceCheckUtils]: 55: Hoare triple {10668#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:40,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {10669#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:40,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {10669#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:40,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {10670#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:40,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {10670#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:40,630 INFO L273 TraceCheckUtils]: 60: Hoare triple {10671#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:40,631 INFO L273 TraceCheckUtils]: 61: Hoare triple {10671#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:40,631 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:40,632 INFO L273 TraceCheckUtils]: 63: Hoare triple {10672#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10673#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:40,632 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 29)} assume !(~i~0 < 2048); {10643#false} is VALID [2018-11-23 13:07:40,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {10643#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10643#false} is VALID [2018-11-23 13:07:40,633 INFO L256 TraceCheckUtils]: 66: Hoare triple {10643#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10643#false} is VALID [2018-11-23 13:07:40,633 INFO L273 TraceCheckUtils]: 67: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2018-11-23 13:07:40,633 INFO L273 TraceCheckUtils]: 68: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2018-11-23 13:07:40,633 INFO L273 TraceCheckUtils]: 69: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2018-11-23 13:07:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:40,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:40,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:40,647 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:43,534 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 13:07:43,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:43,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:43,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2018-11-23 13:07:43,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {10642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10642#true} is VALID [2018-11-23 13:07:43,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2018-11-23 13:07:43,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #35#return; {10642#true} is VALID [2018-11-23 13:07:43,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret4 := main(); {10642#true} is VALID [2018-11-23 13:07:43,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {10642#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10692#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:43,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {10692#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10692#(<= main_~i~0 0)} is VALID [2018-11-23 13:07:43,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {10692#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:43,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {10645#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10645#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:43,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {10645#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:43,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {10646#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10646#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:43,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {10646#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:43,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {10647#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10647#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:43,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {10647#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:43,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {10648#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10648#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:43,770 INFO L273 TraceCheckUtils]: 15: Hoare triple {10648#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:43,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {10649#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10649#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:43,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {10649#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:43,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {10650#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10650#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:43,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {10650#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:43,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {10651#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10651#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:43,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {10651#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:43,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {10652#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10652#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:43,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {10652#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:43,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {10653#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10653#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:43,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {10653#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:43,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {10654#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10654#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:43,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {10654#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:43,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {10655#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10655#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:43,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {10655#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:43,779 INFO L273 TraceCheckUtils]: 30: Hoare triple {10656#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10656#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:43,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {10656#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:43,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {10657#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10657#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:43,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {10657#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:43,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {10658#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10658#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:43,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {10658#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:43,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {10659#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10659#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:43,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {10659#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:43,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {10660#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10660#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:43,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {10660#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:43,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {10661#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10661#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:43,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {10661#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:43,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {10662#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10662#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:43,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {10662#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:43,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {10663#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10663#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:43,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {10663#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:43,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {10664#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10664#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:43,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {10664#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:43,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {10665#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10665#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:43,791 INFO L273 TraceCheckUtils]: 49: Hoare triple {10665#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:43,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {10666#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10666#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:43,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {10666#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:43,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {10667#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10667#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:43,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {10667#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:43,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {10668#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10668#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:43,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {10668#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:43,795 INFO L273 TraceCheckUtils]: 56: Hoare triple {10669#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:43,795 INFO L273 TraceCheckUtils]: 57: Hoare triple {10669#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:43,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {10670#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:43,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {10670#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:43,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {10671#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:43,798 INFO L273 TraceCheckUtils]: 61: Hoare triple {10671#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:43,798 INFO L273 TraceCheckUtils]: 62: Hoare triple {10672#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:43,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {10672#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10673#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:43,800 INFO L273 TraceCheckUtils]: 64: Hoare triple {10673#(<= main_~i~0 29)} assume !(~i~0 < 2048); {10643#false} is VALID [2018-11-23 13:07:43,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {10643#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10643#false} is VALID [2018-11-23 13:07:43,800 INFO L256 TraceCheckUtils]: 66: Hoare triple {10643#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {10643#false} is VALID [2018-11-23 13:07:43,800 INFO L273 TraceCheckUtils]: 67: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2018-11-23 13:07:43,800 INFO L273 TraceCheckUtils]: 68: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2018-11-23 13:07:43,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2018-11-23 13:07:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:43,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:43,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 13:07:43,827 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-11-23 13:07:43,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:43,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:07:43,913 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 13:07:43,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:07:43,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:07:43,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:07:43,915 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-11-23 13:07:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:44,368 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:07:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:07:44,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-11-23 13:07:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:07:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2018-11-23 13:07:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:07:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2018-11-23 13:07:44,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 80 transitions. [2018-11-23 13:07:44,693 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 13:07:44,694 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:07:44,695 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:07:44,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:07:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:07:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-23 13:07:44,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:44,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-23 13:07:44,737 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-23 13:07:44,737 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-23 13:07:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:44,738 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:07:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:07:44,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:44,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:44,739 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-23 13:07:44,739 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-23 13:07:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:44,740 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-11-23 13:07:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 13:07:44,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:44,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:44,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:44,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:07:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-11-23 13:07:44,741 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-11-23 13:07:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:44,742 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-11-23 13:07:44,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:07:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-11-23 13:07:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:07:44,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:44,742 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:44,743 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:44,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash -159175783, now seen corresponding path program 30 times [2018-11-23 13:07:44,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:44,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:46,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {11261#true} call ULTIMATE.init(); {11261#true} is VALID [2018-11-23 13:07:46,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {11261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11261#true} is VALID [2018-11-23 13:07:46,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {11261#true} assume true; {11261#true} is VALID [2018-11-23 13:07:46,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11261#true} {11261#true} #35#return; {11261#true} is VALID [2018-11-23 13:07:46,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {11261#true} call #t~ret4 := main(); {11261#true} is VALID [2018-11-23 13:07:46,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {11261#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11263#(= main_~i~0 0)} is VALID [2018-11-23 13:07:46,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {11263#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11263#(= main_~i~0 0)} is VALID [2018-11-23 13:07:46,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {11263#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:46,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {11264#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:07:46,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {11264#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:46,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {11265#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:07:46,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {11265#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:46,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {11266#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:07:46,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {11266#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:46,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {11267#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:07:46,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {11267#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:46,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {11268#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:07:46,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {11268#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:46,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {11269#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:07:46,525 INFO L273 TraceCheckUtils]: 19: Hoare triple {11269#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:46,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {11270#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:07:46,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {11270#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:46,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {11271#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:07:46,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {11271#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:46,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {11272#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:07:46,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {11272#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:46,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {11273#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:07:46,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {11273#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:46,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {11274#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:07:46,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {11274#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:46,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {11275#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:07:46,533 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:46,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:07:46,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:46,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:07:46,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:46,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {11278#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:07:46,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {11278#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:46,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {11279#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:07:46,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {11279#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:46,538 INFO L273 TraceCheckUtils]: 40: Hoare triple {11280#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:07:46,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {11280#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:46,539 INFO L273 TraceCheckUtils]: 42: Hoare triple {11281#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:07:46,540 INFO L273 TraceCheckUtils]: 43: Hoare triple {11281#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:46,541 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:07:46,542 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:46,542 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:07:46,543 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:46,543 INFO L273 TraceCheckUtils]: 48: Hoare triple {11284#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:07:46,544 INFO L273 TraceCheckUtils]: 49: Hoare triple {11284#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:46,545 INFO L273 TraceCheckUtils]: 50: Hoare triple {11285#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:07:46,545 INFO L273 TraceCheckUtils]: 51: Hoare triple {11285#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:46,546 INFO L273 TraceCheckUtils]: 52: Hoare triple {11286#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:07:46,547 INFO L273 TraceCheckUtils]: 53: Hoare triple {11286#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:46,547 INFO L273 TraceCheckUtils]: 54: Hoare triple {11287#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:07:46,548 INFO L273 TraceCheckUtils]: 55: Hoare triple {11287#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:46,548 INFO L273 TraceCheckUtils]: 56: Hoare triple {11288#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:07:46,549 INFO L273 TraceCheckUtils]: 57: Hoare triple {11288#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:46,550 INFO L273 TraceCheckUtils]: 58: Hoare triple {11289#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:07:46,550 INFO L273 TraceCheckUtils]: 59: Hoare triple {11289#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:46,551 INFO L273 TraceCheckUtils]: 60: Hoare triple {11290#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:07:46,552 INFO L273 TraceCheckUtils]: 61: Hoare triple {11290#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:46,552 INFO L273 TraceCheckUtils]: 62: Hoare triple {11291#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:07:46,553 INFO L273 TraceCheckUtils]: 63: Hoare triple {11291#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:46,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {11292#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:07:46,554 INFO L273 TraceCheckUtils]: 65: Hoare triple {11292#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 30)} is VALID [2018-11-23 13:07:46,555 INFO L273 TraceCheckUtils]: 66: Hoare triple {11293#(<= main_~i~0 30)} assume !(~i~0 < 2048); {11262#false} is VALID [2018-11-23 13:07:46,555 INFO L273 TraceCheckUtils]: 67: Hoare triple {11262#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11262#false} is VALID [2018-11-23 13:07:46,555 INFO L256 TraceCheckUtils]: 68: Hoare triple {11262#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11262#false} is VALID [2018-11-23 13:07:46,556 INFO L273 TraceCheckUtils]: 69: Hoare triple {11262#false} ~cond := #in~cond; {11262#false} is VALID [2018-11-23 13:07:46,556 INFO L273 TraceCheckUtils]: 70: Hoare triple {11262#false} assume 0 == ~cond; {11262#false} is VALID [2018-11-23 13:07:46,556 INFO L273 TraceCheckUtils]: 71: Hoare triple {11262#false} assume !false; {11262#false} is VALID [2018-11-23 13:07:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:46,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:46,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:46,569 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:08:00,097 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 13:08:00,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:00,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:00,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {11261#true} call ULTIMATE.init(); {11261#true} is VALID [2018-11-23 13:08:00,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {11261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11261#true} is VALID [2018-11-23 13:08:00,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {11261#true} assume true; {11261#true} is VALID [2018-11-23 13:08:00,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11261#true} {11261#true} #35#return; {11261#true} is VALID [2018-11-23 13:08:00,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {11261#true} call #t~ret4 := main(); {11261#true} is VALID [2018-11-23 13:08:00,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {11261#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11312#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:00,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {11312#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11312#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:00,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {11312#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:00,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {11264#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11264#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:00,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {11264#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:00,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {11265#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11265#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:00,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {11265#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:00,432 INFO L273 TraceCheckUtils]: 12: Hoare triple {11266#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11266#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:00,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {11266#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:00,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {11267#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11267#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:00,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {11267#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:00,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {11268#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11268#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:00,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {11268#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:00,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {11269#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11269#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:00,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {11269#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:00,437 INFO L273 TraceCheckUtils]: 20: Hoare triple {11270#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11270#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:00,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {11270#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:00,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {11271#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11271#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:00,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {11271#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:00,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {11272#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11272#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:00,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {11272#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:00,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {11273#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11273#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:00,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {11273#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:00,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {11274#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11274#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:00,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {11274#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:00,443 INFO L273 TraceCheckUtils]: 30: Hoare triple {11275#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11275#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:00,444 INFO L273 TraceCheckUtils]: 31: Hoare triple {11275#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:00,444 INFO L273 TraceCheckUtils]: 32: Hoare triple {11276#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11276#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:00,445 INFO L273 TraceCheckUtils]: 33: Hoare triple {11276#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:00,446 INFO L273 TraceCheckUtils]: 34: Hoare triple {11277#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11277#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:00,446 INFO L273 TraceCheckUtils]: 35: Hoare triple {11277#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:00,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {11278#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11278#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:00,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {11278#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:00,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {11279#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11279#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:00,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {11279#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:00,450 INFO L273 TraceCheckUtils]: 40: Hoare triple {11280#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11280#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:00,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {11280#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:00,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {11281#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11281#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:00,452 INFO L273 TraceCheckUtils]: 43: Hoare triple {11281#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:00,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {11282#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11282#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:00,453 INFO L273 TraceCheckUtils]: 45: Hoare triple {11282#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:00,453 INFO L273 TraceCheckUtils]: 46: Hoare triple {11283#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11283#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:00,454 INFO L273 TraceCheckUtils]: 47: Hoare triple {11283#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:00,455 INFO L273 TraceCheckUtils]: 48: Hoare triple {11284#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11284#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:00,455 INFO L273 TraceCheckUtils]: 49: Hoare triple {11284#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:00,456 INFO L273 TraceCheckUtils]: 50: Hoare triple {11285#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11285#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:00,457 INFO L273 TraceCheckUtils]: 51: Hoare triple {11285#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:00,457 INFO L273 TraceCheckUtils]: 52: Hoare triple {11286#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11286#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:00,458 INFO L273 TraceCheckUtils]: 53: Hoare triple {11286#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:00,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {11287#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11287#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:00,459 INFO L273 TraceCheckUtils]: 55: Hoare triple {11287#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:00,460 INFO L273 TraceCheckUtils]: 56: Hoare triple {11288#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11288#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:00,460 INFO L273 TraceCheckUtils]: 57: Hoare triple {11288#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:00,461 INFO L273 TraceCheckUtils]: 58: Hoare triple {11289#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11289#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:00,462 INFO L273 TraceCheckUtils]: 59: Hoare triple {11289#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:00,462 INFO L273 TraceCheckUtils]: 60: Hoare triple {11290#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11290#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:00,463 INFO L273 TraceCheckUtils]: 61: Hoare triple {11290#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:00,463 INFO L273 TraceCheckUtils]: 62: Hoare triple {11291#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11291#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:00,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {11291#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:00,465 INFO L273 TraceCheckUtils]: 64: Hoare triple {11292#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11292#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:00,465 INFO L273 TraceCheckUtils]: 65: Hoare triple {11292#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11293#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:00,466 INFO L273 TraceCheckUtils]: 66: Hoare triple {11293#(<= main_~i~0 30)} assume !(~i~0 < 2048); {11262#false} is VALID [2018-11-23 13:08:00,466 INFO L273 TraceCheckUtils]: 67: Hoare triple {11262#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11262#false} is VALID [2018-11-23 13:08:00,466 INFO L256 TraceCheckUtils]: 68: Hoare triple {11262#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11262#false} is VALID [2018-11-23 13:08:00,467 INFO L273 TraceCheckUtils]: 69: Hoare triple {11262#false} ~cond := #in~cond; {11262#false} is VALID [2018-11-23 13:08:00,467 INFO L273 TraceCheckUtils]: 70: Hoare triple {11262#false} assume 0 == ~cond; {11262#false} is VALID [2018-11-23 13:08:00,467 INFO L273 TraceCheckUtils]: 71: Hoare triple {11262#false} assume !false; {11262#false} is VALID [2018-11-23 13:08:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:00,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:00,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 13:08:00,495 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:08:00,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:00,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:08:00,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:00,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:08:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:08:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:08:00,613 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2018-11-23 13:08:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:01,308 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:08:01,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:08:01,309 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:08:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:08:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 82 transitions. [2018-11-23 13:08:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:08:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 82 transitions. [2018-11-23 13:08:01,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 82 transitions. [2018-11-23 13:08:01,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:01,388 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:08:01,388 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:08:01,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:08:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:08:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 13:08:01,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:01,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 13:08:01,413 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 13:08:01,414 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 13:08:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:01,415 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:08:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:08:01,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:01,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:01,416 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 13:08:01,416 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 13:08:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:01,417 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 13:08:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 13:08:01,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:01,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:01,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:01,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:08:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-11-23 13:08:01,419 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-11-23 13:08:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:01,420 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-11-23 13:08:01,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 13:08:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-11-23 13:08:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 13:08:01,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:01,420 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:01,421 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:01,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:01,421 INFO L82 PathProgramCache]: Analyzing trace with hash 810173499, now seen corresponding path program 31 times [2018-11-23 13:08:01,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:01,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:01,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:01,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 13:08:01,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 13:08:01,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 13:08:01,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #35#return; {11897#true} is VALID [2018-11-23 13:08:01,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret4 := main(); {11897#true} is VALID [2018-11-23 13:08:01,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11899#(= main_~i~0 0)} is VALID [2018-11-23 13:08:01,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {11899#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11899#(= main_~i~0 0)} is VALID [2018-11-23 13:08:01,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {11899#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:01,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {11900#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:01,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {11900#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:01,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {11901#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:01,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {11901#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:01,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {11902#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:01,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {11902#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:01,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {11903#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:01,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {11903#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:01,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {11904#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:01,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {11904#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:01,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {11905#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:01,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {11905#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:01,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {11906#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:01,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {11906#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:01,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {11907#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:01,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {11907#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:01,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {11908#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:01,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {11908#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:01,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {11909#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:01,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {11909#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:01,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {11910#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:01,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {11910#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:01,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {11911#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:01,996 INFO L273 TraceCheckUtils]: 31: Hoare triple {11911#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:01,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {11912#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:01,997 INFO L273 TraceCheckUtils]: 33: Hoare triple {11912#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:01,998 INFO L273 TraceCheckUtils]: 34: Hoare triple {11913#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:01,998 INFO L273 TraceCheckUtils]: 35: Hoare triple {11913#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:01,999 INFO L273 TraceCheckUtils]: 36: Hoare triple {11914#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:02,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {11914#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:02,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {11915#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:02,001 INFO L273 TraceCheckUtils]: 39: Hoare triple {11915#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:02,001 INFO L273 TraceCheckUtils]: 40: Hoare triple {11916#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:02,002 INFO L273 TraceCheckUtils]: 41: Hoare triple {11916#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:02,003 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:02,003 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:02,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:02,005 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:02,005 INFO L273 TraceCheckUtils]: 46: Hoare triple {11919#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:02,006 INFO L273 TraceCheckUtils]: 47: Hoare triple {11919#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:02,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {11920#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:02,007 INFO L273 TraceCheckUtils]: 49: Hoare triple {11920#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:02,008 INFO L273 TraceCheckUtils]: 50: Hoare triple {11921#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:02,008 INFO L273 TraceCheckUtils]: 51: Hoare triple {11921#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:02,009 INFO L273 TraceCheckUtils]: 52: Hoare triple {11922#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:02,010 INFO L273 TraceCheckUtils]: 53: Hoare triple {11922#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:02,010 INFO L273 TraceCheckUtils]: 54: Hoare triple {11923#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:02,011 INFO L273 TraceCheckUtils]: 55: Hoare triple {11923#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:02,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {11924#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:02,012 INFO L273 TraceCheckUtils]: 57: Hoare triple {11924#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:02,013 INFO L273 TraceCheckUtils]: 58: Hoare triple {11925#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:02,014 INFO L273 TraceCheckUtils]: 59: Hoare triple {11925#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:02,014 INFO L273 TraceCheckUtils]: 60: Hoare triple {11926#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:02,015 INFO L273 TraceCheckUtils]: 61: Hoare triple {11926#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:02,015 INFO L273 TraceCheckUtils]: 62: Hoare triple {11927#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:02,016 INFO L273 TraceCheckUtils]: 63: Hoare triple {11927#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:02,017 INFO L273 TraceCheckUtils]: 64: Hoare triple {11928#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:02,017 INFO L273 TraceCheckUtils]: 65: Hoare triple {11928#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:02,018 INFO L273 TraceCheckUtils]: 66: Hoare triple {11929#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:02,019 INFO L273 TraceCheckUtils]: 67: Hoare triple {11929#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11930#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:02,019 INFO L273 TraceCheckUtils]: 68: Hoare triple {11930#(<= main_~i~0 31)} assume !(~i~0 < 2048); {11898#false} is VALID [2018-11-23 13:08:02,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11898#false} is VALID [2018-11-23 13:08:02,020 INFO L256 TraceCheckUtils]: 70: Hoare triple {11898#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11898#false} is VALID [2018-11-23 13:08:02,020 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 13:08:02,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 13:08:02,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 13:08:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:02,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:02,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:02,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:02,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {11897#true} call ULTIMATE.init(); {11897#true} is VALID [2018-11-23 13:08:02,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {11897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11897#true} is VALID [2018-11-23 13:08:02,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {11897#true} assume true; {11897#true} is VALID [2018-11-23 13:08:02,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11897#true} {11897#true} #35#return; {11897#true} is VALID [2018-11-23 13:08:02,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {11897#true} call #t~ret4 := main(); {11897#true} is VALID [2018-11-23 13:08:02,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {11897#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11949#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:02,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {11949#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11949#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:02,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {11949#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:02,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {11900#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11900#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:02,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {11900#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:02,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {11901#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11901#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:02,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {11901#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:02,311 INFO L273 TraceCheckUtils]: 12: Hoare triple {11902#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11902#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:02,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {11902#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:02,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {11903#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11903#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:02,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {11903#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:02,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {11904#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11904#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:02,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {11904#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:02,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {11905#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11905#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:02,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {11905#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:02,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {11906#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11906#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:02,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {11906#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:02,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {11907#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11907#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:02,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {11907#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:02,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {11908#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11908#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:02,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {11908#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:02,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {11909#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11909#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:02,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {11909#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:02,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {11910#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11910#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:02,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {11910#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:02,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {11911#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11911#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:02,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {11911#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:02,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {11912#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11912#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:02,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {11912#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:02,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {11913#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11913#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:02,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {11913#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:02,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {11914#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11914#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:02,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {11914#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:02,327 INFO L273 TraceCheckUtils]: 38: Hoare triple {11915#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11915#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:02,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {11915#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:02,328 INFO L273 TraceCheckUtils]: 40: Hoare triple {11916#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11916#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:02,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {11916#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:02,347 INFO L273 TraceCheckUtils]: 42: Hoare triple {11917#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11917#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:02,357 INFO L273 TraceCheckUtils]: 43: Hoare triple {11917#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:02,358 INFO L273 TraceCheckUtils]: 44: Hoare triple {11918#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11918#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:02,358 INFO L273 TraceCheckUtils]: 45: Hoare triple {11918#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:02,359 INFO L273 TraceCheckUtils]: 46: Hoare triple {11919#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11919#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:02,359 INFO L273 TraceCheckUtils]: 47: Hoare triple {11919#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:02,359 INFO L273 TraceCheckUtils]: 48: Hoare triple {11920#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11920#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:02,360 INFO L273 TraceCheckUtils]: 49: Hoare triple {11920#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:02,360 INFO L273 TraceCheckUtils]: 50: Hoare triple {11921#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11921#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:02,361 INFO L273 TraceCheckUtils]: 51: Hoare triple {11921#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:02,361 INFO L273 TraceCheckUtils]: 52: Hoare triple {11922#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11922#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:02,361 INFO L273 TraceCheckUtils]: 53: Hoare triple {11922#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:02,362 INFO L273 TraceCheckUtils]: 54: Hoare triple {11923#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11923#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:02,362 INFO L273 TraceCheckUtils]: 55: Hoare triple {11923#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:02,363 INFO L273 TraceCheckUtils]: 56: Hoare triple {11924#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11924#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:02,364 INFO L273 TraceCheckUtils]: 57: Hoare triple {11924#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:02,364 INFO L273 TraceCheckUtils]: 58: Hoare triple {11925#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11925#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:02,365 INFO L273 TraceCheckUtils]: 59: Hoare triple {11925#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:02,365 INFO L273 TraceCheckUtils]: 60: Hoare triple {11926#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11926#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:02,366 INFO L273 TraceCheckUtils]: 61: Hoare triple {11926#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:02,367 INFO L273 TraceCheckUtils]: 62: Hoare triple {11927#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11927#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:02,367 INFO L273 TraceCheckUtils]: 63: Hoare triple {11927#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:02,368 INFO L273 TraceCheckUtils]: 64: Hoare triple {11928#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11928#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:02,368 INFO L273 TraceCheckUtils]: 65: Hoare triple {11928#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:02,369 INFO L273 TraceCheckUtils]: 66: Hoare triple {11929#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11929#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:02,370 INFO L273 TraceCheckUtils]: 67: Hoare triple {11929#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11930#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:02,370 INFO L273 TraceCheckUtils]: 68: Hoare triple {11930#(<= main_~i~0 31)} assume !(~i~0 < 2048); {11898#false} is VALID [2018-11-23 13:08:02,370 INFO L273 TraceCheckUtils]: 69: Hoare triple {11898#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11898#false} is VALID [2018-11-23 13:08:02,371 INFO L256 TraceCheckUtils]: 70: Hoare triple {11898#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {11898#false} is VALID [2018-11-23 13:08:02,371 INFO L273 TraceCheckUtils]: 71: Hoare triple {11898#false} ~cond := #in~cond; {11898#false} is VALID [2018-11-23 13:08:02,371 INFO L273 TraceCheckUtils]: 72: Hoare triple {11898#false} assume 0 == ~cond; {11898#false} is VALID [2018-11-23 13:08:02,371 INFO L273 TraceCheckUtils]: 73: Hoare triple {11898#false} assume !false; {11898#false} is VALID [2018-11-23 13:08:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:02,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:02,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 13:08:02,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-11-23 13:08:02,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:02,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 13:08:02,473 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 13:08:02,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 13:08:02,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 13:08:02,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:08:02,475 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-11-23 13:08:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:02,874 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:08:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:08:02,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-11-23 13:08:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:08:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 84 transitions. [2018-11-23 13:08:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:08:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 84 transitions. [2018-11-23 13:08:02,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 84 transitions. [2018-11-23 13:08:02,962 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 13:08:02,964 INFO L225 Difference]: With dead ends: 84 [2018-11-23 13:08:02,964 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 13:08:02,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:08:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 13:08:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 13:08:03,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:03,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 13:08:03,015 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 13:08:03,016 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 13:08:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:03,016 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:08:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:08:03,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:03,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:03,017 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 13:08:03,017 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 13:08:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:03,018 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 13:08:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-11-23 13:08:03,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:03,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:03,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:03,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:08:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-23 13:08:03,019 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-11-23 13:08:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:03,020 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-23 13:08:03,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 13:08:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-23 13:08:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 13:08:03,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:03,021 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:03,021 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:03,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash 346930269, now seen corresponding path program 32 times [2018-11-23 13:08:03,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:03,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:03,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:03,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:03,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {12550#true} call ULTIMATE.init(); {12550#true} is VALID [2018-11-23 13:08:03,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {12550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12550#true} is VALID [2018-11-23 13:08:03,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {12550#true} assume true; {12550#true} is VALID [2018-11-23 13:08:03,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12550#true} {12550#true} #35#return; {12550#true} is VALID [2018-11-23 13:08:03,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {12550#true} call #t~ret4 := main(); {12550#true} is VALID [2018-11-23 13:08:03,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {12550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12552#(= main_~i~0 0)} is VALID [2018-11-23 13:08:03,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {12552#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12552#(= main_~i~0 0)} is VALID [2018-11-23 13:08:03,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {12552#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:03,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {12553#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:03,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {12553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:03,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {12554#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:03,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {12554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:03,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {12555#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:03,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {12555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:03,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {12556#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:03,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {12556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:03,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {12557#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:03,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {12557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:03,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {12558#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:03,976 INFO L273 TraceCheckUtils]: 19: Hoare triple {12558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:03,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {12559#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:03,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {12559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:03,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {12560#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:03,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {12560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:03,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {12561#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:03,980 INFO L273 TraceCheckUtils]: 25: Hoare triple {12561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:03,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {12562#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:03,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {12562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:03,982 INFO L273 TraceCheckUtils]: 28: Hoare triple {12563#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:03,983 INFO L273 TraceCheckUtils]: 29: Hoare triple {12563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:03,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {12564#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:03,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {12564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:03,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {12565#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:03,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {12565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:03,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {12566#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:03,986 INFO L273 TraceCheckUtils]: 35: Hoare triple {12566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:03,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {12567#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:03,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {12567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:03,988 INFO L273 TraceCheckUtils]: 38: Hoare triple {12568#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:03,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {12568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:03,989 INFO L273 TraceCheckUtils]: 40: Hoare triple {12569#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:03,990 INFO L273 TraceCheckUtils]: 41: Hoare triple {12569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:03,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {12570#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:03,995 INFO L273 TraceCheckUtils]: 43: Hoare triple {12570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:03,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {12571#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:03,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {12571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:03,996 INFO L273 TraceCheckUtils]: 46: Hoare triple {12572#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:03,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {12572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:03,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {12573#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:03,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {12573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:03,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {12574#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:03,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {12574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:03,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {12575#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:03,998 INFO L273 TraceCheckUtils]: 53: Hoare triple {12575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:03,999 INFO L273 TraceCheckUtils]: 54: Hoare triple {12576#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:04,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {12576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:04,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {12577#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:04,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {12577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:04,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {12578#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:04,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {12578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:04,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {12579#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:04,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {12579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:04,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {12580#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:04,005 INFO L273 TraceCheckUtils]: 63: Hoare triple {12580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:04,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {12581#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:04,006 INFO L273 TraceCheckUtils]: 65: Hoare triple {12581#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:04,007 INFO L273 TraceCheckUtils]: 66: Hoare triple {12582#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:04,007 INFO L273 TraceCheckUtils]: 67: Hoare triple {12582#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:04,008 INFO L273 TraceCheckUtils]: 68: Hoare triple {12583#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:04,008 INFO L273 TraceCheckUtils]: 69: Hoare triple {12583#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12584#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:04,009 INFO L273 TraceCheckUtils]: 70: Hoare triple {12584#(<= main_~i~0 32)} assume !(~i~0 < 2048); {12551#false} is VALID [2018-11-23 13:08:04,009 INFO L273 TraceCheckUtils]: 71: Hoare triple {12551#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12551#false} is VALID [2018-11-23 13:08:04,010 INFO L256 TraceCheckUtils]: 72: Hoare triple {12551#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12551#false} is VALID [2018-11-23 13:08:04,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {12551#false} ~cond := #in~cond; {12551#false} is VALID [2018-11-23 13:08:04,010 INFO L273 TraceCheckUtils]: 74: Hoare triple {12551#false} assume 0 == ~cond; {12551#false} is VALID [2018-11-23 13:08:04,010 INFO L273 TraceCheckUtils]: 75: Hoare triple {12551#false} assume !false; {12551#false} is VALID [2018-11-23 13:08:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:04,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:04,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:04,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:04,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:04,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:04,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:04,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {12550#true} call ULTIMATE.init(); {12550#true} is VALID [2018-11-23 13:08:04,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {12550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12550#true} is VALID [2018-11-23 13:08:04,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {12550#true} assume true; {12550#true} is VALID [2018-11-23 13:08:04,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12550#true} {12550#true} #35#return; {12550#true} is VALID [2018-11-23 13:08:04,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {12550#true} call #t~ret4 := main(); {12550#true} is VALID [2018-11-23 13:08:04,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {12550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12603#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:04,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {12603#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12603#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:04,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {12603#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:04,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {12553#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12553#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:04,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {12553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:04,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {12554#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12554#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:04,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {12554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:04,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {12555#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12555#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:04,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {12555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:04,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {12556#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12556#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:04,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {12556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:04,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {12557#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12557#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:04,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {12557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:04,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {12558#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12558#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:04,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {12558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:04,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {12559#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12559#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:04,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {12559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:04,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {12560#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12560#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:04,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {12560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:04,299 INFO L273 TraceCheckUtils]: 24: Hoare triple {12561#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12561#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:04,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {12561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:04,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {12562#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12562#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:04,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {12562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:04,301 INFO L273 TraceCheckUtils]: 28: Hoare triple {12563#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12563#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:04,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {12563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:04,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {12564#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12564#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:04,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {12564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:04,304 INFO L273 TraceCheckUtils]: 32: Hoare triple {12565#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12565#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:04,305 INFO L273 TraceCheckUtils]: 33: Hoare triple {12565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:04,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {12566#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12566#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:04,306 INFO L273 TraceCheckUtils]: 35: Hoare triple {12566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:04,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {12567#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12567#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:04,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {12567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:04,308 INFO L273 TraceCheckUtils]: 38: Hoare triple {12568#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12568#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:04,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {12568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:04,309 INFO L273 TraceCheckUtils]: 40: Hoare triple {12569#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12569#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:04,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {12569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:04,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {12570#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12570#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:04,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {12570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:04,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {12571#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12571#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:04,312 INFO L273 TraceCheckUtils]: 45: Hoare triple {12571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:04,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {12572#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12572#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:04,313 INFO L273 TraceCheckUtils]: 47: Hoare triple {12572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:04,314 INFO L273 TraceCheckUtils]: 48: Hoare triple {12573#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12573#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:04,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {12573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:04,315 INFO L273 TraceCheckUtils]: 50: Hoare triple {12574#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12574#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:04,316 INFO L273 TraceCheckUtils]: 51: Hoare triple {12574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:04,316 INFO L273 TraceCheckUtils]: 52: Hoare triple {12575#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12575#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:04,317 INFO L273 TraceCheckUtils]: 53: Hoare triple {12575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:04,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {12576#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12576#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:04,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {12576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:04,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {12577#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12577#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:04,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {12577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:04,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {12578#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12578#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:04,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {12578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:04,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {12579#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12579#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:04,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {12579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:04,323 INFO L273 TraceCheckUtils]: 62: Hoare triple {12580#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12580#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:04,323 INFO L273 TraceCheckUtils]: 63: Hoare triple {12580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:04,324 INFO L273 TraceCheckUtils]: 64: Hoare triple {12581#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12581#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:04,325 INFO L273 TraceCheckUtils]: 65: Hoare triple {12581#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:04,325 INFO L273 TraceCheckUtils]: 66: Hoare triple {12582#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12582#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:04,326 INFO L273 TraceCheckUtils]: 67: Hoare triple {12582#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:04,326 INFO L273 TraceCheckUtils]: 68: Hoare triple {12583#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12583#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:04,327 INFO L273 TraceCheckUtils]: 69: Hoare triple {12583#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12584#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:04,328 INFO L273 TraceCheckUtils]: 70: Hoare triple {12584#(<= main_~i~0 32)} assume !(~i~0 < 2048); {12551#false} is VALID [2018-11-23 13:08:04,328 INFO L273 TraceCheckUtils]: 71: Hoare triple {12551#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12551#false} is VALID [2018-11-23 13:08:04,328 INFO L256 TraceCheckUtils]: 72: Hoare triple {12551#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {12551#false} is VALID [2018-11-23 13:08:04,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {12551#false} ~cond := #in~cond; {12551#false} is VALID [2018-11-23 13:08:04,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {12551#false} assume 0 == ~cond; {12551#false} is VALID [2018-11-23 13:08:04,329 INFO L273 TraceCheckUtils]: 75: Hoare triple {12551#false} assume !false; {12551#false} is VALID [2018-11-23 13:08:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 13:08:04,355 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-11-23 13:08:04,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:04,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 13:08:04,434 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 13:08:04,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 13:08:04,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 13:08:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:08:04,436 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2018-11-23 13:08:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:04,944 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:08:04,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:08:04,944 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-11-23 13:08:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:08:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 86 transitions. [2018-11-23 13:08:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:08:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 86 transitions. [2018-11-23 13:08:04,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 86 transitions. [2018-11-23 13:08:05,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:05,093 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:08:05,093 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:08:05,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:08:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:08:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-23 13:08:05,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:05,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 79 states. [2018-11-23 13:08:05,202 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 79 states. [2018-11-23 13:08:05,202 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 79 states. [2018-11-23 13:08:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:05,203 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:08:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-23 13:08:05,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:05,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:05,204 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 80 states. [2018-11-23 13:08:05,204 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 80 states. [2018-11-23 13:08:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:05,205 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-11-23 13:08:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-23 13:08:05,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:05,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:05,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:05,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 13:08:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-23 13:08:05,206 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-11-23 13:08:05,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:05,206 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-23 13:08:05,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 13:08:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-23 13:08:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 13:08:05,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:05,207 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:05,207 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:05,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:05,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1846785023, now seen corresponding path program 33 times [2018-11-23 13:08:05,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:05,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:05,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:05,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:05,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:06,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2018-11-23 13:08:06,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13220#true} is VALID [2018-11-23 13:08:06,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2018-11-23 13:08:06,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #35#return; {13220#true} is VALID [2018-11-23 13:08:06,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret4 := main(); {13220#true} is VALID [2018-11-23 13:08:06,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {13220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13222#(= main_~i~0 0)} is VALID [2018-11-23 13:08:06,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {13222#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13222#(= main_~i~0 0)} is VALID [2018-11-23 13:08:06,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {13222#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:06,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {13223#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:06,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {13223#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:06,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {13224#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:06,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {13224#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:06,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {13225#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:06,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {13225#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:06,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {13226#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:06,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {13226#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:06,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {13227#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:06,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {13227#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:06,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {13228#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:06,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {13228#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:06,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {13229#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:06,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {13229#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:06,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {13230#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:06,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {13230#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:06,176 INFO L273 TraceCheckUtils]: 24: Hoare triple {13231#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:06,177 INFO L273 TraceCheckUtils]: 25: Hoare triple {13231#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:06,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {13232#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:06,178 INFO L273 TraceCheckUtils]: 27: Hoare triple {13232#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:06,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {13233#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:06,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {13233#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:06,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {13234#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:06,179 INFO L273 TraceCheckUtils]: 31: Hoare triple {13234#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:06,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {13235#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:06,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {13235#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:06,181 INFO L273 TraceCheckUtils]: 34: Hoare triple {13236#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:06,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {13236#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:06,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {13237#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:06,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {13237#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:06,184 INFO L273 TraceCheckUtils]: 38: Hoare triple {13238#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:06,184 INFO L273 TraceCheckUtils]: 39: Hoare triple {13238#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:06,185 INFO L273 TraceCheckUtils]: 40: Hoare triple {13239#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:06,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {13239#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:06,186 INFO L273 TraceCheckUtils]: 42: Hoare triple {13240#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:06,187 INFO L273 TraceCheckUtils]: 43: Hoare triple {13240#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:06,187 INFO L273 TraceCheckUtils]: 44: Hoare triple {13241#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:06,188 INFO L273 TraceCheckUtils]: 45: Hoare triple {13241#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:06,189 INFO L273 TraceCheckUtils]: 46: Hoare triple {13242#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:06,189 INFO L273 TraceCheckUtils]: 47: Hoare triple {13242#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:06,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:06,191 INFO L273 TraceCheckUtils]: 49: Hoare triple {13243#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:06,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {13244#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:06,192 INFO L273 TraceCheckUtils]: 51: Hoare triple {13244#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:06,192 INFO L273 TraceCheckUtils]: 52: Hoare triple {13245#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:06,193 INFO L273 TraceCheckUtils]: 53: Hoare triple {13245#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:06,194 INFO L273 TraceCheckUtils]: 54: Hoare triple {13246#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:06,194 INFO L273 TraceCheckUtils]: 55: Hoare triple {13246#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:06,195 INFO L273 TraceCheckUtils]: 56: Hoare triple {13247#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:06,196 INFO L273 TraceCheckUtils]: 57: Hoare triple {13247#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:06,196 INFO L273 TraceCheckUtils]: 58: Hoare triple {13248#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:06,197 INFO L273 TraceCheckUtils]: 59: Hoare triple {13248#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:06,198 INFO L273 TraceCheckUtils]: 60: Hoare triple {13249#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:06,198 INFO L273 TraceCheckUtils]: 61: Hoare triple {13249#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:06,199 INFO L273 TraceCheckUtils]: 62: Hoare triple {13250#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:06,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {13250#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:06,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {13251#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:06,201 INFO L273 TraceCheckUtils]: 65: Hoare triple {13251#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:06,201 INFO L273 TraceCheckUtils]: 66: Hoare triple {13252#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:06,202 INFO L273 TraceCheckUtils]: 67: Hoare triple {13252#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:06,203 INFO L273 TraceCheckUtils]: 68: Hoare triple {13253#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:06,203 INFO L273 TraceCheckUtils]: 69: Hoare triple {13253#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:06,204 INFO L273 TraceCheckUtils]: 70: Hoare triple {13254#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:06,205 INFO L273 TraceCheckUtils]: 71: Hoare triple {13254#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13255#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:06,205 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#(<= main_~i~0 33)} assume !(~i~0 < 2048); {13221#false} is VALID [2018-11-23 13:08:06,205 INFO L273 TraceCheckUtils]: 73: Hoare triple {13221#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13221#false} is VALID [2018-11-23 13:08:06,206 INFO L256 TraceCheckUtils]: 74: Hoare triple {13221#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13221#false} is VALID [2018-11-23 13:08:06,206 INFO L273 TraceCheckUtils]: 75: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2018-11-23 13:08:06,206 INFO L273 TraceCheckUtils]: 76: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2018-11-23 13:08:06,206 INFO L273 TraceCheckUtils]: 77: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2018-11-23 13:08:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:06,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:06,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:06,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:25,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 13:08:25,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:25,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:25,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2018-11-23 13:08:25,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13220#true} is VALID [2018-11-23 13:08:25,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2018-11-23 13:08:25,949 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #35#return; {13220#true} is VALID [2018-11-23 13:08:25,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret4 := main(); {13220#true} is VALID [2018-11-23 13:08:25,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {13220#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13274#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:25,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {13274#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13274#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:25,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {13274#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:25,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {13223#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13223#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:25,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {13223#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:25,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {13224#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13224#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:25,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {13224#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:25,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {13225#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13225#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:25,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {13225#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:25,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {13226#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13226#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:25,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {13226#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:25,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {13227#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13227#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:25,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {13227#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:25,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {13228#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13228#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:25,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {13228#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:25,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {13229#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13229#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:25,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {13229#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:25,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {13230#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13230#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:25,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {13230#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:25,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {13231#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13231#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:25,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {13231#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:25,962 INFO L273 TraceCheckUtils]: 26: Hoare triple {13232#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13232#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:25,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {13232#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:25,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {13233#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13233#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:25,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {13233#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:25,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {13234#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13234#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:25,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {13234#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:25,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {13235#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13235#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:25,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {13235#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:25,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {13236#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13236#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:25,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {13236#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:25,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {13237#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13237#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:25,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {13237#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:25,969 INFO L273 TraceCheckUtils]: 38: Hoare triple {13238#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13238#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:25,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {13238#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:25,970 INFO L273 TraceCheckUtils]: 40: Hoare triple {13239#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13239#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:25,971 INFO L273 TraceCheckUtils]: 41: Hoare triple {13239#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:25,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {13240#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13240#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:25,972 INFO L273 TraceCheckUtils]: 43: Hoare triple {13240#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:25,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {13241#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13241#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:25,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {13241#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:25,974 INFO L273 TraceCheckUtils]: 46: Hoare triple {13242#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13242#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:25,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {13242#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:25,976 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13243#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:25,976 INFO L273 TraceCheckUtils]: 49: Hoare triple {13243#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:25,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {13244#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13244#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:25,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {13244#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:26,005 INFO L273 TraceCheckUtils]: 52: Hoare triple {13245#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13245#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:26,011 INFO L273 TraceCheckUtils]: 53: Hoare triple {13245#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:26,011 INFO L273 TraceCheckUtils]: 54: Hoare triple {13246#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13246#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:26,011 INFO L273 TraceCheckUtils]: 55: Hoare triple {13246#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:26,012 INFO L273 TraceCheckUtils]: 56: Hoare triple {13247#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13247#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:26,012 INFO L273 TraceCheckUtils]: 57: Hoare triple {13247#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:26,012 INFO L273 TraceCheckUtils]: 58: Hoare triple {13248#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13248#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:26,013 INFO L273 TraceCheckUtils]: 59: Hoare triple {13248#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:26,013 INFO L273 TraceCheckUtils]: 60: Hoare triple {13249#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13249#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:26,014 INFO L273 TraceCheckUtils]: 61: Hoare triple {13249#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:26,014 INFO L273 TraceCheckUtils]: 62: Hoare triple {13250#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13250#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:26,014 INFO L273 TraceCheckUtils]: 63: Hoare triple {13250#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:26,015 INFO L273 TraceCheckUtils]: 64: Hoare triple {13251#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13251#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:26,015 INFO L273 TraceCheckUtils]: 65: Hoare triple {13251#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:26,016 INFO L273 TraceCheckUtils]: 66: Hoare triple {13252#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13252#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:26,016 INFO L273 TraceCheckUtils]: 67: Hoare triple {13252#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:26,017 INFO L273 TraceCheckUtils]: 68: Hoare triple {13253#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13253#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:26,018 INFO L273 TraceCheckUtils]: 69: Hoare triple {13253#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:26,018 INFO L273 TraceCheckUtils]: 70: Hoare triple {13254#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13254#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:26,019 INFO L273 TraceCheckUtils]: 71: Hoare triple {13254#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13255#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:26,020 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#(<= main_~i~0 33)} assume !(~i~0 < 2048); {13221#false} is VALID [2018-11-23 13:08:26,020 INFO L273 TraceCheckUtils]: 73: Hoare triple {13221#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13221#false} is VALID [2018-11-23 13:08:26,020 INFO L256 TraceCheckUtils]: 74: Hoare triple {13221#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13221#false} is VALID [2018-11-23 13:08:26,020 INFO L273 TraceCheckUtils]: 75: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2018-11-23 13:08:26,020 INFO L273 TraceCheckUtils]: 76: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2018-11-23 13:08:26,021 INFO L273 TraceCheckUtils]: 77: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2018-11-23 13:08:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:26,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:26,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 13:08:26,049 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-11-23 13:08:26,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:26,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 13:08:26,142 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 13:08:26,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 13:08:26,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 13:08:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:08:26,144 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-11-23 13:08:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,483 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:08:26,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:08:26,483 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-11-23 13:08:26,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:08:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2018-11-23 13:08:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:08:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2018-11-23 13:08:26,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 88 transitions. [2018-11-23 13:08:26,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:26,574 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:08:26,575 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 13:08:26,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:08:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 13:08:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-23 13:08:26,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:26,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 81 states. [2018-11-23 13:08:26,609 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 81 states. [2018-11-23 13:08:26,609 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 81 states. [2018-11-23 13:08:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,611 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:08:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-11-23 13:08:26,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:26,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:26,612 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 82 states. [2018-11-23 13:08:26,612 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 82 states. [2018-11-23 13:08:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,613 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-11-23 13:08:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-11-23 13:08:26,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:26,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:26,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:26,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 13:08:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-23 13:08:26,615 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-11-23 13:08:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:26,616 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-23 13:08:26,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 13:08:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-23 13:08:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 13:08:26,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:26,617 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:26,617 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:26,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash 98192161, now seen corresponding path program 34 times [2018-11-23 13:08:26,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:26,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:26,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:27,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 13:08:27,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {13907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13907#true} is VALID [2018-11-23 13:08:27,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 13:08:27,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #35#return; {13907#true} is VALID [2018-11-23 13:08:27,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret4 := main(); {13907#true} is VALID [2018-11-23 13:08:27,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13909#(= main_~i~0 0)} is VALID [2018-11-23 13:08:27,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {13909#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13909#(= main_~i~0 0)} is VALID [2018-11-23 13:08:27,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {13909#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:27,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:27,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:27,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:27,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:27,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:27,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:27,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:27,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:27,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:27,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:27,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:27,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:27,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:27,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:27,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:27,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:27,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:27,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:27,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:27,363 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:27,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:27,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:27,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:27,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:27,366 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:27,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:27,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:27,368 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:27,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:27,369 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:27,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:27,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:27,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:27,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:27,372 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:27,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:27,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:27,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:27,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:27,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:27,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:27,377 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:27,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:27,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {13931#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:27,379 INFO L273 TraceCheckUtils]: 52: Hoare triple {13932#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:27,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {13932#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:27,380 INFO L273 TraceCheckUtils]: 54: Hoare triple {13933#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:27,381 INFO L273 TraceCheckUtils]: 55: Hoare triple {13933#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:27,381 INFO L273 TraceCheckUtils]: 56: Hoare triple {13934#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:27,382 INFO L273 TraceCheckUtils]: 57: Hoare triple {13934#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:27,382 INFO L273 TraceCheckUtils]: 58: Hoare triple {13935#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:27,383 INFO L273 TraceCheckUtils]: 59: Hoare triple {13935#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:27,384 INFO L273 TraceCheckUtils]: 60: Hoare triple {13936#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:27,384 INFO L273 TraceCheckUtils]: 61: Hoare triple {13936#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:27,385 INFO L273 TraceCheckUtils]: 62: Hoare triple {13937#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:27,386 INFO L273 TraceCheckUtils]: 63: Hoare triple {13937#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:27,386 INFO L273 TraceCheckUtils]: 64: Hoare triple {13938#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:27,387 INFO L273 TraceCheckUtils]: 65: Hoare triple {13938#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:27,388 INFO L273 TraceCheckUtils]: 66: Hoare triple {13939#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:27,388 INFO L273 TraceCheckUtils]: 67: Hoare triple {13939#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:27,389 INFO L273 TraceCheckUtils]: 68: Hoare triple {13940#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:27,390 INFO L273 TraceCheckUtils]: 69: Hoare triple {13940#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:27,390 INFO L273 TraceCheckUtils]: 70: Hoare triple {13941#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:27,391 INFO L273 TraceCheckUtils]: 71: Hoare triple {13941#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:27,391 INFO L273 TraceCheckUtils]: 72: Hoare triple {13942#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:27,392 INFO L273 TraceCheckUtils]: 73: Hoare triple {13942#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13943#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:27,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {13943#(<= main_~i~0 34)} assume !(~i~0 < 2048); {13908#false} is VALID [2018-11-23 13:08:27,393 INFO L273 TraceCheckUtils]: 75: Hoare triple {13908#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13908#false} is VALID [2018-11-23 13:08:27,393 INFO L256 TraceCheckUtils]: 76: Hoare triple {13908#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13908#false} is VALID [2018-11-23 13:08:27,393 INFO L273 TraceCheckUtils]: 77: Hoare triple {13908#false} ~cond := #in~cond; {13908#false} is VALID [2018-11-23 13:08:27,394 INFO L273 TraceCheckUtils]: 78: Hoare triple {13908#false} assume 0 == ~cond; {13908#false} is VALID [2018-11-23 13:08:27,394 INFO L273 TraceCheckUtils]: 79: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 13:08:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:27,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:27,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:27,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:27,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:27,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:27,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:27,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 13:08:27,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {13907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13907#true} is VALID [2018-11-23 13:08:27,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 13:08:27,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #35#return; {13907#true} is VALID [2018-11-23 13:08:27,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret4 := main(); {13907#true} is VALID [2018-11-23 13:08:27,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13962#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:27,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13962#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:27,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {13962#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:27,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13910#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:27,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:27,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13911#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:27,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:27,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13912#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:27,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:27,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13913#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:27,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:27,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13914#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:27,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:27,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13915#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:27,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:27,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13916#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:27,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:27,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13917#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:27,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:27,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13918#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:27,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:27,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13919#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:27,721 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:27,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13920#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:27,722 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:27,723 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13921#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:27,723 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:27,724 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13922#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:27,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:27,725 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13923#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:27,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:27,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13924#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:27,727 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:27,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13925#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:27,728 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:27,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13926#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:27,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:27,730 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13927#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:27,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:27,732 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13928#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:27,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:27,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13929#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:27,734 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:27,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13930#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:27,735 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:27,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13931#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:27,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {13931#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:27,737 INFO L273 TraceCheckUtils]: 52: Hoare triple {13932#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13932#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:27,737 INFO L273 TraceCheckUtils]: 53: Hoare triple {13932#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:27,738 INFO L273 TraceCheckUtils]: 54: Hoare triple {13933#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13933#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:27,739 INFO L273 TraceCheckUtils]: 55: Hoare triple {13933#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:27,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {13934#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13934#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:27,740 INFO L273 TraceCheckUtils]: 57: Hoare triple {13934#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:27,740 INFO L273 TraceCheckUtils]: 58: Hoare triple {13935#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13935#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:27,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {13935#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:27,744 INFO L273 TraceCheckUtils]: 60: Hoare triple {13936#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13936#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:27,744 INFO L273 TraceCheckUtils]: 61: Hoare triple {13936#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:27,744 INFO L273 TraceCheckUtils]: 62: Hoare triple {13937#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13937#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:27,745 INFO L273 TraceCheckUtils]: 63: Hoare triple {13937#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:27,745 INFO L273 TraceCheckUtils]: 64: Hoare triple {13938#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13938#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:27,746 INFO L273 TraceCheckUtils]: 65: Hoare triple {13938#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:27,746 INFO L273 TraceCheckUtils]: 66: Hoare triple {13939#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13939#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:27,747 INFO L273 TraceCheckUtils]: 67: Hoare triple {13939#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:27,747 INFO L273 TraceCheckUtils]: 68: Hoare triple {13940#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13940#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:27,748 INFO L273 TraceCheckUtils]: 69: Hoare triple {13940#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:27,749 INFO L273 TraceCheckUtils]: 70: Hoare triple {13941#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13941#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:27,749 INFO L273 TraceCheckUtils]: 71: Hoare triple {13941#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:27,750 INFO L273 TraceCheckUtils]: 72: Hoare triple {13942#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13942#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:27,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {13942#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13943#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:27,751 INFO L273 TraceCheckUtils]: 74: Hoare triple {13943#(<= main_~i~0 34)} assume !(~i~0 < 2048); {13908#false} is VALID [2018-11-23 13:08:27,752 INFO L273 TraceCheckUtils]: 75: Hoare triple {13908#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {13908#false} is VALID [2018-11-23 13:08:27,752 INFO L256 TraceCheckUtils]: 76: Hoare triple {13908#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {13908#false} is VALID [2018-11-23 13:08:27,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {13908#false} ~cond := #in~cond; {13908#false} is VALID [2018-11-23 13:08:27,752 INFO L273 TraceCheckUtils]: 78: Hoare triple {13908#false} assume 0 == ~cond; {13908#false} is VALID [2018-11-23 13:08:27,752 INFO L273 TraceCheckUtils]: 79: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 13:08:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:27,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:27,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 13:08:27,777 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-11-23 13:08:27,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:27,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 13:08:28,050 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 13:08:28,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 13:08:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:08:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:08:28,051 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2018-11-23 13:08:28,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:28,685 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:08:28,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 13:08:28,685 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-11-23 13:08:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:08:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2018-11-23 13:08:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:08:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2018-11-23 13:08:28,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 90 transitions. [2018-11-23 13:08:28,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:28,801 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:08:28,802 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 13:08:28,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:08:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 13:08:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-23 13:08:28,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:28,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-23 13:08:28,830 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-23 13:08:28,830 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-23 13:08:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:28,831 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:08:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-23 13:08:28,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:28,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:28,832 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-23 13:08:28,832 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-23 13:08:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:28,833 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-23 13:08:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-23 13:08:28,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:28,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:28,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:28,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 13:08:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-23 13:08:28,835 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-11-23 13:08:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:28,836 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-23 13:08:28,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 13:08:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-23 13:08:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 13:08:28,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:28,837 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:28,837 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:28,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash -967335485, now seen corresponding path program 35 times [2018-11-23 13:08:28,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:28,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:28,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:29,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {14611#true} call ULTIMATE.init(); {14611#true} is VALID [2018-11-23 13:08:29,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {14611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14611#true} is VALID [2018-11-23 13:08:29,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {14611#true} assume true; {14611#true} is VALID [2018-11-23 13:08:29,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14611#true} {14611#true} #35#return; {14611#true} is VALID [2018-11-23 13:08:29,499 INFO L256 TraceCheckUtils]: 4: Hoare triple {14611#true} call #t~ret4 := main(); {14611#true} is VALID [2018-11-23 13:08:29,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {14611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14613#(= main_~i~0 0)} is VALID [2018-11-23 13:08:29,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {14613#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14613#(= main_~i~0 0)} is VALID [2018-11-23 13:08:29,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {14613#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:29,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {14614#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:29,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {14614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:29,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {14615#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:29,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {14615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:29,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {14616#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:29,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {14616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:29,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {14617#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:29,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {14617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:29,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {14618#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:29,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {14618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:29,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {14619#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:29,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {14619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:29,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {14620#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:29,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {14620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:29,510 INFO L273 TraceCheckUtils]: 22: Hoare triple {14621#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:29,511 INFO L273 TraceCheckUtils]: 23: Hoare triple {14621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:29,511 INFO L273 TraceCheckUtils]: 24: Hoare triple {14622#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:29,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {14622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:29,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:29,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {14623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:29,514 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:29,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:29,515 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:29,516 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:29,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {14626#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:29,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:29,518 INFO L273 TraceCheckUtils]: 34: Hoare triple {14627#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:29,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {14627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:29,519 INFO L273 TraceCheckUtils]: 36: Hoare triple {14628#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:29,520 INFO L273 TraceCheckUtils]: 37: Hoare triple {14628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:29,520 INFO L273 TraceCheckUtils]: 38: Hoare triple {14629#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:29,521 INFO L273 TraceCheckUtils]: 39: Hoare triple {14629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:29,522 INFO L273 TraceCheckUtils]: 40: Hoare triple {14630#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:29,522 INFO L273 TraceCheckUtils]: 41: Hoare triple {14630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:29,523 INFO L273 TraceCheckUtils]: 42: Hoare triple {14631#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:29,524 INFO L273 TraceCheckUtils]: 43: Hoare triple {14631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:29,524 INFO L273 TraceCheckUtils]: 44: Hoare triple {14632#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:29,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {14632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:29,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {14633#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:29,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {14633#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:29,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {14634#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:29,527 INFO L273 TraceCheckUtils]: 49: Hoare triple {14634#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:29,528 INFO L273 TraceCheckUtils]: 50: Hoare triple {14635#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:29,529 INFO L273 TraceCheckUtils]: 51: Hoare triple {14635#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:29,529 INFO L273 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:29,530 INFO L273 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:29,530 INFO L273 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:29,551 INFO L273 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:29,565 INFO L273 TraceCheckUtils]: 56: Hoare triple {14638#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:29,574 INFO L273 TraceCheckUtils]: 57: Hoare triple {14638#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:29,590 INFO L273 TraceCheckUtils]: 58: Hoare triple {14639#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:29,605 INFO L273 TraceCheckUtils]: 59: Hoare triple {14639#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:29,613 INFO L273 TraceCheckUtils]: 60: Hoare triple {14640#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:29,628 INFO L273 TraceCheckUtils]: 61: Hoare triple {14640#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:29,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {14641#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:29,651 INFO L273 TraceCheckUtils]: 63: Hoare triple {14641#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:29,665 INFO L273 TraceCheckUtils]: 64: Hoare triple {14642#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:29,674 INFO L273 TraceCheckUtils]: 65: Hoare triple {14642#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:29,688 INFO L273 TraceCheckUtils]: 66: Hoare triple {14643#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:29,697 INFO L273 TraceCheckUtils]: 67: Hoare triple {14643#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:29,710 INFO L273 TraceCheckUtils]: 68: Hoare triple {14644#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:29,719 INFO L273 TraceCheckUtils]: 69: Hoare triple {14644#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:29,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {14645#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:29,743 INFO L273 TraceCheckUtils]: 71: Hoare triple {14645#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:29,754 INFO L273 TraceCheckUtils]: 72: Hoare triple {14646#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:29,755 INFO L273 TraceCheckUtils]: 73: Hoare triple {14646#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:29,756 INFO L273 TraceCheckUtils]: 74: Hoare triple {14647#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:29,756 INFO L273 TraceCheckUtils]: 75: Hoare triple {14647#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14648#(<= main_~i~0 35)} is VALID [2018-11-23 13:08:29,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {14648#(<= main_~i~0 35)} assume !(~i~0 < 2048); {14612#false} is VALID [2018-11-23 13:08:29,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14612#false} is VALID [2018-11-23 13:08:29,758 INFO L256 TraceCheckUtils]: 78: Hoare triple {14612#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14612#false} is VALID [2018-11-23 13:08:29,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {14612#false} ~cond := #in~cond; {14612#false} is VALID [2018-11-23 13:08:29,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {14612#false} assume 0 == ~cond; {14612#false} is VALID [2018-11-23 13:08:29,758 INFO L273 TraceCheckUtils]: 81: Hoare triple {14612#false} assume !false; {14612#false} is VALID [2018-11-23 13:08:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:29,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:29,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:29,771 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:08:30,933 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 13:08:30,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:30,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:31,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {14611#true} call ULTIMATE.init(); {14611#true} is VALID [2018-11-23 13:08:31,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {14611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14611#true} is VALID [2018-11-23 13:08:31,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {14611#true} assume true; {14611#true} is VALID [2018-11-23 13:08:31,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14611#true} {14611#true} #35#return; {14611#true} is VALID [2018-11-23 13:08:31,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {14611#true} call #t~ret4 := main(); {14611#true} is VALID [2018-11-23 13:08:31,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {14611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14667#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:31,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {14667#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14667#(<= main_~i~0 0)} is VALID [2018-11-23 13:08:31,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {14667#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:31,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {14614#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14614#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:31,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {14614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:31,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {14615#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14615#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:31,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {14615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:31,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {14616#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14616#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:31,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {14616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:31,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {14617#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14617#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:31,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {14617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:31,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {14618#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14618#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:31,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {14618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:31,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {14619#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14619#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:31,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {14619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:31,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {14620#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14620#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:31,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {14620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:31,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {14621#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14621#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:31,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {14621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:31,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {14622#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14622#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:31,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {14622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:31,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {14623#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14623#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:31,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {14623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:31,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {14624#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14624#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:31,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {14624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:31,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {14625#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14625#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:31,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {14625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:31,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {14626#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14626#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:31,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {14626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:31,218 INFO L273 TraceCheckUtils]: 34: Hoare triple {14627#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14627#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:31,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {14627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:31,219 INFO L273 TraceCheckUtils]: 36: Hoare triple {14628#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14628#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:31,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {14628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:31,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {14629#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14629#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:31,221 INFO L273 TraceCheckUtils]: 39: Hoare triple {14629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:31,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {14630#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14630#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:31,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {14630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:31,223 INFO L273 TraceCheckUtils]: 42: Hoare triple {14631#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14631#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:31,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {14631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:31,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {14632#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14632#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:31,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {14632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:31,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {14633#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14633#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:31,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {14633#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:31,227 INFO L273 TraceCheckUtils]: 48: Hoare triple {14634#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14634#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:31,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {14634#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:31,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {14635#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14635#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:31,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {14635#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:31,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {14636#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14636#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:31,230 INFO L273 TraceCheckUtils]: 53: Hoare triple {14636#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:31,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {14637#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14637#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:31,231 INFO L273 TraceCheckUtils]: 55: Hoare triple {14637#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:31,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {14638#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14638#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:31,232 INFO L273 TraceCheckUtils]: 57: Hoare triple {14638#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:31,233 INFO L273 TraceCheckUtils]: 58: Hoare triple {14639#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14639#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:31,234 INFO L273 TraceCheckUtils]: 59: Hoare triple {14639#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:31,234 INFO L273 TraceCheckUtils]: 60: Hoare triple {14640#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14640#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:31,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {14640#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:31,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {14641#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14641#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:31,236 INFO L273 TraceCheckUtils]: 63: Hoare triple {14641#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:31,237 INFO L273 TraceCheckUtils]: 64: Hoare triple {14642#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14642#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:31,237 INFO L273 TraceCheckUtils]: 65: Hoare triple {14642#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:31,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {14643#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14643#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:31,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {14643#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:31,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {14644#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14644#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:31,240 INFO L273 TraceCheckUtils]: 69: Hoare triple {14644#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:31,240 INFO L273 TraceCheckUtils]: 70: Hoare triple {14645#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14645#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:31,241 INFO L273 TraceCheckUtils]: 71: Hoare triple {14645#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:31,242 INFO L273 TraceCheckUtils]: 72: Hoare triple {14646#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14646#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:31,242 INFO L273 TraceCheckUtils]: 73: Hoare triple {14646#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:31,243 INFO L273 TraceCheckUtils]: 74: Hoare triple {14647#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14647#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:31,244 INFO L273 TraceCheckUtils]: 75: Hoare triple {14647#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14648#(<= main_~i~0 35)} is VALID [2018-11-23 13:08:31,244 INFO L273 TraceCheckUtils]: 76: Hoare triple {14648#(<= main_~i~0 35)} assume !(~i~0 < 2048); {14612#false} is VALID [2018-11-23 13:08:31,245 INFO L273 TraceCheckUtils]: 77: Hoare triple {14612#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14612#false} is VALID [2018-11-23 13:08:31,245 INFO L256 TraceCheckUtils]: 78: Hoare triple {14612#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {14612#false} is VALID [2018-11-23 13:08:31,245 INFO L273 TraceCheckUtils]: 79: Hoare triple {14612#false} ~cond := #in~cond; {14612#false} is VALID [2018-11-23 13:08:31,245 INFO L273 TraceCheckUtils]: 80: Hoare triple {14612#false} assume 0 == ~cond; {14612#false} is VALID [2018-11-23 13:08:31,245 INFO L273 TraceCheckUtils]: 81: Hoare triple {14612#false} assume !false; {14612#false} is VALID [2018-11-23 13:08:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:31,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:31,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 13:08:31,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-11-23 13:08:31,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:31,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 13:08:31,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:31,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 13:08:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 13:08:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:08:31,742 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-11-23 13:08:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:32,287 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:08:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:08:32,287 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-11-23 13:08:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:08:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2018-11-23 13:08:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:08:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 92 transitions. [2018-11-23 13:08:32,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 92 transitions. [2018-11-23 13:08:32,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:32,395 INFO L225 Difference]: With dead ends: 92 [2018-11-23 13:08:32,395 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 13:08:32,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 13:08:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 13:08:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-23 13:08:32,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:32,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2018-11-23 13:08:32,435 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2018-11-23 13:08:32,435 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2018-11-23 13:08:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:32,437 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:08:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-23 13:08:32,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:32,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:32,438 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2018-11-23 13:08:32,438 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2018-11-23 13:08:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:32,439 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 13:08:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-23 13:08:32,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:32,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:32,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:32,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 13:08:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-11-23 13:08:32,441 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-11-23 13:08:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:32,441 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-11-23 13:08:32,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 13:08:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-11-23 13:08:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 13:08:32,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:32,442 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:32,442 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:32,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:32,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1557780453, now seen corresponding path program 36 times [2018-11-23 13:08:32,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:32,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:32,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:32,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:32,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:33,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {15332#true} call ULTIMATE.init(); {15332#true} is VALID [2018-11-23 13:08:33,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {15332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15332#true} is VALID [2018-11-23 13:08:33,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {15332#true} assume true; {15332#true} is VALID [2018-11-23 13:08:33,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15332#true} {15332#true} #35#return; {15332#true} is VALID [2018-11-23 13:08:33,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {15332#true} call #t~ret4 := main(); {15332#true} is VALID [2018-11-23 13:08:33,477 INFO L273 TraceCheckUtils]: 5: Hoare triple {15332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15334#(= main_~i~0 0)} is VALID [2018-11-23 13:08:33,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {15334#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15334#(= main_~i~0 0)} is VALID [2018-11-23 13:08:33,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {15334#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:33,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {15335#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:08:33,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {15335#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:33,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {15336#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:08:33,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {15336#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:33,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {15337#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:08:33,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {15337#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:33,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {15338#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:08:33,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {15338#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:33,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {15339#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:08:33,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {15339#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:33,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {15340#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:08:33,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {15340#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:33,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {15341#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:08:33,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {15341#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:33,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {15342#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:08:33,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {15342#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:33,488 INFO L273 TraceCheckUtils]: 24: Hoare triple {15343#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:08:33,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {15343#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:33,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {15344#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:08:33,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {15344#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:33,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {15345#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:08:33,492 INFO L273 TraceCheckUtils]: 29: Hoare triple {15345#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:33,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {15346#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:08:33,493 INFO L273 TraceCheckUtils]: 31: Hoare triple {15346#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:33,493 INFO L273 TraceCheckUtils]: 32: Hoare triple {15347#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:08:33,494 INFO L273 TraceCheckUtils]: 33: Hoare triple {15347#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:33,495 INFO L273 TraceCheckUtils]: 34: Hoare triple {15348#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:08:33,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {15348#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:33,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {15349#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:08:33,497 INFO L273 TraceCheckUtils]: 37: Hoare triple {15349#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:33,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {15350#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:08:33,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {15350#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:33,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {15351#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:08:33,499 INFO L273 TraceCheckUtils]: 41: Hoare triple {15351#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:33,500 INFO L273 TraceCheckUtils]: 42: Hoare triple {15352#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:08:33,500 INFO L273 TraceCheckUtils]: 43: Hoare triple {15352#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:33,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {15353#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:08:33,501 INFO L273 TraceCheckUtils]: 45: Hoare triple {15353#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:33,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {15354#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:08:33,503 INFO L273 TraceCheckUtils]: 47: Hoare triple {15354#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:33,503 INFO L273 TraceCheckUtils]: 48: Hoare triple {15355#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:08:33,504 INFO L273 TraceCheckUtils]: 49: Hoare triple {15355#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:33,505 INFO L273 TraceCheckUtils]: 50: Hoare triple {15356#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:08:33,505 INFO L273 TraceCheckUtils]: 51: Hoare triple {15356#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:33,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {15357#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:08:33,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {15357#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:33,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {15358#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:08:33,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {15358#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:33,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {15359#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:08:33,509 INFO L273 TraceCheckUtils]: 57: Hoare triple {15359#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:33,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {15360#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:08:33,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {15360#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:33,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {15361#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:08:33,512 INFO L273 TraceCheckUtils]: 61: Hoare triple {15361#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:33,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {15362#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:08:33,513 INFO L273 TraceCheckUtils]: 63: Hoare triple {15362#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:33,513 INFO L273 TraceCheckUtils]: 64: Hoare triple {15363#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:08:33,514 INFO L273 TraceCheckUtils]: 65: Hoare triple {15363#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:33,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {15364#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:08:33,515 INFO L273 TraceCheckUtils]: 67: Hoare triple {15364#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:33,516 INFO L273 TraceCheckUtils]: 68: Hoare triple {15365#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:08:33,517 INFO L273 TraceCheckUtils]: 69: Hoare triple {15365#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:33,517 INFO L273 TraceCheckUtils]: 70: Hoare triple {15366#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:08:33,518 INFO L273 TraceCheckUtils]: 71: Hoare triple {15366#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:33,518 INFO L273 TraceCheckUtils]: 72: Hoare triple {15367#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:08:33,519 INFO L273 TraceCheckUtils]: 73: Hoare triple {15367#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:33,520 INFO L273 TraceCheckUtils]: 74: Hoare triple {15368#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:08:33,520 INFO L273 TraceCheckUtils]: 75: Hoare triple {15368#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:08:33,521 INFO L273 TraceCheckUtils]: 76: Hoare triple {15369#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:08:33,522 INFO L273 TraceCheckUtils]: 77: Hoare triple {15369#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15370#(<= main_~i~0 36)} is VALID [2018-11-23 13:08:33,522 INFO L273 TraceCheckUtils]: 78: Hoare triple {15370#(<= main_~i~0 36)} assume !(~i~0 < 2048); {15333#false} is VALID [2018-11-23 13:08:33,522 INFO L273 TraceCheckUtils]: 79: Hoare triple {15333#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15333#false} is VALID [2018-11-23 13:08:33,523 INFO L256 TraceCheckUtils]: 80: Hoare triple {15333#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15333#false} is VALID [2018-11-23 13:08:33,523 INFO L273 TraceCheckUtils]: 81: Hoare triple {15333#false} ~cond := #in~cond; {15333#false} is VALID [2018-11-23 13:08:33,523 INFO L273 TraceCheckUtils]: 82: Hoare triple {15333#false} assume 0 == ~cond; {15333#false} is VALID [2018-11-23 13:08:33,523 INFO L273 TraceCheckUtils]: 83: Hoare triple {15333#false} assume !false; {15333#false} is VALID [2018-11-23 13:08:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:33,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:33,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:09:01,830 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 13:09:01,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:01,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:03,390 INFO L256 TraceCheckUtils]: 0: Hoare triple {15332#true} call ULTIMATE.init(); {15332#true} is VALID [2018-11-23 13:09:03,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {15332#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15332#true} is VALID [2018-11-23 13:09:03,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {15332#true} assume true; {15332#true} is VALID [2018-11-23 13:09:03,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15332#true} {15332#true} #35#return; {15332#true} is VALID [2018-11-23 13:09:03,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {15332#true} call #t~ret4 := main(); {15332#true} is VALID [2018-11-23 13:09:03,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {15332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15389#(<= main_~i~0 0)} is VALID [2018-11-23 13:09:03,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {15389#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15389#(<= main_~i~0 0)} is VALID [2018-11-23 13:09:03,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {15389#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:03,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {15335#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15335#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:03,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {15335#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:03,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {15336#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15336#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:03,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {15336#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:03,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {15337#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15337#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:03,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {15337#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:03,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {15338#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15338#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:03,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {15338#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:03,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {15339#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:03,398 INFO L273 TraceCheckUtils]: 17: Hoare triple {15339#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:03,399 INFO L273 TraceCheckUtils]: 18: Hoare triple {15340#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15340#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:03,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {15340#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:03,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {15341#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15341#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:03,401 INFO L273 TraceCheckUtils]: 21: Hoare triple {15341#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:03,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {15342#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15342#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:03,402 INFO L273 TraceCheckUtils]: 23: Hoare triple {15342#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:03,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {15343#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15343#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:03,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {15343#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:03,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {15344#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15344#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:03,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {15344#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:03,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {15345#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15345#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:03,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {15345#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:03,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {15346#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:03,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {15346#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:03,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {15347#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15347#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:03,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {15347#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:03,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {15348#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15348#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:03,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {15348#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:03,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {15349#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15349#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:03,411 INFO L273 TraceCheckUtils]: 37: Hoare triple {15349#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:03,411 INFO L273 TraceCheckUtils]: 38: Hoare triple {15350#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15350#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:03,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {15350#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:03,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {15351#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15351#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:03,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {15351#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:03,414 INFO L273 TraceCheckUtils]: 42: Hoare triple {15352#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15352#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:03,414 INFO L273 TraceCheckUtils]: 43: Hoare triple {15352#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:03,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {15353#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15353#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:03,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {15353#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:03,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {15354#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15354#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:03,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {15354#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:03,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {15355#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15355#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:03,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {15355#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:03,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {15356#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15356#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:03,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {15356#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:03,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {15357#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15357#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:03,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {15357#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:03,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {15358#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15358#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:03,441 INFO L273 TraceCheckUtils]: 55: Hoare triple {15358#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:03,455 INFO L273 TraceCheckUtils]: 56: Hoare triple {15359#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15359#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:03,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {15359#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:03,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {15360#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15360#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:03,468 INFO L273 TraceCheckUtils]: 59: Hoare triple {15360#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:03,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {15361#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15361#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:03,469 INFO L273 TraceCheckUtils]: 61: Hoare triple {15361#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:03,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {15362#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15362#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:03,470 INFO L273 TraceCheckUtils]: 63: Hoare triple {15362#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:03,470 INFO L273 TraceCheckUtils]: 64: Hoare triple {15363#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15363#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:03,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {15363#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:03,471 INFO L273 TraceCheckUtils]: 66: Hoare triple {15364#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15364#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:03,471 INFO L273 TraceCheckUtils]: 67: Hoare triple {15364#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:03,472 INFO L273 TraceCheckUtils]: 68: Hoare triple {15365#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15365#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:03,472 INFO L273 TraceCheckUtils]: 69: Hoare triple {15365#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:03,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {15366#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15366#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:03,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {15366#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:03,474 INFO L273 TraceCheckUtils]: 72: Hoare triple {15367#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15367#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:03,475 INFO L273 TraceCheckUtils]: 73: Hoare triple {15367#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:03,475 INFO L273 TraceCheckUtils]: 74: Hoare triple {15368#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15368#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:03,476 INFO L273 TraceCheckUtils]: 75: Hoare triple {15368#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:03,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {15369#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15369#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:03,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {15369#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15370#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:03,478 INFO L273 TraceCheckUtils]: 78: Hoare triple {15370#(<= main_~i~0 36)} assume !(~i~0 < 2048); {15333#false} is VALID [2018-11-23 13:09:03,478 INFO L273 TraceCheckUtils]: 79: Hoare triple {15333#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15333#false} is VALID [2018-11-23 13:09:03,478 INFO L256 TraceCheckUtils]: 80: Hoare triple {15333#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {15333#false} is VALID [2018-11-23 13:09:03,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {15333#false} ~cond := #in~cond; {15333#false} is VALID [2018-11-23 13:09:03,479 INFO L273 TraceCheckUtils]: 82: Hoare triple {15333#false} assume 0 == ~cond; {15333#false} is VALID [2018-11-23 13:09:03,479 INFO L273 TraceCheckUtils]: 83: Hoare triple {15333#false} assume !false; {15333#false} is VALID [2018-11-23 13:09:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:03,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:03,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 13:09:03,511 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-11-23 13:09:03,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:03,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 13:09:03,598 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 13:09:03,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 13:09:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 13:09:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:09:03,600 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2018-11-23 13:09:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:03,951 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-23 13:09:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:09:03,951 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-11-23 13:09:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:09:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 94 transitions. [2018-11-23 13:09:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:09:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 94 transitions. [2018-11-23 13:09:03,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 94 transitions. [2018-11-23 13:09:04,045 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 13:09:04,047 INFO L225 Difference]: With dead ends: 94 [2018-11-23 13:09:04,047 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 13:09:04,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:09:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 13:09:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 13:09:04,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:04,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 13:09:04,097 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 13:09:04,097 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 13:09:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:04,098 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:09:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-11-23 13:09:04,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:04,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:04,099 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 13:09:04,099 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 13:09:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:04,100 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 13:09:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-11-23 13:09:04,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:04,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:04,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:04,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 13:09:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-11-23 13:09:04,102 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-11-23 13:09:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:04,102 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-11-23 13:09:04,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 13:09:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-11-23 13:09:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 13:09:04,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:04,103 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:04,104 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:04,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1537674631, now seen corresponding path program 37 times [2018-11-23 13:09:04,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:04,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:04,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:04,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {16070#true} call ULTIMATE.init(); {16070#true} is VALID [2018-11-23 13:09:04,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {16070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16070#true} is VALID [2018-11-23 13:09:04,915 INFO L273 TraceCheckUtils]: 2: Hoare triple {16070#true} assume true; {16070#true} is VALID [2018-11-23 13:09:04,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16070#true} {16070#true} #35#return; {16070#true} is VALID [2018-11-23 13:09:04,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {16070#true} call #t~ret4 := main(); {16070#true} is VALID [2018-11-23 13:09:04,916 INFO L273 TraceCheckUtils]: 5: Hoare triple {16070#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16072#(= main_~i~0 0)} is VALID [2018-11-23 13:09:04,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {16072#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16072#(= main_~i~0 0)} is VALID [2018-11-23 13:09:04,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {16072#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:04,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {16073#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:04,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {16073#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:04,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {16074#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:04,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {16074#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:04,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {16075#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:04,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {16075#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:04,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {16076#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:04,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {16076#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:04,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {16077#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:04,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {16077#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:04,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {16078#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:04,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {16078#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:04,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {16079#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:04,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {16079#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:04,926 INFO L273 TraceCheckUtils]: 22: Hoare triple {16080#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:04,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {16080#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:04,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {16081#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:04,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {16081#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:04,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {16082#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:04,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {16082#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:04,929 INFO L273 TraceCheckUtils]: 28: Hoare triple {16083#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:04,930 INFO L273 TraceCheckUtils]: 29: Hoare triple {16083#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:04,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {16084#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:04,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {16084#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:04,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {16085#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:04,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {16085#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:04,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {16086#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:04,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {16086#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:04,934 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:04,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {16087#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:04,936 INFO L273 TraceCheckUtils]: 38: Hoare triple {16088#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:04,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {16088#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:04,937 INFO L273 TraceCheckUtils]: 40: Hoare triple {16089#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:04,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {16089#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:04,938 INFO L273 TraceCheckUtils]: 42: Hoare triple {16090#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:04,939 INFO L273 TraceCheckUtils]: 43: Hoare triple {16090#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:04,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {16091#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:04,940 INFO L273 TraceCheckUtils]: 45: Hoare triple {16091#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:04,941 INFO L273 TraceCheckUtils]: 46: Hoare triple {16092#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:04,941 INFO L273 TraceCheckUtils]: 47: Hoare triple {16092#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:04,942 INFO L273 TraceCheckUtils]: 48: Hoare triple {16093#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:04,943 INFO L273 TraceCheckUtils]: 49: Hoare triple {16093#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:04,943 INFO L273 TraceCheckUtils]: 50: Hoare triple {16094#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:04,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {16094#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:04,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {16095#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:04,945 INFO L273 TraceCheckUtils]: 53: Hoare triple {16095#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:04,946 INFO L273 TraceCheckUtils]: 54: Hoare triple {16096#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:04,946 INFO L273 TraceCheckUtils]: 55: Hoare triple {16096#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:04,947 INFO L273 TraceCheckUtils]: 56: Hoare triple {16097#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:04,948 INFO L273 TraceCheckUtils]: 57: Hoare triple {16097#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:04,948 INFO L273 TraceCheckUtils]: 58: Hoare triple {16098#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:04,949 INFO L273 TraceCheckUtils]: 59: Hoare triple {16098#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:04,949 INFO L273 TraceCheckUtils]: 60: Hoare triple {16099#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:04,950 INFO L273 TraceCheckUtils]: 61: Hoare triple {16099#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:04,951 INFO L273 TraceCheckUtils]: 62: Hoare triple {16100#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:04,951 INFO L273 TraceCheckUtils]: 63: Hoare triple {16100#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:04,952 INFO L273 TraceCheckUtils]: 64: Hoare triple {16101#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:04,953 INFO L273 TraceCheckUtils]: 65: Hoare triple {16101#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:04,953 INFO L273 TraceCheckUtils]: 66: Hoare triple {16102#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:04,954 INFO L273 TraceCheckUtils]: 67: Hoare triple {16102#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:04,954 INFO L273 TraceCheckUtils]: 68: Hoare triple {16103#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:04,955 INFO L273 TraceCheckUtils]: 69: Hoare triple {16103#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:04,956 INFO L273 TraceCheckUtils]: 70: Hoare triple {16104#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:04,956 INFO L273 TraceCheckUtils]: 71: Hoare triple {16104#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:04,957 INFO L273 TraceCheckUtils]: 72: Hoare triple {16105#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:04,958 INFO L273 TraceCheckUtils]: 73: Hoare triple {16105#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:04,958 INFO L273 TraceCheckUtils]: 74: Hoare triple {16106#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:04,959 INFO L273 TraceCheckUtils]: 75: Hoare triple {16106#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:04,959 INFO L273 TraceCheckUtils]: 76: Hoare triple {16107#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:04,960 INFO L273 TraceCheckUtils]: 77: Hoare triple {16107#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:04,961 INFO L273 TraceCheckUtils]: 78: Hoare triple {16108#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:04,961 INFO L273 TraceCheckUtils]: 79: Hoare triple {16108#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16109#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:04,962 INFO L273 TraceCheckUtils]: 80: Hoare triple {16109#(<= main_~i~0 37)} assume !(~i~0 < 2048); {16071#false} is VALID [2018-11-23 13:09:04,962 INFO L273 TraceCheckUtils]: 81: Hoare triple {16071#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16071#false} is VALID [2018-11-23 13:09:04,962 INFO L256 TraceCheckUtils]: 82: Hoare triple {16071#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16071#false} is VALID [2018-11-23 13:09:04,963 INFO L273 TraceCheckUtils]: 83: Hoare triple {16071#false} ~cond := #in~cond; {16071#false} is VALID [2018-11-23 13:09:04,963 INFO L273 TraceCheckUtils]: 84: Hoare triple {16071#false} assume 0 == ~cond; {16071#false} is VALID [2018-11-23 13:09:04,963 INFO L273 TraceCheckUtils]: 85: Hoare triple {16071#false} assume !false; {16071#false} is VALID [2018-11-23 13:09:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:04,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:04,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:04,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:05,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:05,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {16070#true} call ULTIMATE.init(); {16070#true} is VALID [2018-11-23 13:09:05,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {16070#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16070#true} is VALID [2018-11-23 13:09:05,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {16070#true} assume true; {16070#true} is VALID [2018-11-23 13:09:05,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16070#true} {16070#true} #35#return; {16070#true} is VALID [2018-11-23 13:09:05,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {16070#true} call #t~ret4 := main(); {16070#true} is VALID [2018-11-23 13:09:05,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {16070#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16128#(<= main_~i~0 0)} is VALID [2018-11-23 13:09:05,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {16128#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16128#(<= main_~i~0 0)} is VALID [2018-11-23 13:09:05,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {16128#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:05,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {16073#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16073#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:05,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {16073#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:05,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {16074#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16074#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:05,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {16074#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:05,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {16075#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16075#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:05,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {16075#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:05,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {16076#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16076#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:05,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {16076#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:05,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {16077#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16077#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:05,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {16077#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:05,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {16078#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16078#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:05,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {16078#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:05,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {16079#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16079#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:05,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {16079#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:05,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {16080#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16080#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:05,338 INFO L273 TraceCheckUtils]: 23: Hoare triple {16080#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:05,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {16081#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16081#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:05,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {16081#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:05,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {16082#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16082#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:05,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {16082#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:05,341 INFO L273 TraceCheckUtils]: 28: Hoare triple {16083#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16083#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:05,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {16083#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:05,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {16084#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16084#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:05,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {16084#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:05,344 INFO L273 TraceCheckUtils]: 32: Hoare triple {16085#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16085#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:05,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {16085#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:05,345 INFO L273 TraceCheckUtils]: 34: Hoare triple {16086#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16086#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:05,346 INFO L273 TraceCheckUtils]: 35: Hoare triple {16086#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:05,346 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16087#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:05,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {16087#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:05,348 INFO L273 TraceCheckUtils]: 38: Hoare triple {16088#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16088#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:05,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {16088#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:05,349 INFO L273 TraceCheckUtils]: 40: Hoare triple {16089#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16089#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:05,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {16089#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:05,350 INFO L273 TraceCheckUtils]: 42: Hoare triple {16090#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16090#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:05,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {16090#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:05,351 INFO L273 TraceCheckUtils]: 44: Hoare triple {16091#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16091#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:05,352 INFO L273 TraceCheckUtils]: 45: Hoare triple {16091#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:05,352 INFO L273 TraceCheckUtils]: 46: Hoare triple {16092#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16092#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:05,353 INFO L273 TraceCheckUtils]: 47: Hoare triple {16092#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:05,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {16093#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16093#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:05,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {16093#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:05,355 INFO L273 TraceCheckUtils]: 50: Hoare triple {16094#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16094#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:05,356 INFO L273 TraceCheckUtils]: 51: Hoare triple {16094#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:05,356 INFO L273 TraceCheckUtils]: 52: Hoare triple {16095#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16095#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:05,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {16095#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:05,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {16096#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16096#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:05,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {16096#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:05,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {16097#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16097#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:05,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {16097#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:05,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {16098#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16098#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:05,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {16098#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:05,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {16099#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16099#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:05,362 INFO L273 TraceCheckUtils]: 61: Hoare triple {16099#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:05,362 INFO L273 TraceCheckUtils]: 62: Hoare triple {16100#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16100#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:05,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {16100#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:05,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {16101#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16101#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:05,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {16101#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:05,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {16102#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16102#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:05,366 INFO L273 TraceCheckUtils]: 67: Hoare triple {16102#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:05,366 INFO L273 TraceCheckUtils]: 68: Hoare triple {16103#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16103#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:05,367 INFO L273 TraceCheckUtils]: 69: Hoare triple {16103#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:05,367 INFO L273 TraceCheckUtils]: 70: Hoare triple {16104#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16104#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:05,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {16104#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:05,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {16105#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16105#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:05,369 INFO L273 TraceCheckUtils]: 73: Hoare triple {16105#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:05,370 INFO L273 TraceCheckUtils]: 74: Hoare triple {16106#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16106#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:05,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {16106#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:05,371 INFO L273 TraceCheckUtils]: 76: Hoare triple {16107#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16107#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:05,372 INFO L273 TraceCheckUtils]: 77: Hoare triple {16107#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:05,372 INFO L273 TraceCheckUtils]: 78: Hoare triple {16108#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16108#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:05,373 INFO L273 TraceCheckUtils]: 79: Hoare triple {16108#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16109#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:05,373 INFO L273 TraceCheckUtils]: 80: Hoare triple {16109#(<= main_~i~0 37)} assume !(~i~0 < 2048); {16071#false} is VALID [2018-11-23 13:09:05,374 INFO L273 TraceCheckUtils]: 81: Hoare triple {16071#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16071#false} is VALID [2018-11-23 13:09:05,374 INFO L256 TraceCheckUtils]: 82: Hoare triple {16071#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16071#false} is VALID [2018-11-23 13:09:05,374 INFO L273 TraceCheckUtils]: 83: Hoare triple {16071#false} ~cond := #in~cond; {16071#false} is VALID [2018-11-23 13:09:05,374 INFO L273 TraceCheckUtils]: 84: Hoare triple {16071#false} assume 0 == ~cond; {16071#false} is VALID [2018-11-23 13:09:05,374 INFO L273 TraceCheckUtils]: 85: Hoare triple {16071#false} assume !false; {16071#false} is VALID [2018-11-23 13:09:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:05,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:05,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 13:09:05,405 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-11-23 13:09:05,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:05,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 13:09:05,505 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 13:09:05,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 13:09:05,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 13:09:05,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:09:05,507 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-11-23 13:09:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,024 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-23 13:09:06,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 13:09:06,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-11-23 13:09:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:09:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2018-11-23 13:09:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:09:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 96 transitions. [2018-11-23 13:09:06,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 96 transitions. [2018-11-23 13:09:06,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:06,118 INFO L225 Difference]: With dead ends: 96 [2018-11-23 13:09:06,119 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 13:09:06,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:09:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 13:09:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 13:09:06,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:06,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 13:09:06,150 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 13:09:06,150 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 13:09:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,151 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:09:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-23 13:09:06,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:06,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:06,152 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 13:09:06,152 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 13:09:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:06,153 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-23 13:09:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-11-23 13:09:06,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:06,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:06,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:06,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 13:09:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-23 13:09:06,156 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-11-23 13:09:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:06,156 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-23 13:09:06,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 13:09:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-23 13:09:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 13:09:06,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:06,157 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:06,157 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:06,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash -604151127, now seen corresponding path program 38 times [2018-11-23 13:09:06,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:06,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:06,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:06,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:06,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:07,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {16825#true} call ULTIMATE.init(); {16825#true} is VALID [2018-11-23 13:09:07,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {16825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16825#true} is VALID [2018-11-23 13:09:07,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {16825#true} assume true; {16825#true} is VALID [2018-11-23 13:09:07,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16825#true} {16825#true} #35#return; {16825#true} is VALID [2018-11-23 13:09:07,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {16825#true} call #t~ret4 := main(); {16825#true} is VALID [2018-11-23 13:09:07,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {16825#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16827#(= main_~i~0 0)} is VALID [2018-11-23 13:09:07,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {16827#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16827#(= main_~i~0 0)} is VALID [2018-11-23 13:09:07,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {16827#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:07,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {16828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:07,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {16828#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:07,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {16829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:07,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {16829#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:07,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {16830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:07,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {16830#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:07,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {16831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:07,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {16831#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:07,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {16832#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:07,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {16832#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:07,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {16833#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:07,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {16833#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:07,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:07,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:07,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {16835#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:07,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {16835#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:07,392 INFO L273 TraceCheckUtils]: 24: Hoare triple {16836#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:07,393 INFO L273 TraceCheckUtils]: 25: Hoare triple {16836#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:07,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {16837#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:07,394 INFO L273 TraceCheckUtils]: 27: Hoare triple {16837#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:07,395 INFO L273 TraceCheckUtils]: 28: Hoare triple {16838#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:07,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {16838#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:07,396 INFO L273 TraceCheckUtils]: 30: Hoare triple {16839#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:07,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {16839#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:07,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {16840#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:07,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {16840#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:07,398 INFO L273 TraceCheckUtils]: 34: Hoare triple {16841#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:07,399 INFO L273 TraceCheckUtils]: 35: Hoare triple {16841#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:07,399 INFO L273 TraceCheckUtils]: 36: Hoare triple {16842#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:07,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {16842#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:07,401 INFO L273 TraceCheckUtils]: 38: Hoare triple {16843#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:07,401 INFO L273 TraceCheckUtils]: 39: Hoare triple {16843#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:07,402 INFO L273 TraceCheckUtils]: 40: Hoare triple {16844#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:07,402 INFO L273 TraceCheckUtils]: 41: Hoare triple {16844#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:07,403 INFO L273 TraceCheckUtils]: 42: Hoare triple {16845#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:07,404 INFO L273 TraceCheckUtils]: 43: Hoare triple {16845#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:07,404 INFO L273 TraceCheckUtils]: 44: Hoare triple {16846#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:07,405 INFO L273 TraceCheckUtils]: 45: Hoare triple {16846#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:07,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {16847#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:07,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {16847#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:07,406 INFO L273 TraceCheckUtils]: 48: Hoare triple {16848#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:07,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {16848#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:07,408 INFO L273 TraceCheckUtils]: 50: Hoare triple {16849#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:07,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {16849#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:07,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {16850#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:07,409 INFO L273 TraceCheckUtils]: 53: Hoare triple {16850#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:07,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {16851#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:07,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {16851#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:07,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {16852#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:07,412 INFO L273 TraceCheckUtils]: 57: Hoare triple {16852#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:07,412 INFO L273 TraceCheckUtils]: 58: Hoare triple {16853#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:07,413 INFO L273 TraceCheckUtils]: 59: Hoare triple {16853#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:07,413 INFO L273 TraceCheckUtils]: 60: Hoare triple {16854#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:07,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {16854#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:07,415 INFO L273 TraceCheckUtils]: 62: Hoare triple {16855#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:07,415 INFO L273 TraceCheckUtils]: 63: Hoare triple {16855#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:07,416 INFO L273 TraceCheckUtils]: 64: Hoare triple {16856#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:07,416 INFO L273 TraceCheckUtils]: 65: Hoare triple {16856#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:07,417 INFO L273 TraceCheckUtils]: 66: Hoare triple {16857#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:07,418 INFO L273 TraceCheckUtils]: 67: Hoare triple {16857#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:07,418 INFO L273 TraceCheckUtils]: 68: Hoare triple {16858#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:07,419 INFO L273 TraceCheckUtils]: 69: Hoare triple {16858#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:07,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {16859#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:07,420 INFO L273 TraceCheckUtils]: 71: Hoare triple {16859#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:07,420 INFO L273 TraceCheckUtils]: 72: Hoare triple {16860#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:07,421 INFO L273 TraceCheckUtils]: 73: Hoare triple {16860#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:07,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {16861#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:07,422 INFO L273 TraceCheckUtils]: 75: Hoare triple {16861#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:07,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {16862#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:07,423 INFO L273 TraceCheckUtils]: 77: Hoare triple {16862#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:07,424 INFO L273 TraceCheckUtils]: 78: Hoare triple {16863#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:07,425 INFO L273 TraceCheckUtils]: 79: Hoare triple {16863#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:07,425 INFO L273 TraceCheckUtils]: 80: Hoare triple {16864#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:07,426 INFO L273 TraceCheckUtils]: 81: Hoare triple {16864#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16865#(<= main_~i~0 38)} is VALID [2018-11-23 13:09:07,426 INFO L273 TraceCheckUtils]: 82: Hoare triple {16865#(<= main_~i~0 38)} assume !(~i~0 < 2048); {16826#false} is VALID [2018-11-23 13:09:07,427 INFO L273 TraceCheckUtils]: 83: Hoare triple {16826#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16826#false} is VALID [2018-11-23 13:09:07,427 INFO L256 TraceCheckUtils]: 84: Hoare triple {16826#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16826#false} is VALID [2018-11-23 13:09:07,427 INFO L273 TraceCheckUtils]: 85: Hoare triple {16826#false} ~cond := #in~cond; {16826#false} is VALID [2018-11-23 13:09:07,427 INFO L273 TraceCheckUtils]: 86: Hoare triple {16826#false} assume 0 == ~cond; {16826#false} is VALID [2018-11-23 13:09:07,427 INFO L273 TraceCheckUtils]: 87: Hoare triple {16826#false} assume !false; {16826#false} is VALID [2018-11-23 13:09:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:07,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:07,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:07,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:09:07,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:09:07,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:07,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:07,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {16825#true} call ULTIMATE.init(); {16825#true} is VALID [2018-11-23 13:09:07,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {16825#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16825#true} is VALID [2018-11-23 13:09:07,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {16825#true} assume true; {16825#true} is VALID [2018-11-23 13:09:07,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16825#true} {16825#true} #35#return; {16825#true} is VALID [2018-11-23 13:09:07,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {16825#true} call #t~ret4 := main(); {16825#true} is VALID [2018-11-23 13:09:07,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {16825#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16884#(<= main_~i~0 0)} is VALID [2018-11-23 13:09:07,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {16884#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16884#(<= main_~i~0 0)} is VALID [2018-11-23 13:09:07,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {16884#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:07,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {16828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16828#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:07,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {16828#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:07,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {16829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16829#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:07,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {16829#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:07,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {16830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16830#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:07,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {16830#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:07,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {16831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16831#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:07,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {16831#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:07,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {16832#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16832#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:07,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {16832#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:07,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {16833#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16833#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:07,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {16833#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:07,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16834#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:07,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:07,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {16835#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16835#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:07,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {16835#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:07,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {16836#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16836#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:07,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {16836#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:07,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {16837#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16837#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:07,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {16837#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:07,762 INFO L273 TraceCheckUtils]: 28: Hoare triple {16838#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16838#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:07,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {16838#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:07,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {16839#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16839#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:07,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {16839#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:07,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {16840#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16840#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:07,765 INFO L273 TraceCheckUtils]: 33: Hoare triple {16840#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:07,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {16841#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16841#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:07,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {16841#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:07,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {16842#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16842#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:07,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {16842#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:07,768 INFO L273 TraceCheckUtils]: 38: Hoare triple {16843#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16843#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:07,769 INFO L273 TraceCheckUtils]: 39: Hoare triple {16843#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:07,769 INFO L273 TraceCheckUtils]: 40: Hoare triple {16844#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16844#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:07,770 INFO L273 TraceCheckUtils]: 41: Hoare triple {16844#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:07,770 INFO L273 TraceCheckUtils]: 42: Hoare triple {16845#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16845#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:07,771 INFO L273 TraceCheckUtils]: 43: Hoare triple {16845#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:07,771 INFO L273 TraceCheckUtils]: 44: Hoare triple {16846#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16846#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:07,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {16846#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:07,773 INFO L273 TraceCheckUtils]: 46: Hoare triple {16847#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16847#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:07,773 INFO L273 TraceCheckUtils]: 47: Hoare triple {16847#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:07,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {16848#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16848#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:07,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {16848#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:07,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {16849#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16849#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:07,776 INFO L273 TraceCheckUtils]: 51: Hoare triple {16849#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:07,776 INFO L273 TraceCheckUtils]: 52: Hoare triple {16850#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16850#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:07,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {16850#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:07,777 INFO L273 TraceCheckUtils]: 54: Hoare triple {16851#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16851#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:07,778 INFO L273 TraceCheckUtils]: 55: Hoare triple {16851#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:07,778 INFO L273 TraceCheckUtils]: 56: Hoare triple {16852#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16852#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:07,779 INFO L273 TraceCheckUtils]: 57: Hoare triple {16852#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:07,780 INFO L273 TraceCheckUtils]: 58: Hoare triple {16853#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16853#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:07,780 INFO L273 TraceCheckUtils]: 59: Hoare triple {16853#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:07,781 INFO L273 TraceCheckUtils]: 60: Hoare triple {16854#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16854#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:07,781 INFO L273 TraceCheckUtils]: 61: Hoare triple {16854#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:07,782 INFO L273 TraceCheckUtils]: 62: Hoare triple {16855#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16855#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:07,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {16855#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:07,783 INFO L273 TraceCheckUtils]: 64: Hoare triple {16856#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16856#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:07,784 INFO L273 TraceCheckUtils]: 65: Hoare triple {16856#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:07,784 INFO L273 TraceCheckUtils]: 66: Hoare triple {16857#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16857#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:07,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {16857#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:07,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {16858#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16858#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:07,786 INFO L273 TraceCheckUtils]: 69: Hoare triple {16858#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:07,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {16859#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16859#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:07,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {16859#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:07,788 INFO L273 TraceCheckUtils]: 72: Hoare triple {16860#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16860#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:07,788 INFO L273 TraceCheckUtils]: 73: Hoare triple {16860#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:07,789 INFO L273 TraceCheckUtils]: 74: Hoare triple {16861#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16861#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:07,790 INFO L273 TraceCheckUtils]: 75: Hoare triple {16861#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:07,790 INFO L273 TraceCheckUtils]: 76: Hoare triple {16862#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16862#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:07,791 INFO L273 TraceCheckUtils]: 77: Hoare triple {16862#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:07,791 INFO L273 TraceCheckUtils]: 78: Hoare triple {16863#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16863#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:07,792 INFO L273 TraceCheckUtils]: 79: Hoare triple {16863#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:07,792 INFO L273 TraceCheckUtils]: 80: Hoare triple {16864#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16864#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:07,793 INFO L273 TraceCheckUtils]: 81: Hoare triple {16864#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16865#(<= main_~i~0 38)} is VALID [2018-11-23 13:09:07,794 INFO L273 TraceCheckUtils]: 82: Hoare triple {16865#(<= main_~i~0 38)} assume !(~i~0 < 2048); {16826#false} is VALID [2018-11-23 13:09:07,794 INFO L273 TraceCheckUtils]: 83: Hoare triple {16826#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16826#false} is VALID [2018-11-23 13:09:07,794 INFO L256 TraceCheckUtils]: 84: Hoare triple {16826#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {16826#false} is VALID [2018-11-23 13:09:07,794 INFO L273 TraceCheckUtils]: 85: Hoare triple {16826#false} ~cond := #in~cond; {16826#false} is VALID [2018-11-23 13:09:07,794 INFO L273 TraceCheckUtils]: 86: Hoare triple {16826#false} assume 0 == ~cond; {16826#false} is VALID [2018-11-23 13:09:07,795 INFO L273 TraceCheckUtils]: 87: Hoare triple {16826#false} assume !false; {16826#false} is VALID [2018-11-23 13:09:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:07,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:07,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 13:09:07,820 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-11-23 13:09:07,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:07,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 13:09:07,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:07,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 13:09:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:09:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:09:07,909 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2018-11-23 13:09:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:08,736 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-11-23 13:09:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 13:09:08,736 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-11-23 13:09:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:09:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 98 transitions. [2018-11-23 13:09:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:09:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 98 transitions. [2018-11-23 13:09:08,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 98 transitions. [2018-11-23 13:09:08,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:08,837 INFO L225 Difference]: With dead ends: 98 [2018-11-23 13:09:08,837 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 13:09:08,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:09:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 13:09:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 13:09:08,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:08,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2018-11-23 13:09:08,872 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2018-11-23 13:09:08,872 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2018-11-23 13:09:08,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:08,874 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:09:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-23 13:09:08,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:08,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:08,874 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2018-11-23 13:09:08,874 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2018-11-23 13:09:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:08,876 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-23 13:09:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-23 13:09:08,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:08,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:08,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:08,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 13:09:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-11-23 13:09:08,878 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-11-23 13:09:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:08,878 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-11-23 13:09:08,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 13:09:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-11-23 13:09:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 13:09:08,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:08,879 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:08,879 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:08,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1609369781, now seen corresponding path program 39 times [2018-11-23 13:09:08,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:08,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:08,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:09,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {17597#true} call ULTIMATE.init(); {17597#true} is VALID [2018-11-23 13:09:09,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {17597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17597#true} is VALID [2018-11-23 13:09:09,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {17597#true} assume true; {17597#true} is VALID [2018-11-23 13:09:09,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17597#true} {17597#true} #35#return; {17597#true} is VALID [2018-11-23 13:09:09,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {17597#true} call #t~ret4 := main(); {17597#true} is VALID [2018-11-23 13:09:09,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {17597#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {17599#(= main_~i~0 0)} is VALID [2018-11-23 13:09:09,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {17599#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17599#(= main_~i~0 0)} is VALID [2018-11-23 13:09:09,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {17599#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:09,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {17600#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:09:09,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {17600#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:09,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {17601#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:09:09,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {17601#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:09,984 INFO L273 TraceCheckUtils]: 12: Hoare triple {17602#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:09:09,985 INFO L273 TraceCheckUtils]: 13: Hoare triple {17602#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:09,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {17603#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:09:09,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {17603#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:09,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {17604#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:09:09,987 INFO L273 TraceCheckUtils]: 17: Hoare triple {17604#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:09,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {17605#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:09:09,988 INFO L273 TraceCheckUtils]: 19: Hoare triple {17605#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:09,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {17606#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:09:09,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {17606#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:09,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {17607#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:09:09,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {17607#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:09,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {17608#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:09:09,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {17608#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:09,992 INFO L273 TraceCheckUtils]: 26: Hoare triple {17609#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:09:09,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {17609#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:09,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {17610#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:09:09,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {17610#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:09,995 INFO L273 TraceCheckUtils]: 30: Hoare triple {17611#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:09:09,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {17611#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:09,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {17612#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:09:09,997 INFO L273 TraceCheckUtils]: 33: Hoare triple {17612#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:09,997 INFO L273 TraceCheckUtils]: 34: Hoare triple {17613#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:09:09,998 INFO L273 TraceCheckUtils]: 35: Hoare triple {17613#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:09,998 INFO L273 TraceCheckUtils]: 36: Hoare triple {17614#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:09:09,999 INFO L273 TraceCheckUtils]: 37: Hoare triple {17614#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:10,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {17615#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:09:10,000 INFO L273 TraceCheckUtils]: 39: Hoare triple {17615#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:10,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {17616#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:09:10,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {17616#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:10,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {17617#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:09:10,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {17617#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:10,032 INFO L273 TraceCheckUtils]: 44: Hoare triple {17618#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:09:10,033 INFO L273 TraceCheckUtils]: 45: Hoare triple {17618#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:10,033 INFO L273 TraceCheckUtils]: 46: Hoare triple {17619#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:09:10,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {17619#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:10,034 INFO L273 TraceCheckUtils]: 48: Hoare triple {17620#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:09:10,034 INFO L273 TraceCheckUtils]: 49: Hoare triple {17620#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:10,034 INFO L273 TraceCheckUtils]: 50: Hoare triple {17621#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:09:10,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {17621#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:10,036 INFO L273 TraceCheckUtils]: 52: Hoare triple {17622#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:09:10,036 INFO L273 TraceCheckUtils]: 53: Hoare triple {17622#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:10,037 INFO L273 TraceCheckUtils]: 54: Hoare triple {17623#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:09:10,037 INFO L273 TraceCheckUtils]: 55: Hoare triple {17623#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:10,043 INFO L273 TraceCheckUtils]: 56: Hoare triple {17624#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:09:10,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {17624#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:10,044 INFO L273 TraceCheckUtils]: 58: Hoare triple {17625#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:09:10,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {17625#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:10,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {17626#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:09:10,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {17626#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:10,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {17627#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:09:10,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {17627#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:10,046 INFO L273 TraceCheckUtils]: 64: Hoare triple {17628#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:09:10,046 INFO L273 TraceCheckUtils]: 65: Hoare triple {17628#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:10,047 INFO L273 TraceCheckUtils]: 66: Hoare triple {17629#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:09:10,047 INFO L273 TraceCheckUtils]: 67: Hoare triple {17629#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:10,048 INFO L273 TraceCheckUtils]: 68: Hoare triple {17630#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:09:10,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {17630#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:10,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {17631#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:09:10,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {17631#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:10,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {17632#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:09:10,051 INFO L273 TraceCheckUtils]: 73: Hoare triple {17632#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:10,052 INFO L273 TraceCheckUtils]: 74: Hoare triple {17633#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:09:10,052 INFO L273 TraceCheckUtils]: 75: Hoare triple {17633#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:10,053 INFO L273 TraceCheckUtils]: 76: Hoare triple {17634#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:09:10,053 INFO L273 TraceCheckUtils]: 77: Hoare triple {17634#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:10,054 INFO L273 TraceCheckUtils]: 78: Hoare triple {17635#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:09:10,055 INFO L273 TraceCheckUtils]: 79: Hoare triple {17635#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:10,055 INFO L273 TraceCheckUtils]: 80: Hoare triple {17636#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:09:10,056 INFO L273 TraceCheckUtils]: 81: Hoare triple {17636#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:09:10,056 INFO L273 TraceCheckUtils]: 82: Hoare triple {17637#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:09:10,057 INFO L273 TraceCheckUtils]: 83: Hoare triple {17637#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~i~0 39)} is VALID [2018-11-23 13:09:10,058 INFO L273 TraceCheckUtils]: 84: Hoare triple {17638#(<= main_~i~0 39)} assume !(~i~0 < 2048); {17598#false} is VALID [2018-11-23 13:09:10,058 INFO L273 TraceCheckUtils]: 85: Hoare triple {17598#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {17598#false} is VALID [2018-11-23 13:09:10,058 INFO L256 TraceCheckUtils]: 86: Hoare triple {17598#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {17598#false} is VALID [2018-11-23 13:09:10,058 INFO L273 TraceCheckUtils]: 87: Hoare triple {17598#false} ~cond := #in~cond; {17598#false} is VALID [2018-11-23 13:09:10,059 INFO L273 TraceCheckUtils]: 88: Hoare triple {17598#false} assume 0 == ~cond; {17598#false} is VALID [2018-11-23 13:09:10,059 INFO L273 TraceCheckUtils]: 89: Hoare triple {17598#false} assume !false; {17598#false} is VALID [2018-11-23 13:09:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:10,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:10,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:10,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:10:02,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 13:10:02,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:02,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:02,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {17597#true} call ULTIMATE.init(); {17597#true} is VALID [2018-11-23 13:10:02,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {17597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17597#true} is VALID [2018-11-23 13:10:02,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {17597#true} assume true; {17597#true} is VALID [2018-11-23 13:10:02,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17597#true} {17597#true} #35#return; {17597#true} is VALID [2018-11-23 13:10:02,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {17597#true} call #t~ret4 := main(); {17597#true} is VALID [2018-11-23 13:10:02,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {17597#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {17657#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:02,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {17657#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17657#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:02,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {17657#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:10:02,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {17600#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17600#(<= main_~i~0 1)} is VALID [2018-11-23 13:10:02,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {17600#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:10:02,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {17601#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17601#(<= main_~i~0 2)} is VALID [2018-11-23 13:10:02,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {17601#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:10:02,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {17602#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17602#(<= main_~i~0 3)} is VALID [2018-11-23 13:10:02,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {17602#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:10:02,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {17603#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17603#(<= main_~i~0 4)} is VALID [2018-11-23 13:10:02,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {17603#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:10:02,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {17604#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17604#(<= main_~i~0 5)} is VALID [2018-11-23 13:10:02,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {17604#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:10:02,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {17605#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17605#(<= main_~i~0 6)} is VALID [2018-11-23 13:10:02,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {17605#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:10:02,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {17606#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17606#(<= main_~i~0 7)} is VALID [2018-11-23 13:10:02,712 INFO L273 TraceCheckUtils]: 21: Hoare triple {17606#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:10:02,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {17607#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17607#(<= main_~i~0 8)} is VALID [2018-11-23 13:10:02,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {17607#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:10:02,716 INFO L273 TraceCheckUtils]: 24: Hoare triple {17608#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17608#(<= main_~i~0 9)} is VALID [2018-11-23 13:10:02,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {17608#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:10:02,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {17609#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17609#(<= main_~i~0 10)} is VALID [2018-11-23 13:10:02,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {17609#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:10:02,722 INFO L273 TraceCheckUtils]: 28: Hoare triple {17610#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17610#(<= main_~i~0 11)} is VALID [2018-11-23 13:10:02,722 INFO L273 TraceCheckUtils]: 29: Hoare triple {17610#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:10:02,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {17611#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17611#(<= main_~i~0 12)} is VALID [2018-11-23 13:10:02,724 INFO L273 TraceCheckUtils]: 31: Hoare triple {17611#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:10:02,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {17612#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17612#(<= main_~i~0 13)} is VALID [2018-11-23 13:10:02,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {17612#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:10:02,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {17613#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17613#(<= main_~i~0 14)} is VALID [2018-11-23 13:10:02,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {17613#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:10:02,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {17614#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17614#(<= main_~i~0 15)} is VALID [2018-11-23 13:10:02,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {17614#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:10:02,729 INFO L273 TraceCheckUtils]: 38: Hoare triple {17615#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17615#(<= main_~i~0 16)} is VALID [2018-11-23 13:10:02,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {17615#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:10:02,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {17616#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17616#(<= main_~i~0 17)} is VALID [2018-11-23 13:10:02,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {17616#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:10:02,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {17617#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17617#(<= main_~i~0 18)} is VALID [2018-11-23 13:10:02,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {17617#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:10:02,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {17618#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17618#(<= main_~i~0 19)} is VALID [2018-11-23 13:10:02,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {17618#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:10:02,733 INFO L273 TraceCheckUtils]: 46: Hoare triple {17619#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17619#(<= main_~i~0 20)} is VALID [2018-11-23 13:10:02,733 INFO L273 TraceCheckUtils]: 47: Hoare triple {17619#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:10:02,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {17620#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17620#(<= main_~i~0 21)} is VALID [2018-11-23 13:10:02,735 INFO L273 TraceCheckUtils]: 49: Hoare triple {17620#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:10:02,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {17621#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17621#(<= main_~i~0 22)} is VALID [2018-11-23 13:10:02,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {17621#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:10:02,736 INFO L273 TraceCheckUtils]: 52: Hoare triple {17622#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17622#(<= main_~i~0 23)} is VALID [2018-11-23 13:10:02,737 INFO L273 TraceCheckUtils]: 53: Hoare triple {17622#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:10:02,738 INFO L273 TraceCheckUtils]: 54: Hoare triple {17623#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17623#(<= main_~i~0 24)} is VALID [2018-11-23 13:10:02,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {17623#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:10:02,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {17624#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17624#(<= main_~i~0 25)} is VALID [2018-11-23 13:10:02,740 INFO L273 TraceCheckUtils]: 57: Hoare triple {17624#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:10:02,740 INFO L273 TraceCheckUtils]: 58: Hoare triple {17625#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17625#(<= main_~i~0 26)} is VALID [2018-11-23 13:10:02,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {17625#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:10:02,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {17626#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17626#(<= main_~i~0 27)} is VALID [2018-11-23 13:10:02,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {17626#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:10:02,743 INFO L273 TraceCheckUtils]: 62: Hoare triple {17627#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17627#(<= main_~i~0 28)} is VALID [2018-11-23 13:10:02,743 INFO L273 TraceCheckUtils]: 63: Hoare triple {17627#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:10:02,744 INFO L273 TraceCheckUtils]: 64: Hoare triple {17628#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17628#(<= main_~i~0 29)} is VALID [2018-11-23 13:10:02,745 INFO L273 TraceCheckUtils]: 65: Hoare triple {17628#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:10:02,745 INFO L273 TraceCheckUtils]: 66: Hoare triple {17629#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17629#(<= main_~i~0 30)} is VALID [2018-11-23 13:10:02,746 INFO L273 TraceCheckUtils]: 67: Hoare triple {17629#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:10:02,746 INFO L273 TraceCheckUtils]: 68: Hoare triple {17630#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17630#(<= main_~i~0 31)} is VALID [2018-11-23 13:10:02,747 INFO L273 TraceCheckUtils]: 69: Hoare triple {17630#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:10:02,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {17631#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17631#(<= main_~i~0 32)} is VALID [2018-11-23 13:10:02,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {17631#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:10:02,749 INFO L273 TraceCheckUtils]: 72: Hoare triple {17632#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17632#(<= main_~i~0 33)} is VALID [2018-11-23 13:10:02,750 INFO L273 TraceCheckUtils]: 73: Hoare triple {17632#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:10:02,750 INFO L273 TraceCheckUtils]: 74: Hoare triple {17633#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17633#(<= main_~i~0 34)} is VALID [2018-11-23 13:10:02,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {17633#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:10:02,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {17634#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17634#(<= main_~i~0 35)} is VALID [2018-11-23 13:10:02,752 INFO L273 TraceCheckUtils]: 77: Hoare triple {17634#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:10:02,753 INFO L273 TraceCheckUtils]: 78: Hoare triple {17635#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17635#(<= main_~i~0 36)} is VALID [2018-11-23 13:10:02,753 INFO L273 TraceCheckUtils]: 79: Hoare triple {17635#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:10:02,754 INFO L273 TraceCheckUtils]: 80: Hoare triple {17636#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17636#(<= main_~i~0 37)} is VALID [2018-11-23 13:10:02,754 INFO L273 TraceCheckUtils]: 81: Hoare triple {17636#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:10:02,755 INFO L273 TraceCheckUtils]: 82: Hoare triple {17637#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem1;havoc #t~mem1;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17637#(<= main_~i~0 38)} is VALID [2018-11-23 13:10:02,756 INFO L273 TraceCheckUtils]: 83: Hoare triple {17637#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17638#(<= main_~i~0 39)} is VALID [2018-11-23 13:10:02,756 INFO L273 TraceCheckUtils]: 84: Hoare triple {17638#(<= main_~i~0 39)} assume !(~i~0 < 2048); {17598#false} is VALID [2018-11-23 13:10:02,757 INFO L273 TraceCheckUtils]: 85: Hoare triple {17598#false} call #t~mem2 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem3 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {17598#false} is VALID [2018-11-23 13:10:02,757 INFO L256 TraceCheckUtils]: 86: Hoare triple {17598#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {17598#false} is VALID [2018-11-23 13:10:02,757 INFO L273 TraceCheckUtils]: 87: Hoare triple {17598#false} ~cond := #in~cond; {17598#false} is VALID [2018-11-23 13:10:02,757 INFO L273 TraceCheckUtils]: 88: Hoare triple {17598#false} assume 0 == ~cond; {17598#false} is VALID [2018-11-23 13:10:02,757 INFO L273 TraceCheckUtils]: 89: Hoare triple {17598#false} assume !false; {17598#false} is VALID [2018-11-23 13:10:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:02,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:02,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 13:10:02,790 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-11-23 13:10:02,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:02,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 13:10:02,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:02,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 13:10:02,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 13:10:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:10:02,885 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2018-11-23 13:10:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:03,414 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-11-23 13:10:03,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 13:10:03,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-11-23 13:10:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:10:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2018-11-23 13:10:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:10:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 100 transitions. [2018-11-23 13:10:03,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 100 transitions. [2018-11-23 13:10:03,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:03,517 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:10:03,517 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 13:10:03,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 13:10:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 13:10:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-23 13:10:03,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:03,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 93 states. [2018-11-23 13:10:03,551 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 93 states. [2018-11-23 13:10:03,551 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 93 states. [2018-11-23 13:10:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:03,553 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-23 13:10:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-11-23 13:10:03,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:03,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:03,553 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 94 states. [2018-11-23 13:10:03,554 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 94 states. [2018-11-23 13:10:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:03,555 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-11-23 13:10:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-11-23 13:10:03,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:03,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:03,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:03,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 13:10:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-11-23 13:10:03,557 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-11-23 13:10:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:03,557 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-11-23 13:10:03,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 13:10:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-11-23 13:10:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 13:10:03,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:03,558 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:03,559 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:03,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1256854675, now seen corresponding path program 40 times [2018-11-23 13:10:03,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:03,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:03,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat