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/array-examples/standard_partial_init_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:05:16,531 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:05:16,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:05:16,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:05:16,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:05:16,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:05:16,559 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:05:16,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:05:16,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:05:16,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:05:16,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:05:16,565 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:05:16,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:05:16,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:05:16,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:05:16,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:05:16,570 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:05:16,572 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:05:16,574 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:05:16,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:05:16,577 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:05:16,578 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:05:16,581 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:05:16,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:05:16,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:05:16,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:05:16,583 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:05:16,584 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:05:16,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:05:16,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:05:16,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:05:16,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:05:16,587 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:05:16,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:05:16,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:05:16,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:05:16,590 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:05:16,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:05:16,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:05:16,608 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:05:16,609 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:05:16,609 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:05:16,609 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:05:16,610 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:05:16,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:05:16,610 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:05:16,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:05:16,611 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:05:16,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:05:16,611 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:05:16,611 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:05:16,611 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:05:16,611 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:05:16,612 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:05:16,612 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:05:16,612 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:05:16,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:05:16,612 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:05:16,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:05:16,613 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:05:16,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:16,613 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:05:16,613 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:05:16,614 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:05:16,614 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:05:16,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:05:16,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:05:16,614 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:05:16,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:05:16,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:05:16,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:05:16,705 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:05:16,706 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:05:16,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i [2018-11-23 12:05:16,768 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4dcada8/bdb7504067ac4d06adb26c378a86c017/FLAG33045300c [2018-11-23 12:05:17,236 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:05:17,237 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partial_init_true-unreach-call_ground.i [2018-11-23 12:05:17,247 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4dcada8/bdb7504067ac4d06adb26c378a86c017/FLAG33045300c [2018-11-23 12:05:17,598 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4dcada8/bdb7504067ac4d06adb26c378a86c017 [2018-11-23 12:05:17,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:05:17,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:05:17,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:17,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:05:17,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:05:17,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:17,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3900b513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17, skipping insertion in model container [2018-11-23 12:05:17,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:17,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:05:17,659 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:05:17,894 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:17,898 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:05:17,926 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:05:17,950 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:05:17,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17 WrapperNode [2018-11-23 12:05:17,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:05:17,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:17,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:05:17,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:05:17,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:17,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:17,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:05:17,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:05:17,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:05:17,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:05:17,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:17,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:17,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:17,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:18,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:18,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:18,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... [2018-11-23 12:05:18,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:05:18,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:05:18,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:05:18,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:05:18,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:05:18,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:05:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:05:18,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:05:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:05:18,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:05:18,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:05:18,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:05:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:05:18,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:05:18,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:05:18,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:05:18,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:05:18,862 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:05:18,862 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:05:18,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:18 BoogieIcfgContainer [2018-11-23 12:05:18,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:05:18,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:05:18,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:05:18,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:05:18,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:17" (1/3) ... [2018-11-23 12:05:18,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9809fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:18, skipping insertion in model container [2018-11-23 12:05:18,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:17" (2/3) ... [2018-11-23 12:05:18,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9809fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:18, skipping insertion in model container [2018-11-23 12:05:18,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:18" (3/3) ... [2018-11-23 12:05:18,873 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partial_init_true-unreach-call_ground.i [2018-11-23 12:05:18,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:05:18,891 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:05:18,908 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:05:18,941 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:05:18,942 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:05:18,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:05:18,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:05:18,942 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:05:18,942 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:05:18,942 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:05:18,942 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:05:18,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:05:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 12:05:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:18,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:18,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:18,973 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:18,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1764441170, now seen corresponding path program 1 times [2018-11-23 12:05:18,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:18,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:19,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:19,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:19,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 12:05:19,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 12:05:19,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 12:05:19,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #70#return; {33#true} is VALID [2018-11-23 12:05:19,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2018-11-23 12:05:19,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {33#true} is VALID [2018-11-23 12:05:19,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 12:05:19,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~x~0;~x~0 := 0; {34#false} is VALID [2018-11-23 12:05:19,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {34#false} is VALID [2018-11-23 12:05:19,143 INFO L256 TraceCheckUtils]: 9: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {34#false} is VALID [2018-11-23 12:05:19,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 12:05:19,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 12:05:19,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 12:05:19,147 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 12:05:19,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:05:19,155 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:19,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:19,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:05:19,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:19,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:05:19,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:05:19,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:19,261 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 12:05:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,562 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 12:05:19,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:05:19,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:05:19,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:05:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:05:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 12:05:19,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 12:05:19,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:19,859 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:05:19,859 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:05:19,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:05:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:05:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:05:19,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:19,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:05:19,913 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:05:19,913 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:05:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,919 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 12:05:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 12:05:19,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:19,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:19,920 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:05:19,921 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:05:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:19,926 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 12:05:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 12:05:19,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:19,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:19,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:19,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 12:05:19,933 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2018-11-23 12:05:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:19,934 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 12:05:19,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:05:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 12:05:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:05:19,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:19,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:19,936 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:19,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash 591835271, now seen corresponding path program 1 times [2018-11-23 12:05:19,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:19,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:19,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {188#true} call ULTIMATE.init(); {188#true} is VALID [2018-11-23 12:05:20,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {188#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {188#true} is VALID [2018-11-23 12:05:20,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {188#true} assume true; {188#true} is VALID [2018-11-23 12:05:20,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} #70#return; {188#true} is VALID [2018-11-23 12:05:20,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {188#true} call #t~ret7 := main(); {188#true} is VALID [2018-11-23 12:05:20,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {190#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {190#(= main_~i~0 0)} assume !(~i~0 < 100000); {189#false} is VALID [2018-11-23 12:05:20,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#false} havoc ~x~0;~x~0 := 0; {189#false} is VALID [2018-11-23 12:05:20,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {189#false} is VALID [2018-11-23 12:05:20,065 INFO L256 TraceCheckUtils]: 9: Hoare triple {189#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {189#false} is VALID [2018-11-23 12:05:20,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {189#false} ~cond := #in~cond; {189#false} is VALID [2018-11-23 12:05:20,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {189#false} assume 0 == ~cond; {189#false} is VALID [2018-11-23 12:05:20,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {189#false} assume !false; {189#false} is VALID [2018-11-23 12:05:20,068 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 12:05:20,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:05:20,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:05:20,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:20,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:20,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:05:20,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:20,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:05:20,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:05:20,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:20,143 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-23 12:05:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:20,297 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:05:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:05:20,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:05:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-23 12:05:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:05:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-23 12:05:20,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2018-11-23 12:05:20,828 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 12:05:20,830 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:05:20,831 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:05:20,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:05:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:05:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 12:05:20,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:20,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 12:05:20,852 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 12:05:20,852 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 12:05:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:20,856 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 12:05:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:05:20,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:20,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:20,857 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 12:05:20,858 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 12:05:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:20,861 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 12:05:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:05:20,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:20,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:20,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:20,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:05:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:05:20,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-23 12:05:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:20,866 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:05:20,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:05:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:05:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:05:20,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:20,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:20,868 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:20,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2076156532, now seen corresponding path program 1 times [2018-11-23 12:05:20,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:20,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:20,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 12:05:20,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {346#true} is VALID [2018-11-23 12:05:20,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 12:05:20,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} #70#return; {346#true} is VALID [2018-11-23 12:05:20,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {346#true} call #t~ret7 := main(); {346#true} is VALID [2018-11-23 12:05:20,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {346#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {348#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {348#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {348#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {348#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {348#(= main_~i~0 0)} is VALID [2018-11-23 12:05:20,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {348#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {349#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:20,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {349#(<= main_~i~0 1)} assume !(~i~0 < 100000); {347#false} is VALID [2018-11-23 12:05:20,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} havoc ~x~0;~x~0 := 0; {347#false} is VALID [2018-11-23 12:05:20,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {347#false} is VALID [2018-11-23 12:05:20,980 INFO L256 TraceCheckUtils]: 12: Hoare triple {347#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {347#false} is VALID [2018-11-23 12:05:20,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 12:05:20,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 12:05:20,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 12:05:20,982 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 12:05:20,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:20,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:20,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:21,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:21,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 12:05:21,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {346#true} is VALID [2018-11-23 12:05:21,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 12:05:21,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} #70#return; {346#true} is VALID [2018-11-23 12:05:21,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {346#true} call #t~ret7 := main(); {346#true} is VALID [2018-11-23 12:05:21,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {346#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {368#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:21,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {368#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {368#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:21,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {368#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {368#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:21,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {349#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:21,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {349#(<= main_~i~0 1)} assume !(~i~0 < 100000); {347#false} is VALID [2018-11-23 12:05:21,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} havoc ~x~0;~x~0 := 0; {347#false} is VALID [2018-11-23 12:05:21,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {347#false} is VALID [2018-11-23 12:05:21,277 INFO L256 TraceCheckUtils]: 12: Hoare triple {347#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {347#false} is VALID [2018-11-23 12:05:21,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 12:05:21,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 12:05:21,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 12:05:21,279 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 12:05:21,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:21,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:05:21,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:05:21,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:21,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:05:21,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:21,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:05:21,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:05:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:21,430 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-23 12:05:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,788 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 12:05:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:05:21,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:05:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:05:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:05:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:05:21,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:05:21,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:21,928 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:05:21,928 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:05:21,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:05:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:05:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 12:05:21,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:21,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-23 12:05:21,952 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-23 12:05:21,952 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-23 12:05:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,955 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:05:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:05:21,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:21,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:21,957 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-23 12:05:21,957 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-23 12:05:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:21,960 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:05:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:05:21,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:21,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:21,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:21,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:05:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:05:21,964 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2018-11-23 12:05:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:21,965 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:05:21,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:05:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:05:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:05:21,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:21,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:21,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:21,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash 507563367, now seen corresponding path program 2 times [2018-11-23 12:05:21,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:21,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:21,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2018-11-23 12:05:22,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {565#true} is VALID [2018-11-23 12:05:22,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2018-11-23 12:05:22,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #70#return; {565#true} is VALID [2018-11-23 12:05:22,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret7 := main(); {565#true} is VALID [2018-11-23 12:05:22,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {565#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {567#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,166 INFO L273 TraceCheckUtils]: 6: Hoare triple {567#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {567#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {567#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {567#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {567#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {568#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {568#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {568#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {568#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {568#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {569#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {569#(<= main_~i~0 2)} assume !(~i~0 < 100000); {566#false} is VALID [2018-11-23 12:05:22,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#false} havoc ~x~0;~x~0 := 0; {566#false} is VALID [2018-11-23 12:05:22,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {566#false} is VALID [2018-11-23 12:05:22,199 INFO L256 TraceCheckUtils]: 15: Hoare triple {566#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {566#false} is VALID [2018-11-23 12:05:22,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {566#false} ~cond := #in~cond; {566#false} is VALID [2018-11-23 12:05:22,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {566#false} assume 0 == ~cond; {566#false} is VALID [2018-11-23 12:05:22,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {566#false} assume !false; {566#false} is VALID [2018-11-23 12:05:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:22,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:22,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:22,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:22,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:22,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:22,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2018-11-23 12:05:22,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {565#true} is VALID [2018-11-23 12:05:22,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2018-11-23 12:05:22,337 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #70#return; {565#true} is VALID [2018-11-23 12:05:22,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret7 := main(); {565#true} is VALID [2018-11-23 12:05:22,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {565#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {588#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {588#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {588#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,341 INFO L273 TraceCheckUtils]: 7: Hoare triple {588#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {588#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:22,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {588#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {568#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {568#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {568#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {568#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {568#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {569#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {569#(<= main_~i~0 2)} assume !(~i~0 < 100000); {566#false} is VALID [2018-11-23 12:05:22,345 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#false} havoc ~x~0;~x~0 := 0; {566#false} is VALID [2018-11-23 12:05:22,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {566#false} is VALID [2018-11-23 12:05:22,346 INFO L256 TraceCheckUtils]: 15: Hoare triple {566#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {566#false} is VALID [2018-11-23 12:05:22,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {566#false} ~cond := #in~cond; {566#false} is VALID [2018-11-23 12:05:22,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {566#false} assume 0 == ~cond; {566#false} is VALID [2018-11-23 12:05:22,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {566#false} assume !false; {566#false} is VALID [2018-11-23 12:05:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:22,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:22,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:05:22,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:05:22,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:22,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:05:22,405 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 12:05:22,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:05:22,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:05:22,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:22,407 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 6 states. [2018-11-23 12:05:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,604 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-11-23 12:05:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:05:22,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 12:05:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:05:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:05:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-23 12:05:22,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-23 12:05:22,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:22,755 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:05:22,755 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:05:22,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:05:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:05:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:05:22,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:22,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:05:22,775 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:05:22,775 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:05:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,778 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:05:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:05:22,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:22,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:22,779 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:05:22,779 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:05:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:22,782 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:05:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 12:05:22,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:22,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:22,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:22,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:05:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:05:22,786 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2018-11-23 12:05:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:22,787 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:05:22,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:05:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:05:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:05:22,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:22,788 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:22,788 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:22,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -207234668, now seen corresponding path program 3 times [2018-11-23 12:05:22,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:22,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-23 12:05:22,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {808#true} is VALID [2018-11-23 12:05:22,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:05:22,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #70#return; {808#true} is VALID [2018-11-23 12:05:22,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2018-11-23 12:05:22,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {810#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {810#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {810#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {810#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {810#(= main_~i~0 0)} is VALID [2018-11-23 12:05:22,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {810#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {811#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,919 INFO L273 TraceCheckUtils]: 9: Hoare triple {811#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {811#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {811#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {811#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:22,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {811#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {812#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {812#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {812#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {812#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {812#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:22,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {812#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {813#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:22,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {813#(<= main_~i~0 3)} assume !(~i~0 < 100000); {809#false} is VALID [2018-11-23 12:05:22,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {809#false} havoc ~x~0;~x~0 := 0; {809#false} is VALID [2018-11-23 12:05:22,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {809#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {809#false} is VALID [2018-11-23 12:05:22,928 INFO L256 TraceCheckUtils]: 18: Hoare triple {809#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {809#false} is VALID [2018-11-23 12:05:22,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {809#false} ~cond := #in~cond; {809#false} is VALID [2018-11-23 12:05:22,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {809#false} assume 0 == ~cond; {809#false} is VALID [2018-11-23 12:05:22,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-23 12:05:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:22,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:22,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:22,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:22,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:05:22,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:22,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:23,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2018-11-23 12:05:23,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {808#true} is VALID [2018-11-23 12:05:23,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2018-11-23 12:05:23,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #70#return; {808#true} is VALID [2018-11-23 12:05:23,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2018-11-23 12:05:23,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {808#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {832#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {832#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {832#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {832#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:23,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {811#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {811#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {811#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {811#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {811#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {811#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {812#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {812#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {812#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {812#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {812#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {812#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {813#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {813#(<= main_~i~0 3)} assume !(~i~0 < 100000); {809#false} is VALID [2018-11-23 12:05:23,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {809#false} havoc ~x~0;~x~0 := 0; {809#false} is VALID [2018-11-23 12:05:23,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {809#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {809#false} is VALID [2018-11-23 12:05:23,090 INFO L256 TraceCheckUtils]: 18: Hoare triple {809#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {809#false} is VALID [2018-11-23 12:05:23,090 INFO L273 TraceCheckUtils]: 19: Hoare triple {809#false} ~cond := #in~cond; {809#false} is VALID [2018-11-23 12:05:23,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {809#false} assume 0 == ~cond; {809#false} is VALID [2018-11-23 12:05:23,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {809#false} assume !false; {809#false} is VALID [2018-11-23 12:05:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:23,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:23,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:05:23,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:05:23,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:23,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:05:23,152 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 12:05:23,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:05:23,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:05:23,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:05:23,154 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 7 states. [2018-11-23 12:05:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,352 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-23 12:05:23,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:05:23,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 12:05:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:05:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-23 12:05:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:05:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-23 12:05:23,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2018-11-23 12:05:23,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:23,522 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:05:23,523 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:05:23,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:05:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:05:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-11-23 12:05:23,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:23,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2018-11-23 12:05:23,550 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2018-11-23 12:05:23,550 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2018-11-23 12:05:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,553 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 12:05:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:05:23,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,554 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2018-11-23 12:05:23,555 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2018-11-23 12:05:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:23,557 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 12:05:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 12:05:23,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:23,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:23,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:23,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:05:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-23 12:05:23,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 22 [2018-11-23 12:05:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:23,562 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-23 12:05:23,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:05:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 12:05:23,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:05:23,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:23,563 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:23,564 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:23,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -307641785, now seen corresponding path program 4 times [2018-11-23 12:05:23,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:23,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:23,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {1075#true} call ULTIMATE.init(); {1075#true} is VALID [2018-11-23 12:05:23,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {1075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1075#true} is VALID [2018-11-23 12:05:23,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {1075#true} assume true; {1075#true} is VALID [2018-11-23 12:05:23,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1075#true} {1075#true} #70#return; {1075#true} is VALID [2018-11-23 12:05:23,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {1075#true} call #t~ret7 := main(); {1075#true} is VALID [2018-11-23 12:05:23,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1075#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1077#(= main_~i~0 0)} is VALID [2018-11-23 12:05:23,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {1077#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1077#(= main_~i~0 0)} is VALID [2018-11-23 12:05:23,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {1077#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1077#(= main_~i~0 0)} is VALID [2018-11-23 12:05:23,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {1077#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {1078#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:23,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {1078#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {1079#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {1079#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:23,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:23,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:23,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1076#false} is VALID [2018-11-23 12:05:23,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {1076#false} havoc ~x~0;~x~0 := 0; {1076#false} is VALID [2018-11-23 12:05:23,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {1076#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1076#false} is VALID [2018-11-23 12:05:23,732 INFO L256 TraceCheckUtils]: 21: Hoare triple {1076#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1076#false} is VALID [2018-11-23 12:05:23,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {1076#false} ~cond := #in~cond; {1076#false} is VALID [2018-11-23 12:05:23,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {1076#false} assume 0 == ~cond; {1076#false} is VALID [2018-11-23 12:05:23,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {1076#false} assume !false; {1076#false} is VALID [2018-11-23 12:05:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:23,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:23,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:23,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:23,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:23,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:23,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:24,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {1075#true} call ULTIMATE.init(); {1075#true} is VALID [2018-11-23 12:05:24,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {1075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1075#true} is VALID [2018-11-23 12:05:24,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {1075#true} assume true; {1075#true} is VALID [2018-11-23 12:05:24,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1075#true} {1075#true} #70#return; {1075#true} is VALID [2018-11-23 12:05:24,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {1075#true} call #t~ret7 := main(); {1075#true} is VALID [2018-11-23 12:05:24,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {1075#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1100#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {1100#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1100#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1100#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:24,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {1078#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {1078#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {1079#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {1079#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {1079#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {1080#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {1081#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1076#false} is VALID [2018-11-23 12:05:24,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {1076#false} havoc ~x~0;~x~0 := 0; {1076#false} is VALID [2018-11-23 12:05:24,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {1076#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1076#false} is VALID [2018-11-23 12:05:24,169 INFO L256 TraceCheckUtils]: 21: Hoare triple {1076#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1076#false} is VALID [2018-11-23 12:05:24,170 INFO L273 TraceCheckUtils]: 22: Hoare triple {1076#false} ~cond := #in~cond; {1076#false} is VALID [2018-11-23 12:05:24,170 INFO L273 TraceCheckUtils]: 23: Hoare triple {1076#false} assume 0 == ~cond; {1076#false} is VALID [2018-11-23 12:05:24,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {1076#false} assume !false; {1076#false} is VALID [2018-11-23 12:05:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:24,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:24,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:05:24,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:05:24,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:24,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:05:24,304 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 12:05:24,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:05:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:05:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:05:24,306 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2018-11-23 12:05:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,575 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-23 12:05:24,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:05:24,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 12:05:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2018-11-23 12:05:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:05:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2018-11-23 12:05:24,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2018-11-23 12:05:24,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:24,693 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:05:24,693 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:05:24,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 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 12:05:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:05:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 12:05:24,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:24,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states. [2018-11-23 12:05:24,729 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states. [2018-11-23 12:05:24,729 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states. [2018-11-23 12:05:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,732 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 12:05:24,732 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-23 12:05:24,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:24,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:24,733 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states. [2018-11-23 12:05:24,733 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states. [2018-11-23 12:05:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:24,736 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 12:05:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-23 12:05:24,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:24,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:24,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:24,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:05:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:05:24,740 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 25 [2018-11-23 12:05:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:24,740 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:05:24,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:05:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:05:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:05:24,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:24,742 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:24,742 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:24,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2056140980, now seen corresponding path program 5 times [2018-11-23 12:05:24,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:24,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:24,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:24,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2018-11-23 12:05:24,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1366#true} is VALID [2018-11-23 12:05:24,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2018-11-23 12:05:24,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #70#return; {1366#true} is VALID [2018-11-23 12:05:24,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret7 := main(); {1366#true} is VALID [2018-11-23 12:05:24,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1368#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {1368#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1368#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {1368#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1368#(= main_~i~0 0)} is VALID [2018-11-23 12:05:24,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {1368#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1369#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {1369#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1369#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {1369#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1369#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:24,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {1369#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1370#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {1370#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1370#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {1370#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1370#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:24,965 INFO L273 TraceCheckUtils]: 14: Hoare triple {1370#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1371#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {1371#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1371#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,966 INFO L273 TraceCheckUtils]: 16: Hoare triple {1371#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1371#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:24,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {1371#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1372#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {1372#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1372#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {1372#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1372#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:24,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {1372#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1373#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:24,969 INFO L273 TraceCheckUtils]: 21: Hoare triple {1373#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 12:05:24,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {1367#false} havoc ~x~0;~x~0 := 0; {1367#false} is VALID [2018-11-23 12:05:24,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {1367#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1367#false} is VALID [2018-11-23 12:05:24,970 INFO L256 TraceCheckUtils]: 24: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1367#false} is VALID [2018-11-23 12:05:24,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2018-11-23 12:05:24,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2018-11-23 12:05:24,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2018-11-23 12:05:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:24,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:24,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:25,028 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:05:25,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:25,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:25,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2018-11-23 12:05:25,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {1366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1366#true} is VALID [2018-11-23 12:05:25,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2018-11-23 12:05:25,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #70#return; {1366#true} is VALID [2018-11-23 12:05:25,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret7 := main(); {1366#true} is VALID [2018-11-23 12:05:25,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1392#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {1392#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1392#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {1392#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1392#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:25,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {1392#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1369#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {1369#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1369#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {1369#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1369#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:25,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {1369#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1370#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {1370#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1370#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {1370#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1370#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:25,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {1370#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1371#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {1371#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1371#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {1371#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1371#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:25,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {1371#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1372#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {1372#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1372#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {1372#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1372#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:25,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {1372#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1373#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:25,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {1373#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1367#false} is VALID [2018-11-23 12:05:25,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {1367#false} havoc ~x~0;~x~0 := 0; {1367#false} is VALID [2018-11-23 12:05:25,185 INFO L273 TraceCheckUtils]: 23: Hoare triple {1367#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1367#false} is VALID [2018-11-23 12:05:25,185 INFO L256 TraceCheckUtils]: 24: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1367#false} is VALID [2018-11-23 12:05:25,186 INFO L273 TraceCheckUtils]: 25: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2018-11-23 12:05:25,186 INFO L273 TraceCheckUtils]: 26: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2018-11-23 12:05:25,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2018-11-23 12:05:25,188 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:25,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:25,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:05:25,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:05:25,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:25,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:05:25,248 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 12:05:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:05:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:05:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:25,249 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 9 states. [2018-11-23 12:05:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,690 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-11-23 12:05:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:05:25,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:05:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2018-11-23 12:05:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:05:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2018-11-23 12:05:25,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2018-11-23 12:05:25,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:25,804 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:05:25,805 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:05:25,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:05:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:05:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-23 12:05:25,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:25,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-23 12:05:25,832 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-23 12:05:25,832 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-23 12:05:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,835 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:05:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:05:25,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,836 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-23 12:05:25,836 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-23 12:05:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:25,838 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 12:05:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 12:05:25,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:25,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:25,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:25,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:05:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 12:05:25,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 28 [2018-11-23 12:05:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:25,842 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 12:05:25,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:05:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 12:05:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:05:25,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:25,843 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:25,844 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:25,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:25,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1224707879, now seen corresponding path program 6 times [2018-11-23 12:05:25,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:25,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:25,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:26,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {1681#true} call ULTIMATE.init(); {1681#true} is VALID [2018-11-23 12:05:26,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {1681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1681#true} is VALID [2018-11-23 12:05:26,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {1681#true} assume true; {1681#true} is VALID [2018-11-23 12:05:26,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1681#true} {1681#true} #70#return; {1681#true} is VALID [2018-11-23 12:05:26,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {1681#true} call #t~ret7 := main(); {1681#true} is VALID [2018-11-23 12:05:26,110 INFO L273 TraceCheckUtils]: 5: Hoare triple {1681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1683#(= main_~i~0 0)} is VALID [2018-11-23 12:05:26,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {1683#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1683#(= main_~i~0 0)} is VALID [2018-11-23 12:05:26,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {1683#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1683#(= main_~i~0 0)} is VALID [2018-11-23 12:05:26,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {1683#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1684#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {1684#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1684#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {1684#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1684#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {1684#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1685#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {1685#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1685#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {1685#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1685#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {1685#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1686#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {1686#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1686#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {1686#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1686#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {1686#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1687#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,170 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1687#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {1687#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1688#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {1688#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1688#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {1688#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:26,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {1689#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1682#false} is VALID [2018-11-23 12:05:26,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {1682#false} havoc ~x~0;~x~0 := 0; {1682#false} is VALID [2018-11-23 12:05:26,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {1682#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1682#false} is VALID [2018-11-23 12:05:26,175 INFO L256 TraceCheckUtils]: 27: Hoare triple {1682#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1682#false} is VALID [2018-11-23 12:05:26,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {1682#false} ~cond := #in~cond; {1682#false} is VALID [2018-11-23 12:05:26,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {1682#false} assume 0 == ~cond; {1682#false} is VALID [2018-11-23 12:05:26,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2018-11-23 12:05:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:26,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:26,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:26,198 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:26,234 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:05:26,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:26,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:26,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {1681#true} call ULTIMATE.init(); {1681#true} is VALID [2018-11-23 12:05:26,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {1681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1681#true} is VALID [2018-11-23 12:05:26,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {1681#true} assume true; {1681#true} is VALID [2018-11-23 12:05:26,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1681#true} {1681#true} #70#return; {1681#true} is VALID [2018-11-23 12:05:26,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {1681#true} call #t~ret7 := main(); {1681#true} is VALID [2018-11-23 12:05:26,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {1681#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {1708#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:26,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {1708#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1708#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:26,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {1708#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1708#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {1708#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1684#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {1684#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1684#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {1684#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1684#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:26,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {1684#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1685#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {1685#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1685#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {1685#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1685#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:26,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {1685#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1686#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {1686#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1686#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,423 INFO L273 TraceCheckUtils]: 16: Hoare triple {1686#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1686#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:26,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {1686#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1687#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1687#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1687#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:26,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {1687#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1688#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {1688#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1688#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {1688#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1688#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:26,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {1688#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1689#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:26,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {1689#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1682#false} is VALID [2018-11-23 12:05:26,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {1682#false} havoc ~x~0;~x~0 := 0; {1682#false} is VALID [2018-11-23 12:05:26,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {1682#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {1682#false} is VALID [2018-11-23 12:05:26,432 INFO L256 TraceCheckUtils]: 27: Hoare triple {1682#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {1682#false} is VALID [2018-11-23 12:05:26,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {1682#false} ~cond := #in~cond; {1682#false} is VALID [2018-11-23 12:05:26,432 INFO L273 TraceCheckUtils]: 29: Hoare triple {1682#false} assume 0 == ~cond; {1682#false} is VALID [2018-11-23 12:05:26,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2018-11-23 12:05:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:05:26,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 12:05:26,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:26,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:05:26,508 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 12:05:26,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:05:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:05:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:05:26,510 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 10 states. [2018-11-23 12:05:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:27,130 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2018-11-23 12:05:27,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:05:27,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 12:05:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-23 12:05:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:05:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2018-11-23 12:05:27,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2018-11-23 12:05:27,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:27,262 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:05:27,262 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:05:27,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:05:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:05:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 12:05:27,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:27,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-23 12:05:27,302 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-23 12:05:27,303 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-23 12:05:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:27,305 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 12:05:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2018-11-23 12:05:27,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:27,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:27,306 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-23 12:05:27,306 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-23 12:05:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:27,308 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-23 12:05:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2018-11-23 12:05:27,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:27,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:27,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:27,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:05:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-23 12:05:27,311 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 31 [2018-11-23 12:05:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:27,311 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-23 12:05:27,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:05:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 12:05:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:05:27,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:27,312 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:27,312 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:27,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1077592020, now seen corresponding path program 7 times [2018-11-23 12:05:27,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:27,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:27,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:27,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:27,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2018-11-23 12:05:27,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2020#true} is VALID [2018-11-23 12:05:27,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:05:27,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #70#return; {2020#true} is VALID [2018-11-23 12:05:27,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret7 := main(); {2020#true} is VALID [2018-11-23 12:05:27,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {2020#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2022#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {2022#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2022#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {2022#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2022#(= main_~i~0 0)} is VALID [2018-11-23 12:05:27,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {2022#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2023#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2023#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2023#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:27,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {2023#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2024#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {2024#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2024#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {2024#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2024#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:27,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {2024#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2025#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {2025#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2025#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {2025#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2025#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:27,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {2025#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2026#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {2026#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2026#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {2026#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2026#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:27,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {2026#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2027#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {2027#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2027#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {2027#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2027#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:27,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {2027#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2028#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {2028#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2028#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,568 INFO L273 TraceCheckUtils]: 25: Hoare triple {2028#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2028#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:27,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {2028#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2029#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:27,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {2029#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2021#false} is VALID [2018-11-23 12:05:27,570 INFO L273 TraceCheckUtils]: 28: Hoare triple {2021#false} havoc ~x~0;~x~0 := 0; {2021#false} is VALID [2018-11-23 12:05:27,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {2021#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2021#false} is VALID [2018-11-23 12:05:27,571 INFO L256 TraceCheckUtils]: 30: Hoare triple {2021#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2021#false} is VALID [2018-11-23 12:05:27,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {2021#false} ~cond := #in~cond; {2021#false} is VALID [2018-11-23 12:05:27,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {2021#false} assume 0 == ~cond; {2021#false} is VALID [2018-11-23 12:05:27,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2018-11-23 12:05:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:27,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:27,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:27,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:27,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:28,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2018-11-23 12:05:28,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2020#true} is VALID [2018-11-23 12:05:28,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:05:28,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #70#return; {2020#true} is VALID [2018-11-23 12:05:28,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret7 := main(); {2020#true} is VALID [2018-11-23 12:05:28,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {2020#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2048#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:28,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {2048#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2048#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:28,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {2048#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2048#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:28,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {2048#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2023#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:28,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2023#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:28,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {2023#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2023#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:28,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {2023#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2024#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:28,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {2024#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2024#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:28,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {2024#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2024#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:28,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {2024#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2025#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:28,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {2025#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2025#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:28,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {2025#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2025#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:28,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {2025#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2026#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:28,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {2026#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2026#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:28,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {2026#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2026#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:28,090 INFO L273 TraceCheckUtils]: 20: Hoare triple {2026#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2027#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:28,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {2027#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2027#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:28,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {2027#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2027#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:28,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {2027#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2028#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:28,110 INFO L273 TraceCheckUtils]: 24: Hoare triple {2028#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2028#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:28,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {2028#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2028#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:28,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {2028#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2029#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:28,151 INFO L273 TraceCheckUtils]: 27: Hoare triple {2029#(<= main_~i~0 7)} assume !(~i~0 < 100000); {2021#false} is VALID [2018-11-23 12:05:28,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {2021#false} havoc ~x~0;~x~0 := 0; {2021#false} is VALID [2018-11-23 12:05:28,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {2021#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2021#false} is VALID [2018-11-23 12:05:28,152 INFO L256 TraceCheckUtils]: 30: Hoare triple {2021#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2021#false} is VALID [2018-11-23 12:05:28,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {2021#false} ~cond := #in~cond; {2021#false} is VALID [2018-11-23 12:05:28,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {2021#false} assume 0 == ~cond; {2021#false} is VALID [2018-11-23 12:05:28,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2018-11-23 12:05:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:28,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:05:28,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:05:28,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:28,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:05:28,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:28,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:05:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:05:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:05:28,247 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 11 states. [2018-11-23 12:05:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,693 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2018-11-23 12:05:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:05:28,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-23 12:05:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:05:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 12:05:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:05:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 12:05:28,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-23 12:05:28,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:28,826 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:05:28,827 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:05:28,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 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 12:05:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:05:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:05:28,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:28,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:05:28,850 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:05:28,850 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:05:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,853 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2018-11-23 12:05:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 12:05:28,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,854 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:05:28,854 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:05:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:28,857 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2018-11-23 12:05:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 12:05:28,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:28,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:28,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:28,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:05:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-11-23 12:05:28,860 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 34 [2018-11-23 12:05:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:28,860 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-11-23 12:05:28,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:05:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-11-23 12:05:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:05:28,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:28,861 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:28,861 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:28,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:28,862 INFO L82 PathProgramCache]: Analyzing trace with hash -784321529, now seen corresponding path program 8 times [2018-11-23 12:05:28,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:28,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {2383#true} call ULTIMATE.init(); {2383#true} is VALID [2018-11-23 12:05:29,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {2383#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2383#true} is VALID [2018-11-23 12:05:29,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {2383#true} assume true; {2383#true} is VALID [2018-11-23 12:05:29,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2383#true} {2383#true} #70#return; {2383#true} is VALID [2018-11-23 12:05:29,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {2383#true} call #t~ret7 := main(); {2383#true} is VALID [2018-11-23 12:05:29,160 INFO L273 TraceCheckUtils]: 5: Hoare triple {2383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2385#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {2385#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2385#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {2385#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2385#(= main_~i~0 0)} is VALID [2018-11-23 12:05:29,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {2385#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2386#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {2386#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2386#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {2386#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2386#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {2386#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2387#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {2387#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2387#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {2387#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2387#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {2387#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2388#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {2388#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2388#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {2388#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2388#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {2388#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2389#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {2389#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2389#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {2389#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2389#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {2389#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {2390#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2390#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {2390#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2390#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {2390#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2391#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {2391#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2391#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {2391#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2391#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {2391#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2392#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {2392#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2392#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {2392#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2392#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {2392#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2393#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {2393#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2384#false} is VALID [2018-11-23 12:05:29,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {2384#false} havoc ~x~0;~x~0 := 0; {2384#false} is VALID [2018-11-23 12:05:29,178 INFO L273 TraceCheckUtils]: 32: Hoare triple {2384#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2384#false} is VALID [2018-11-23 12:05:29,179 INFO L256 TraceCheckUtils]: 33: Hoare triple {2384#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2384#false} is VALID [2018-11-23 12:05:29,179 INFO L273 TraceCheckUtils]: 34: Hoare triple {2384#false} ~cond := #in~cond; {2384#false} is VALID [2018-11-23 12:05:29,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {2384#false} assume 0 == ~cond; {2384#false} is VALID [2018-11-23 12:05:29,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {2384#false} assume !false; {2384#false} is VALID [2018-11-23 12:05:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:29,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:29,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:29,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:29,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:29,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:29,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {2383#true} call ULTIMATE.init(); {2383#true} is VALID [2018-11-23 12:05:29,394 INFO L273 TraceCheckUtils]: 1: Hoare triple {2383#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2383#true} is VALID [2018-11-23 12:05:29,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {2383#true} assume true; {2383#true} is VALID [2018-11-23 12:05:29,395 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2383#true} {2383#true} #70#return; {2383#true} is VALID [2018-11-23 12:05:29,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {2383#true} call #t~ret7 := main(); {2383#true} is VALID [2018-11-23 12:05:29,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {2383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2412#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {2412#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2412#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {2412#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2412#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:29,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {2412#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2386#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {2386#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2386#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {2386#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2386#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:29,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {2386#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2387#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {2387#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2387#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {2387#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2387#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:29,402 INFO L273 TraceCheckUtils]: 14: Hoare triple {2387#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2388#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {2388#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2388#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {2388#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2388#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:29,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {2388#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2389#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {2389#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2389#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {2389#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2389#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:29,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {2389#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2390#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {2390#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2390#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {2390#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2390#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:29,408 INFO L273 TraceCheckUtils]: 23: Hoare triple {2390#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2391#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {2391#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2391#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {2391#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2391#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:29,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {2391#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2392#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {2392#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2392#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {2392#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2392#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:29,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {2392#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2393#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:29,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {2393#(<= main_~i~0 8)} assume !(~i~0 < 100000); {2384#false} is VALID [2018-11-23 12:05:29,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {2384#false} havoc ~x~0;~x~0 := 0; {2384#false} is VALID [2018-11-23 12:05:29,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {2384#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2384#false} is VALID [2018-11-23 12:05:29,414 INFO L256 TraceCheckUtils]: 33: Hoare triple {2384#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2384#false} is VALID [2018-11-23 12:05:29,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {2384#false} ~cond := #in~cond; {2384#false} is VALID [2018-11-23 12:05:29,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {2384#false} assume 0 == ~cond; {2384#false} is VALID [2018-11-23 12:05:29,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {2384#false} assume !false; {2384#false} is VALID [2018-11-23 12:05:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:29,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:29,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:05:29,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 12:05:29,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:29,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:05:29,484 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 12:05:29,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:05:29,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:05:29,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:05:29,486 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 12 states. [2018-11-23 12:05:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,843 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2018-11-23 12:05:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:05:29,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 12:05:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:05:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:05:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:05:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:05:29,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-23 12:05:29,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:29,946 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:05:29,946 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:05:29,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:05:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:05:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 12:05:29,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:29,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-23 12:05:29,977 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-23 12:05:29,977 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-23 12:05:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,980 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-11-23 12:05:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2018-11-23 12:05:29,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:29,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:29,981 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-23 12:05:29,981 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-23 12:05:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:29,983 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-11-23 12:05:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2018-11-23 12:05:29,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:29,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:29,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:29,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:05:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2018-11-23 12:05:29,985 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 37 [2018-11-23 12:05:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:29,986 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2018-11-23 12:05:29,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:05:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2018-11-23 12:05:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:05:29,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:29,987 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:29,987 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:29,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash 451768052, now seen corresponding path program 9 times [2018-11-23 12:05:29,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:29,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:29,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:30,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {2770#true} call ULTIMATE.init(); {2770#true} is VALID [2018-11-23 12:05:30,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {2770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2770#true} is VALID [2018-11-23 12:05:30,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2018-11-23 12:05:30,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #70#return; {2770#true} is VALID [2018-11-23 12:05:30,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret7 := main(); {2770#true} is VALID [2018-11-23 12:05:30,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {2770#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2772#(= main_~i~0 0)} is VALID [2018-11-23 12:05:30,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {2772#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2772#(= main_~i~0 0)} is VALID [2018-11-23 12:05:30,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {2772#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2772#(= main_~i~0 0)} is VALID [2018-11-23 12:05:30,263 INFO L273 TraceCheckUtils]: 8: Hoare triple {2772#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2773#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {2773#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2773#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {2773#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2773#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {2773#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2774#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {2774#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2774#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {2774#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2774#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {2774#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2775#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {2775#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2775#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {2775#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2775#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {2775#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2776#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2776#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {2776#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2776#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {2776#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2777#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {2777#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2777#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {2777#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2777#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {2777#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2778#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {2778#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2778#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,275 INFO L273 TraceCheckUtils]: 25: Hoare triple {2778#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2778#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {2778#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {2779#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2779#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {2779#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2779#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {2779#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2780#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,279 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2780#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,279 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2780#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,280 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,281 INFO L273 TraceCheckUtils]: 33: Hoare triple {2781#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2771#false} is VALID [2018-11-23 12:05:30,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {2771#false} havoc ~x~0;~x~0 := 0; {2771#false} is VALID [2018-11-23 12:05:30,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {2771#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2771#false} is VALID [2018-11-23 12:05:30,282 INFO L256 TraceCheckUtils]: 36: Hoare triple {2771#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2771#false} is VALID [2018-11-23 12:05:30,282 INFO L273 TraceCheckUtils]: 37: Hoare triple {2771#false} ~cond := #in~cond; {2771#false} is VALID [2018-11-23 12:05:30,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {2771#false} assume 0 == ~cond; {2771#false} is VALID [2018-11-23 12:05:30,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2018-11-23 12:05:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:30,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:30,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:30,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:30,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:05:30,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:30,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:30,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {2770#true} call ULTIMATE.init(); {2770#true} is VALID [2018-11-23 12:05:30,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {2770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2770#true} is VALID [2018-11-23 12:05:30,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2018-11-23 12:05:30,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #70#return; {2770#true} is VALID [2018-11-23 12:05:30,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret7 := main(); {2770#true} is VALID [2018-11-23 12:05:30,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {2770#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {2800#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:30,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {2800#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2800#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:30,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {2800#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2800#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:30,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {2800#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2773#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {2773#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2773#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {2773#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2773#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {2773#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2774#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {2774#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2774#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {2774#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2774#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {2774#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2775#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {2775#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2775#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {2775#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2775#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {2775#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2776#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {2776#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2776#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {2776#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2776#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {2776#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2777#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {2777#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2777#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,721 INFO L273 TraceCheckUtils]: 22: Hoare triple {2777#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2777#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {2777#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2778#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {2778#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2778#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {2778#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2778#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,724 INFO L273 TraceCheckUtils]: 26: Hoare triple {2778#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,724 INFO L273 TraceCheckUtils]: 27: Hoare triple {2779#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2779#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,725 INFO L273 TraceCheckUtils]: 28: Hoare triple {2779#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2779#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,725 INFO L273 TraceCheckUtils]: 29: Hoare triple {2779#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2780#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,725 INFO L273 TraceCheckUtils]: 30: Hoare triple {2780#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2780#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,726 INFO L273 TraceCheckUtils]: 31: Hoare triple {2780#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2780#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {2780#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,727 INFO L273 TraceCheckUtils]: 33: Hoare triple {2781#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2771#false} is VALID [2018-11-23 12:05:30,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {2771#false} havoc ~x~0;~x~0 := 0; {2771#false} is VALID [2018-11-23 12:05:30,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {2771#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {2771#false} is VALID [2018-11-23 12:05:30,728 INFO L256 TraceCheckUtils]: 36: Hoare triple {2771#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {2771#false} is VALID [2018-11-23 12:05:30,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {2771#false} ~cond := #in~cond; {2771#false} is VALID [2018-11-23 12:05:30,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {2771#false} assume 0 == ~cond; {2771#false} is VALID [2018-11-23 12:05:30,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2018-11-23 12:05:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:30,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:30,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:05:30,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 12:05:30,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:30,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:05:30,817 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 12:05:30,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:05:30,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:05:30,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:05:30,818 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 13 states. [2018-11-23 12:05:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,194 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2018-11-23 12:05:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:05:31,195 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 12:05:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 12:05:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:05:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 12:05:31,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-23 12:05:31,325 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 12:05:31,326 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:05:31,327 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:05:31,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 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 12:05:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:05:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 12:05:31,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:31,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-23 12:05:31,356 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-23 12:05:31,356 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-23 12:05:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,358 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-11-23 12:05:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2018-11-23 12:05:31,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,359 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-23 12:05:31,359 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-23 12:05:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,361 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-11-23 12:05:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2018-11-23 12:05:31,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:31,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:05:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2018-11-23 12:05:31,363 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 40 [2018-11-23 12:05:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:31,363 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2018-11-23 12:05:31,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:05:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2018-11-23 12:05:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:05:31,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:31,364 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:31,364 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:31,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash -253120281, now seen corresponding path program 10 times [2018-11-23 12:05:31,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:31,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:31,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {3181#true} call ULTIMATE.init(); {3181#true} is VALID [2018-11-23 12:05:31,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {3181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3181#true} is VALID [2018-11-23 12:05:31,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {3181#true} assume true; {3181#true} is VALID [2018-11-23 12:05:31,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3181#true} {3181#true} #70#return; {3181#true} is VALID [2018-11-23 12:05:31,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {3181#true} call #t~ret7 := main(); {3181#true} is VALID [2018-11-23 12:05:31,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {3181#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3183#(= main_~i~0 0)} is VALID [2018-11-23 12:05:31,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {3183#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3183#(= main_~i~0 0)} is VALID [2018-11-23 12:05:31,672 INFO L273 TraceCheckUtils]: 7: Hoare triple {3183#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3183#(= main_~i~0 0)} is VALID [2018-11-23 12:05:31,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {3183#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3184#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {3184#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3184#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {3184#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3184#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:31,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {3184#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3185#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {3185#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3185#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {3185#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3185#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:31,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {3185#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3186#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {3186#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3186#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {3186#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3186#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:31,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {3186#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3187#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {3187#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3187#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,682 INFO L273 TraceCheckUtils]: 19: Hoare triple {3187#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3187#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:31,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {3187#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3188#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {3188#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3188#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {3188#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3188#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:31,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {3188#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {3189#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3189#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {3189#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3189#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:31,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {3189#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3190#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3190#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:31,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3191#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {3191#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3191#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {3191#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3191#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:31,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {3191#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {3192#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3192#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {3192#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3192#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:31,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {3192#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3193#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:31,695 INFO L273 TraceCheckUtils]: 36: Hoare triple {3193#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3182#false} is VALID [2018-11-23 12:05:31,696 INFO L273 TraceCheckUtils]: 37: Hoare triple {3182#false} havoc ~x~0;~x~0 := 0; {3182#false} is VALID [2018-11-23 12:05:31,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {3182#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3182#false} is VALID [2018-11-23 12:05:31,696 INFO L256 TraceCheckUtils]: 39: Hoare triple {3182#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3182#false} is VALID [2018-11-23 12:05:31,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {3182#false} ~cond := #in~cond; {3182#false} is VALID [2018-11-23 12:05:31,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {3182#false} assume 0 == ~cond; {3182#false} is VALID [2018-11-23 12:05:31,697 INFO L273 TraceCheckUtils]: 42: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2018-11-23 12:05:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:31,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:31,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:31,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:31,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:31,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:31,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:32,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {3181#true} call ULTIMATE.init(); {3181#true} is VALID [2018-11-23 12:05:32,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {3181#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3181#true} is VALID [2018-11-23 12:05:32,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {3181#true} assume true; {3181#true} is VALID [2018-11-23 12:05:32,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3181#true} {3181#true} #70#return; {3181#true} is VALID [2018-11-23 12:05:32,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {3181#true} call #t~ret7 := main(); {3181#true} is VALID [2018-11-23 12:05:32,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {3181#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3212#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:32,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {3212#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3212#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:32,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {3212#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3212#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:32,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {3212#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3184#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {3184#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3184#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {3184#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3184#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:32,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {3184#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3185#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {3185#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3185#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {3185#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3185#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:32,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {3185#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3186#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {3186#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3186#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {3186#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3186#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:32,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {3186#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3187#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {3187#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3187#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {3187#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3187#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:32,067 INFO L273 TraceCheckUtils]: 20: Hoare triple {3187#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3188#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {3188#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3188#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,068 INFO L273 TraceCheckUtils]: 22: Hoare triple {3188#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3188#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:32,070 INFO L273 TraceCheckUtils]: 23: Hoare triple {3188#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3189#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {3189#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3189#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {3189#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3189#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:32,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {3189#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3190#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {3190#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3190#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {3190#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3190#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:32,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {3190#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3191#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {3191#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3191#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {3191#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3191#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:32,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {3191#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3192#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {3192#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3192#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {3192#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3192#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:32,082 INFO L273 TraceCheckUtils]: 35: Hoare triple {3192#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3193#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:32,082 INFO L273 TraceCheckUtils]: 36: Hoare triple {3193#(<= main_~i~0 10)} assume !(~i~0 < 100000); {3182#false} is VALID [2018-11-23 12:05:32,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {3182#false} havoc ~x~0;~x~0 := 0; {3182#false} is VALID [2018-11-23 12:05:32,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {3182#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3182#false} is VALID [2018-11-23 12:05:32,083 INFO L256 TraceCheckUtils]: 39: Hoare triple {3182#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3182#false} is VALID [2018-11-23 12:05:32,083 INFO L273 TraceCheckUtils]: 40: Hoare triple {3182#false} ~cond := #in~cond; {3182#false} is VALID [2018-11-23 12:05:32,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {3182#false} assume 0 == ~cond; {3182#false} is VALID [2018-11-23 12:05:32,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2018-11-23 12:05:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:32,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:32,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:05:32,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 12:05:32,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:32,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:05:32,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:32,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:05:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:05:32,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:32,190 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand 14 states. [2018-11-23 12:05:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,596 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-23 12:05:32,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:05:32,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-23 12:05:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-23 12:05:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:05:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 92 transitions. [2018-11-23 12:05:32,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 92 transitions. [2018-11-23 12:05:32,740 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 12:05:32,742 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:05:32,742 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:05:32,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:05:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:05:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-23 12:05:32,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:32,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-23 12:05:32,772 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-23 12:05:32,772 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-23 12:05:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,774 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-23 12:05:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2018-11-23 12:05:32,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:32,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:32,774 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-23 12:05:32,774 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-23 12:05:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:32,775 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-23 12:05:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2018-11-23 12:05:32,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:32,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:32,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:32,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:05:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-23 12:05:32,778 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 43 [2018-11-23 12:05:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:32,778 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-23 12:05:32,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:05:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-23 12:05:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:05:32,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:32,778 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:32,779 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:32,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:32,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1486338540, now seen corresponding path program 11 times [2018-11-23 12:05:32,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:32,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:32,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:32,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:32,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {3616#true} call ULTIMATE.init(); {3616#true} is VALID [2018-11-23 12:05:33,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {3616#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3616#true} is VALID [2018-11-23 12:05:33,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {3616#true} assume true; {3616#true} is VALID [2018-11-23 12:05:33,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3616#true} {3616#true} #70#return; {3616#true} is VALID [2018-11-23 12:05:33,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {3616#true} call #t~ret7 := main(); {3616#true} is VALID [2018-11-23 12:05:33,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {3616#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3618#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {3618#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3618#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {3618#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3618#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {3618#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3619#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {3619#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3619#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {3619#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3619#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {3619#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3620#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {3620#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3620#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {3620#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3620#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {3620#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3621#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {3621#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3621#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {3621#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3621#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {3621#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3622#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {3622#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3622#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {3622#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3622#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {3622#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3623#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {3623#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3623#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,178 INFO L273 TraceCheckUtils]: 22: Hoare triple {3623#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3623#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {3623#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3624#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {3624#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3624#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,181 INFO L273 TraceCheckUtils]: 25: Hoare triple {3624#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3624#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {3624#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3625#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {3625#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3625#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {3625#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3625#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {3625#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3626#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,186 INFO L273 TraceCheckUtils]: 30: Hoare triple {3626#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3626#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,187 INFO L273 TraceCheckUtils]: 31: Hoare triple {3626#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3626#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,187 INFO L273 TraceCheckUtils]: 32: Hoare triple {3626#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3627#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,188 INFO L273 TraceCheckUtils]: 33: Hoare triple {3627#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {3627#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3627#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {3627#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3628#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,191 INFO L273 TraceCheckUtils]: 36: Hoare triple {3628#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3628#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,192 INFO L273 TraceCheckUtils]: 37: Hoare triple {3628#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3628#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,193 INFO L273 TraceCheckUtils]: 38: Hoare triple {3628#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3629#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,194 INFO L273 TraceCheckUtils]: 39: Hoare triple {3629#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3617#false} is VALID [2018-11-23 12:05:33,194 INFO L273 TraceCheckUtils]: 40: Hoare triple {3617#false} havoc ~x~0;~x~0 := 0; {3617#false} is VALID [2018-11-23 12:05:33,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {3617#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3617#false} is VALID [2018-11-23 12:05:33,195 INFO L256 TraceCheckUtils]: 42: Hoare triple {3617#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3617#false} is VALID [2018-11-23 12:05:33,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {3617#false} ~cond := #in~cond; {3617#false} is VALID [2018-11-23 12:05:33,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {3617#false} assume 0 == ~cond; {3617#false} is VALID [2018-11-23 12:05:33,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {3617#false} assume !false; {3617#false} is VALID [2018-11-23 12:05:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:33,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:33,214 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:33,296 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:05:33,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:33,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {3616#true} call ULTIMATE.init(); {3616#true} is VALID [2018-11-23 12:05:33,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {3616#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3616#true} is VALID [2018-11-23 12:05:33,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {3616#true} assume true; {3616#true} is VALID [2018-11-23 12:05:33,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3616#true} {3616#true} #70#return; {3616#true} is VALID [2018-11-23 12:05:33,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {3616#true} call #t~ret7 := main(); {3616#true} is VALID [2018-11-23 12:05:33,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {3616#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {3648#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {3648#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3648#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {3648#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3648#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {3648#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3619#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {3619#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3619#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {3619#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3619#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {3619#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3620#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {3620#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3620#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {3620#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3620#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {3620#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3621#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {3621#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3621#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,567 INFO L273 TraceCheckUtils]: 16: Hoare triple {3621#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3621#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {3621#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3622#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,569 INFO L273 TraceCheckUtils]: 18: Hoare triple {3622#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3622#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {3622#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3622#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {3622#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3623#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,571 INFO L273 TraceCheckUtils]: 21: Hoare triple {3623#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3623#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {3623#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3623#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {3623#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3624#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,574 INFO L273 TraceCheckUtils]: 24: Hoare triple {3624#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3624#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {3624#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3624#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,575 INFO L273 TraceCheckUtils]: 26: Hoare triple {3624#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3625#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {3625#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3625#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,577 INFO L273 TraceCheckUtils]: 28: Hoare triple {3625#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3625#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,578 INFO L273 TraceCheckUtils]: 29: Hoare triple {3625#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3626#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,578 INFO L273 TraceCheckUtils]: 30: Hoare triple {3626#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3626#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,579 INFO L273 TraceCheckUtils]: 31: Hoare triple {3626#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3626#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {3626#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3627#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,581 INFO L273 TraceCheckUtils]: 33: Hoare triple {3627#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,581 INFO L273 TraceCheckUtils]: 34: Hoare triple {3627#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3627#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,582 INFO L273 TraceCheckUtils]: 35: Hoare triple {3627#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3628#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,583 INFO L273 TraceCheckUtils]: 36: Hoare triple {3628#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3628#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,584 INFO L273 TraceCheckUtils]: 37: Hoare triple {3628#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3628#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,585 INFO L273 TraceCheckUtils]: 38: Hoare triple {3628#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3629#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,586 INFO L273 TraceCheckUtils]: 39: Hoare triple {3629#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3617#false} is VALID [2018-11-23 12:05:33,586 INFO L273 TraceCheckUtils]: 40: Hoare triple {3617#false} havoc ~x~0;~x~0 := 0; {3617#false} is VALID [2018-11-23 12:05:33,586 INFO L273 TraceCheckUtils]: 41: Hoare triple {3617#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {3617#false} is VALID [2018-11-23 12:05:33,586 INFO L256 TraceCheckUtils]: 42: Hoare triple {3617#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {3617#false} is VALID [2018-11-23 12:05:33,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {3617#false} ~cond := #in~cond; {3617#false} is VALID [2018-11-23 12:05:33,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {3617#false} assume 0 == ~cond; {3617#false} is VALID [2018-11-23 12:05:33,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {3617#false} assume !false; {3617#false} is VALID [2018-11-23 12:05:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:33,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:05:33,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 12:05:33,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:33,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:05:33,679 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 12:05:33,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:05:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:05:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:33,680 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 15 states. [2018-11-23 12:05:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,130 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-11-23 12:05:34,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:05:34,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-23 12:05:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2018-11-23 12:05:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:05:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 96 transitions. [2018-11-23 12:05:34,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 96 transitions. [2018-11-23 12:05:34,327 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 12:05:34,329 INFO L225 Difference]: With dead ends: 77 [2018-11-23 12:05:34,329 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:05:34,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:05:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:05:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:05:34,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:34,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:05:34,370 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:05:34,370 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:05:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,372 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 12:05:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-11-23 12:05:34,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,373 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:05:34,373 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:05:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,374 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 12:05:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-11-23 12:05:34,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:34,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:05:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-11-23 12:05:34,377 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 46 [2018-11-23 12:05:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:34,377 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-11-23 12:05:34,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:05:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-23 12:05:34,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:05:34,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:34,378 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:34,378 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:34,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1141242425, now seen corresponding path program 12 times [2018-11-23 12:05:34,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:34,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:34,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:34,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:34,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4075#true} is VALID [2018-11-23 12:05:34,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {4075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4075#true} is VALID [2018-11-23 12:05:34,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2018-11-23 12:05:34,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #70#return; {4075#true} is VALID [2018-11-23 12:05:34,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret7 := main(); {4075#true} is VALID [2018-11-23 12:05:34,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {4075#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4077#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {4077#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4077#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {4077#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4077#(= main_~i~0 0)} is VALID [2018-11-23 12:05:34,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {4077#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:34,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {4078#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:34,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {4078#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {4078#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,001 INFO L273 TraceCheckUtils]: 12: Hoare triple {4079#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {4079#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {4079#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {4080#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {4080#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {4080#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {4081#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,005 INFO L273 TraceCheckUtils]: 19: Hoare triple {4081#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {4081#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4082#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {4082#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4082#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,008 INFO L273 TraceCheckUtils]: 22: Hoare triple {4082#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4082#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {4082#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4083#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,009 INFO L273 TraceCheckUtils]: 24: Hoare triple {4083#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4083#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {4083#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4083#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {4083#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4084#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {4084#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4084#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {4084#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4084#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,013 INFO L273 TraceCheckUtils]: 29: Hoare triple {4084#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4085#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {4085#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4085#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,014 INFO L273 TraceCheckUtils]: 31: Hoare triple {4085#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4085#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {4085#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4086#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,016 INFO L273 TraceCheckUtils]: 33: Hoare triple {4086#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4086#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,016 INFO L273 TraceCheckUtils]: 34: Hoare triple {4086#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4086#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,017 INFO L273 TraceCheckUtils]: 35: Hoare triple {4086#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4087#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,018 INFO L273 TraceCheckUtils]: 36: Hoare triple {4087#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4087#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {4087#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4087#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,019 INFO L273 TraceCheckUtils]: 38: Hoare triple {4087#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4088#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,020 INFO L273 TraceCheckUtils]: 39: Hoare triple {4088#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4088#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,021 INFO L273 TraceCheckUtils]: 40: Hoare triple {4088#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4088#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,022 INFO L273 TraceCheckUtils]: 41: Hoare triple {4088#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4089#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {4089#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4076#false} is VALID [2018-11-23 12:05:35,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {4076#false} havoc ~x~0;~x~0 := 0; {4076#false} is VALID [2018-11-23 12:05:35,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {4076#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4076#false} is VALID [2018-11-23 12:05:35,046 INFO L256 TraceCheckUtils]: 45: Hoare triple {4076#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4076#false} is VALID [2018-11-23 12:05:35,047 INFO L273 TraceCheckUtils]: 46: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2018-11-23 12:05:35,047 INFO L273 TraceCheckUtils]: 47: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2018-11-23 12:05:35,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2018-11-23 12:05:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:35,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:35,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:35,067 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:35,267 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:05:35,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:35,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4075#true} is VALID [2018-11-23 12:05:35,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {4075#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4075#true} is VALID [2018-11-23 12:05:35,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2018-11-23 12:05:35,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #70#return; {4075#true} is VALID [2018-11-23 12:05:35,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret7 := main(); {4075#true} is VALID [2018-11-23 12:05:35,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {4075#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4108#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {4108#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4108#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {4108#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4108#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {4108#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {4078#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {4078#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4078#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {4078#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {4079#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {4079#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4079#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {4079#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {4080#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {4080#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4080#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {4080#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {4081#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {4081#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4081#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {4081#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4082#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {4082#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4082#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {4082#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4082#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {4082#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4083#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {4083#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4083#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {4083#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4083#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {4083#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4084#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,543 INFO L273 TraceCheckUtils]: 27: Hoare triple {4084#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4084#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {4084#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4084#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,564 INFO L273 TraceCheckUtils]: 29: Hoare triple {4084#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4085#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,564 INFO L273 TraceCheckUtils]: 30: Hoare triple {4085#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4085#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,566 INFO L273 TraceCheckUtils]: 31: Hoare triple {4085#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4085#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {4085#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4086#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {4086#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4086#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {4086#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4086#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {4086#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4087#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {4087#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4087#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,572 INFO L273 TraceCheckUtils]: 37: Hoare triple {4087#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4087#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,572 INFO L273 TraceCheckUtils]: 38: Hoare triple {4087#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4088#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {4088#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4088#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,573 INFO L273 TraceCheckUtils]: 40: Hoare triple {4088#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4088#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {4088#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4089#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,574 INFO L273 TraceCheckUtils]: 42: Hoare triple {4089#(<= main_~i~0 12)} assume !(~i~0 < 100000); {4076#false} is VALID [2018-11-23 12:05:35,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {4076#false} havoc ~x~0;~x~0 := 0; {4076#false} is VALID [2018-11-23 12:05:35,574 INFO L273 TraceCheckUtils]: 44: Hoare triple {4076#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4076#false} is VALID [2018-11-23 12:05:35,575 INFO L256 TraceCheckUtils]: 45: Hoare triple {4076#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4076#false} is VALID [2018-11-23 12:05:35,575 INFO L273 TraceCheckUtils]: 46: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2018-11-23 12:05:35,575 INFO L273 TraceCheckUtils]: 47: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2018-11-23 12:05:35,575 INFO L273 TraceCheckUtils]: 48: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2018-11-23 12:05:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:35,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:35,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:05:35,601 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 12:05:35,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:35,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:05:35,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:35,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:05:35,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:05:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:05:35,691 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 16 states. [2018-11-23 12:05:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,420 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2018-11-23 12:05:36,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:05:36,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-23 12:05:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 100 transitions. [2018-11-23 12:05:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:05:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 100 transitions. [2018-11-23 12:05:36,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 100 transitions. [2018-11-23 12:05:36,867 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 12:05:36,869 INFO L225 Difference]: With dead ends: 80 [2018-11-23 12:05:36,869 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:05:36,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 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 12:05:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:05:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-23 12:05:36,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:36,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-23 12:05:36,893 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-23 12:05:36,894 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-23 12:05:36,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,896 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-23 12:05:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2018-11-23 12:05:36,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,896 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-23 12:05:36,897 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-23 12:05:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,898 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-23 12:05:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2018-11-23 12:05:36,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:36,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:05:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-11-23 12:05:36,901 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 49 [2018-11-23 12:05:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:36,901 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-23 12:05:36,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:05:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-11-23 12:05:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:05:36,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:36,902 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:36,903 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:36,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:36,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1760380212, now seen corresponding path program 13 times [2018-11-23 12:05:36,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:36,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:36,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:36,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {4558#true} call ULTIMATE.init(); {4558#true} is VALID [2018-11-23 12:05:38,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {4558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4558#true} is VALID [2018-11-23 12:05:38,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {4558#true} assume true; {4558#true} is VALID [2018-11-23 12:05:38,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4558#true} {4558#true} #70#return; {4558#true} is VALID [2018-11-23 12:05:38,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {4558#true} call #t~ret7 := main(); {4558#true} is VALID [2018-11-23 12:05:38,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {4558#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4560#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {4560#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4560#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {4560#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4560#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {4560#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4561#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {4561#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4561#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {4561#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4561#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {4561#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4562#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {4562#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4562#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {4562#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4562#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {4562#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4563#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {4563#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4563#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {4563#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4563#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {4563#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4564#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {4564#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4564#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {4564#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4564#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {4564#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4565#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {4565#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4565#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {4565#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4565#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {4565#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4566#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {4566#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4566#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {4566#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4566#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {4566#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4567#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {4567#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4567#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,378 INFO L273 TraceCheckUtils]: 28: Hoare triple {4567#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4567#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {4567#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4568#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,380 INFO L273 TraceCheckUtils]: 30: Hoare triple {4568#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4568#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {4568#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4568#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {4568#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {4569#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4569#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {4569#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4569#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,383 INFO L273 TraceCheckUtils]: 35: Hoare triple {4569#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4570#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,384 INFO L273 TraceCheckUtils]: 36: Hoare triple {4570#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4570#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,384 INFO L273 TraceCheckUtils]: 37: Hoare triple {4570#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4570#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,385 INFO L273 TraceCheckUtils]: 38: Hoare triple {4570#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4571#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,386 INFO L273 TraceCheckUtils]: 39: Hoare triple {4571#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4571#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {4571#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4571#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,387 INFO L273 TraceCheckUtils]: 41: Hoare triple {4571#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4572#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,388 INFO L273 TraceCheckUtils]: 42: Hoare triple {4572#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4572#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {4572#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4572#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {4572#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4573#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,391 INFO L273 TraceCheckUtils]: 45: Hoare triple {4573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4559#false} is VALID [2018-11-23 12:05:38,391 INFO L273 TraceCheckUtils]: 46: Hoare triple {4559#false} havoc ~x~0;~x~0 := 0; {4559#false} is VALID [2018-11-23 12:05:38,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {4559#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4559#false} is VALID [2018-11-23 12:05:38,392 INFO L256 TraceCheckUtils]: 48: Hoare triple {4559#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4559#false} is VALID [2018-11-23 12:05:38,392 INFO L273 TraceCheckUtils]: 49: Hoare triple {4559#false} ~cond := #in~cond; {4559#false} is VALID [2018-11-23 12:05:38,392 INFO L273 TraceCheckUtils]: 50: Hoare triple {4559#false} assume 0 == ~cond; {4559#false} is VALID [2018-11-23 12:05:38,392 INFO L273 TraceCheckUtils]: 51: Hoare triple {4559#false} assume !false; {4559#false} is VALID [2018-11-23 12:05:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:38,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:38,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:38,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:38,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:38,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {4558#true} call ULTIMATE.init(); {4558#true} is VALID [2018-11-23 12:05:38,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {4558#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4558#true} is VALID [2018-11-23 12:05:38,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {4558#true} assume true; {4558#true} is VALID [2018-11-23 12:05:38,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4558#true} {4558#true} #70#return; {4558#true} is VALID [2018-11-23 12:05:38,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {4558#true} call #t~ret7 := main(); {4558#true} is VALID [2018-11-23 12:05:38,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {4558#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {4592#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {4592#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4592#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {4592#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4592#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:38,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {4592#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4561#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {4561#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4561#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {4561#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4561#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {4561#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4562#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {4562#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4562#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {4562#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4562#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {4562#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4563#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {4563#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4563#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {4563#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4563#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {4563#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4564#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {4564#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4564#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,639 INFO L273 TraceCheckUtils]: 19: Hoare triple {4564#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4564#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {4564#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4565#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {4565#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4565#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {4565#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4565#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,641 INFO L273 TraceCheckUtils]: 23: Hoare triple {4565#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4566#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {4566#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4566#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {4566#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4566#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {4566#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4567#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,644 INFO L273 TraceCheckUtils]: 27: Hoare triple {4567#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4567#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {4567#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4567#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,645 INFO L273 TraceCheckUtils]: 29: Hoare triple {4567#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4568#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,646 INFO L273 TraceCheckUtils]: 30: Hoare triple {4568#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4568#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,646 INFO L273 TraceCheckUtils]: 31: Hoare triple {4568#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4568#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {4568#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {4569#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4569#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {4569#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4569#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {4569#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4570#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {4570#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4570#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {4570#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4570#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {4570#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4571#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {4571#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4571#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,652 INFO L273 TraceCheckUtils]: 40: Hoare triple {4571#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4571#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,653 INFO L273 TraceCheckUtils]: 41: Hoare triple {4571#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4572#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {4572#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4572#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,654 INFO L273 TraceCheckUtils]: 43: Hoare triple {4572#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4572#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {4572#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4573#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,656 INFO L273 TraceCheckUtils]: 45: Hoare triple {4573#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4559#false} is VALID [2018-11-23 12:05:38,656 INFO L273 TraceCheckUtils]: 46: Hoare triple {4559#false} havoc ~x~0;~x~0 := 0; {4559#false} is VALID [2018-11-23 12:05:38,656 INFO L273 TraceCheckUtils]: 47: Hoare triple {4559#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {4559#false} is VALID [2018-11-23 12:05:38,656 INFO L256 TraceCheckUtils]: 48: Hoare triple {4559#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {4559#false} is VALID [2018-11-23 12:05:38,657 INFO L273 TraceCheckUtils]: 49: Hoare triple {4559#false} ~cond := #in~cond; {4559#false} is VALID [2018-11-23 12:05:38,657 INFO L273 TraceCheckUtils]: 50: Hoare triple {4559#false} assume 0 == ~cond; {4559#false} is VALID [2018-11-23 12:05:38,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {4559#false} assume !false; {4559#false} is VALID [2018-11-23 12:05:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:38,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:05:38,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:05:38,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:38,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:05:38,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:38,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:05:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:05:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:38,743 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 17 states. [2018-11-23 12:05:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,205 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2018-11-23 12:05:39,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:05:39,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-23 12:05:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2018-11-23 12:05:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:05:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 104 transitions. [2018-11-23 12:05:39,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 104 transitions. [2018-11-23 12:05:39,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:39,643 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:05:39,643 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 12:05:39,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:05:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 12:05:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-23 12:05:39,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:39,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 65 states. [2018-11-23 12:05:39,674 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 65 states. [2018-11-23 12:05:39,674 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 65 states. [2018-11-23 12:05:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,676 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-23 12:05:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-23 12:05:39,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:39,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:39,677 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 67 states. [2018-11-23 12:05:39,677 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 67 states. [2018-11-23 12:05:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:39,679 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-23 12:05:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-23 12:05:39,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:39,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:39,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:39,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 12:05:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2018-11-23 12:05:39,682 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 52 [2018-11-23 12:05:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:39,683 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2018-11-23 12:05:39,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:05:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-11-23 12:05:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:05:39,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:39,684 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:39,684 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:39,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -806407513, now seen corresponding path program 14 times [2018-11-23 12:05:39,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:39,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {5065#true} call ULTIMATE.init(); {5065#true} is VALID [2018-11-23 12:05:40,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {5065#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5065#true} is VALID [2018-11-23 12:05:40,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {5065#true} assume true; {5065#true} is VALID [2018-11-23 12:05:40,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5065#true} {5065#true} #70#return; {5065#true} is VALID [2018-11-23 12:05:40,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {5065#true} call #t~ret7 := main(); {5065#true} is VALID [2018-11-23 12:05:40,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {5065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5067#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {5067#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5067#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {5067#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5067#(= main_~i~0 0)} is VALID [2018-11-23 12:05:40,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {5067#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {5068#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {5068#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:40,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {5068#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {5069#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {5069#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:40,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {5069#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {5070#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {5070#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:40,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {5070#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {5071#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {5071#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:40,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {5071#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {5072#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {5072#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:40,885 INFO L273 TraceCheckUtils]: 23: Hoare triple {5072#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5073#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,886 INFO L273 TraceCheckUtils]: 24: Hoare triple {5073#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5073#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {5073#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5073#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:40,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {5073#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5074#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {5074#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {5074#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5074#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:40,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {5074#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5075#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,890 INFO L273 TraceCheckUtils]: 30: Hoare triple {5075#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,891 INFO L273 TraceCheckUtils]: 31: Hoare triple {5075#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5075#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:40,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {5075#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5076#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {5076#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,894 INFO L273 TraceCheckUtils]: 34: Hoare triple {5076#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5076#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:40,894 INFO L273 TraceCheckUtils]: 35: Hoare triple {5076#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5077#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,895 INFO L273 TraceCheckUtils]: 36: Hoare triple {5077#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,895 INFO L273 TraceCheckUtils]: 37: Hoare triple {5077#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5077#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:40,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {5077#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5078#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {5078#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5078#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {5078#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5078#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:40,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {5078#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5079#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,898 INFO L273 TraceCheckUtils]: 42: Hoare triple {5079#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5079#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {5079#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5079#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:40,900 INFO L273 TraceCheckUtils]: 44: Hoare triple {5079#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5080#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {5080#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5080#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,901 INFO L273 TraceCheckUtils]: 46: Hoare triple {5080#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5080#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:40,902 INFO L273 TraceCheckUtils]: 47: Hoare triple {5080#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5081#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:40,903 INFO L273 TraceCheckUtils]: 48: Hoare triple {5081#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5066#false} is VALID [2018-11-23 12:05:40,903 INFO L273 TraceCheckUtils]: 49: Hoare triple {5066#false} havoc ~x~0;~x~0 := 0; {5066#false} is VALID [2018-11-23 12:05:40,904 INFO L273 TraceCheckUtils]: 50: Hoare triple {5066#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {5066#false} is VALID [2018-11-23 12:05:40,904 INFO L256 TraceCheckUtils]: 51: Hoare triple {5066#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5066#false} is VALID [2018-11-23 12:05:40,904 INFO L273 TraceCheckUtils]: 52: Hoare triple {5066#false} ~cond := #in~cond; {5066#false} is VALID [2018-11-23 12:05:40,904 INFO L273 TraceCheckUtils]: 53: Hoare triple {5066#false} assume 0 == ~cond; {5066#false} is VALID [2018-11-23 12:05:40,904 INFO L273 TraceCheckUtils]: 54: Hoare triple {5066#false} assume !false; {5066#false} is VALID [2018-11-23 12:05:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:40,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:40,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:40,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:40,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:40,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:40,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:41,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {5065#true} call ULTIMATE.init(); {5065#true} is VALID [2018-11-23 12:05:41,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {5065#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5065#true} is VALID [2018-11-23 12:05:41,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {5065#true} assume true; {5065#true} is VALID [2018-11-23 12:05:41,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5065#true} {5065#true} #70#return; {5065#true} is VALID [2018-11-23 12:05:41,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {5065#true} call #t~ret7 := main(); {5065#true} is VALID [2018-11-23 12:05:41,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {5065#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5100#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:41,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {5100#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5100#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:41,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {5100#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5100#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:41,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {5100#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:41,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {5068#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:41,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {5068#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5068#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:41,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {5068#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:41,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {5069#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:41,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {5069#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5069#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:41,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {5069#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:41,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {5070#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:41,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {5070#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5070#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:41,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {5070#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:41,196 INFO L273 TraceCheckUtils]: 18: Hoare triple {5071#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:41,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {5071#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5071#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:41,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {5071#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:41,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {5072#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:41,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {5072#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5072#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:41,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {5072#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5073#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {5073#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5073#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,201 INFO L273 TraceCheckUtils]: 25: Hoare triple {5073#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5073#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:41,202 INFO L273 TraceCheckUtils]: 26: Hoare triple {5073#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5074#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,203 INFO L273 TraceCheckUtils]: 27: Hoare triple {5074#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,204 INFO L273 TraceCheckUtils]: 28: Hoare triple {5074#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5074#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:41,204 INFO L273 TraceCheckUtils]: 29: Hoare triple {5074#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5075#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,205 INFO L273 TraceCheckUtils]: 30: Hoare triple {5075#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,206 INFO L273 TraceCheckUtils]: 31: Hoare triple {5075#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5075#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:41,206 INFO L273 TraceCheckUtils]: 32: Hoare triple {5075#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5076#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {5076#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,208 INFO L273 TraceCheckUtils]: 34: Hoare triple {5076#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5076#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:41,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {5076#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5077#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,209 INFO L273 TraceCheckUtils]: 36: Hoare triple {5077#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,210 INFO L273 TraceCheckUtils]: 37: Hoare triple {5077#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5077#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:41,211 INFO L273 TraceCheckUtils]: 38: Hoare triple {5077#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5078#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,211 INFO L273 TraceCheckUtils]: 39: Hoare triple {5078#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5078#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {5078#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5078#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:41,213 INFO L273 TraceCheckUtils]: 41: Hoare triple {5078#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5079#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,214 INFO L273 TraceCheckUtils]: 42: Hoare triple {5079#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5079#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,214 INFO L273 TraceCheckUtils]: 43: Hoare triple {5079#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5079#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:41,215 INFO L273 TraceCheckUtils]: 44: Hoare triple {5079#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5080#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {5080#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5080#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,217 INFO L273 TraceCheckUtils]: 46: Hoare triple {5080#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5080#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:41,217 INFO L273 TraceCheckUtils]: 47: Hoare triple {5080#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5081#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:41,218 INFO L273 TraceCheckUtils]: 48: Hoare triple {5081#(<= main_~i~0 14)} assume !(~i~0 < 100000); {5066#false} is VALID [2018-11-23 12:05:41,219 INFO L273 TraceCheckUtils]: 49: Hoare triple {5066#false} havoc ~x~0;~x~0 := 0; {5066#false} is VALID [2018-11-23 12:05:41,219 INFO L273 TraceCheckUtils]: 50: Hoare triple {5066#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {5066#false} is VALID [2018-11-23 12:05:41,219 INFO L256 TraceCheckUtils]: 51: Hoare triple {5066#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5066#false} is VALID [2018-11-23 12:05:41,219 INFO L273 TraceCheckUtils]: 52: Hoare triple {5066#false} ~cond := #in~cond; {5066#false} is VALID [2018-11-23 12:05:41,219 INFO L273 TraceCheckUtils]: 53: Hoare triple {5066#false} assume 0 == ~cond; {5066#false} is VALID [2018-11-23 12:05:41,220 INFO L273 TraceCheckUtils]: 54: Hoare triple {5066#false} assume !false; {5066#false} is VALID [2018-11-23 12:05:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:41,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:41,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:05:41,243 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 12:05:41,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:41,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:05:41,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:41,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:05:41,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:05:41,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:41,315 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 18 states. [2018-11-23 12:05:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:41,839 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2018-11-23 12:05:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:05:41,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-23 12:05:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. [2018-11-23 12:05:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:05:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 108 transitions. [2018-11-23 12:05:41,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 108 transitions. [2018-11-23 12:05:42,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:42,403 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:05:42,403 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:05:42,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:05:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:05:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-23 12:05:42,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:42,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 68 states. [2018-11-23 12:05:42,517 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 68 states. [2018-11-23 12:05:42,517 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 68 states. [2018-11-23 12:05:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:42,519 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2018-11-23 12:05:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2018-11-23 12:05:42,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:42,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:42,520 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 70 states. [2018-11-23 12:05:42,521 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 70 states. [2018-11-23 12:05:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:42,522 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2018-11-23 12:05:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2018-11-23 12:05:42,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:42,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:42,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:42,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 12:05:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-11-23 12:05:42,524 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 55 [2018-11-23 12:05:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:42,524 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-23 12:05:42,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:05:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-23 12:05:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:05:42,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:42,525 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:42,525 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:42,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -381785004, now seen corresponding path program 15 times [2018-11-23 12:05:42,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:42,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:42,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:42,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:43,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {5596#true} call ULTIMATE.init(); {5596#true} is VALID [2018-11-23 12:05:43,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {5596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5596#true} is VALID [2018-11-23 12:05:43,065 INFO L273 TraceCheckUtils]: 2: Hoare triple {5596#true} assume true; {5596#true} is VALID [2018-11-23 12:05:43,065 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5596#true} {5596#true} #70#return; {5596#true} is VALID [2018-11-23 12:05:43,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {5596#true} call #t~ret7 := main(); {5596#true} is VALID [2018-11-23 12:05:43,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {5596#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5598#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {5598#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5598#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {5598#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5598#(= main_~i~0 0)} is VALID [2018-11-23 12:05:43,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {5598#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5599#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {5599#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5599#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {5599#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5599#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {5599#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5600#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {5600#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5600#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {5600#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5600#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {5600#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5601#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {5601#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5601#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {5601#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5601#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {5601#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5602#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {5602#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5602#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {5602#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5602#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {5602#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5603#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {5603#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5603#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {5603#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5603#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {5603#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5604#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {5604#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5604#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {5604#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5604#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {5604#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5605#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,080 INFO L273 TraceCheckUtils]: 27: Hoare triple {5605#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5605#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {5605#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5605#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {5605#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5606#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {5606#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5606#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {5606#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5606#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,084 INFO L273 TraceCheckUtils]: 32: Hoare triple {5606#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5607#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {5607#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5607#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,085 INFO L273 TraceCheckUtils]: 34: Hoare triple {5607#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5607#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,086 INFO L273 TraceCheckUtils]: 35: Hoare triple {5607#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5608#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,087 INFO L273 TraceCheckUtils]: 36: Hoare triple {5608#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5608#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,087 INFO L273 TraceCheckUtils]: 37: Hoare triple {5608#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5608#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,088 INFO L273 TraceCheckUtils]: 38: Hoare triple {5608#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5609#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {5609#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5609#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {5609#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5609#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {5609#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5610#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {5610#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5610#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {5610#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5610#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,092 INFO L273 TraceCheckUtils]: 44: Hoare triple {5610#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5611#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5611#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,094 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5611#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,095 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5612#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,095 INFO L273 TraceCheckUtils]: 48: Hoare triple {5612#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5612#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,096 INFO L273 TraceCheckUtils]: 49: Hoare triple {5612#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5612#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,097 INFO L273 TraceCheckUtils]: 50: Hoare triple {5612#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5613#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,097 INFO L273 TraceCheckUtils]: 51: Hoare triple {5613#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5597#false} is VALID [2018-11-23 12:05:43,098 INFO L273 TraceCheckUtils]: 52: Hoare triple {5597#false} havoc ~x~0;~x~0 := 0; {5597#false} is VALID [2018-11-23 12:05:43,098 INFO L273 TraceCheckUtils]: 53: Hoare triple {5597#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {5597#false} is VALID [2018-11-23 12:05:43,098 INFO L256 TraceCheckUtils]: 54: Hoare triple {5597#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5597#false} is VALID [2018-11-23 12:05:43,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {5597#false} ~cond := #in~cond; {5597#false} is VALID [2018-11-23 12:05:43,098 INFO L273 TraceCheckUtils]: 56: Hoare triple {5597#false} assume 0 == ~cond; {5597#false} is VALID [2018-11-23 12:05:43,099 INFO L273 TraceCheckUtils]: 57: Hoare triple {5597#false} assume !false; {5597#false} is VALID [2018-11-23 12:05:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:43,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:43,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:43,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:43,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 12:05:43,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:43,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:43,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {5596#true} call ULTIMATE.init(); {5596#true} is VALID [2018-11-23 12:05:43,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {5596#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5596#true} is VALID [2018-11-23 12:05:43,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {5596#true} assume true; {5596#true} is VALID [2018-11-23 12:05:43,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5596#true} {5596#true} #70#return; {5596#true} is VALID [2018-11-23 12:05:43,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {5596#true} call #t~ret7 := main(); {5596#true} is VALID [2018-11-23 12:05:43,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {5596#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {5632#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:43,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {5632#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5632#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:43,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {5632#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5632#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:43,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {5632#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5599#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {5599#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5599#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {5599#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5599#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:43,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {5599#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5600#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {5600#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5600#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {5600#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5600#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:43,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {5600#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5601#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {5601#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5601#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {5601#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5601#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:43,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {5601#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5602#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {5602#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5602#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {5602#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5602#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:43,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {5602#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5603#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,647 INFO L273 TraceCheckUtils]: 21: Hoare triple {5603#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5603#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {5603#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5603#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:43,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {5603#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5604#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {5604#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5604#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {5604#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5604#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:43,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {5604#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5605#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {5605#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5605#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,652 INFO L273 TraceCheckUtils]: 28: Hoare triple {5605#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5605#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:43,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {5605#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5606#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {5606#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5606#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {5606#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5606#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:43,655 INFO L273 TraceCheckUtils]: 32: Hoare triple {5606#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5607#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,656 INFO L273 TraceCheckUtils]: 33: Hoare triple {5607#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5607#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {5607#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5607#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:43,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {5607#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5608#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,658 INFO L273 TraceCheckUtils]: 36: Hoare triple {5608#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5608#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,658 INFO L273 TraceCheckUtils]: 37: Hoare triple {5608#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5608#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:43,659 INFO L273 TraceCheckUtils]: 38: Hoare triple {5608#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5609#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {5609#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5609#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,661 INFO L273 TraceCheckUtils]: 40: Hoare triple {5609#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5609#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:43,662 INFO L273 TraceCheckUtils]: 41: Hoare triple {5609#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5610#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {5610#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5610#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,663 INFO L273 TraceCheckUtils]: 43: Hoare triple {5610#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5610#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:43,664 INFO L273 TraceCheckUtils]: 44: Hoare triple {5610#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5611#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {5611#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5611#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,665 INFO L273 TraceCheckUtils]: 46: Hoare triple {5611#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5611#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:43,666 INFO L273 TraceCheckUtils]: 47: Hoare triple {5611#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5612#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {5612#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5612#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,667 INFO L273 TraceCheckUtils]: 49: Hoare triple {5612#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5612#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:43,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {5612#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5613#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:43,669 INFO L273 TraceCheckUtils]: 51: Hoare triple {5613#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5597#false} is VALID [2018-11-23 12:05:43,669 INFO L273 TraceCheckUtils]: 52: Hoare triple {5597#false} havoc ~x~0;~x~0 := 0; {5597#false} is VALID [2018-11-23 12:05:43,669 INFO L273 TraceCheckUtils]: 53: Hoare triple {5597#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {5597#false} is VALID [2018-11-23 12:05:43,669 INFO L256 TraceCheckUtils]: 54: Hoare triple {5597#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {5597#false} is VALID [2018-11-23 12:05:43,670 INFO L273 TraceCheckUtils]: 55: Hoare triple {5597#false} ~cond := #in~cond; {5597#false} is VALID [2018-11-23 12:05:43,670 INFO L273 TraceCheckUtils]: 56: Hoare triple {5597#false} assume 0 == ~cond; {5597#false} is VALID [2018-11-23 12:05:43,670 INFO L273 TraceCheckUtils]: 57: Hoare triple {5597#false} assume !false; {5597#false} is VALID [2018-11-23 12:05:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:43,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:43,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:05:43,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 12:05:43,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:43,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:05:43,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:43,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:05:43,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:05:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:43,785 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 19 states. [2018-11-23 12:05:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,662 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2018-11-23 12:05:44,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:05:44,663 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-23 12:05:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 112 transitions. [2018-11-23 12:05:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:05:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 112 transitions. [2018-11-23 12:05:44,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 112 transitions. [2018-11-23 12:05:44,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:44,818 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:05:44,819 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:05:44,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:05:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:05:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-11-23 12:05:44,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:44,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 71 states. [2018-11-23 12:05:44,923 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 71 states. [2018-11-23 12:05:44,924 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 71 states. [2018-11-23 12:05:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,925 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 12:05:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 12:05:44,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:44,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:44,926 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 73 states. [2018-11-23 12:05:44,926 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 73 states. [2018-11-23 12:05:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:44,929 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 12:05:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 12:05:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:44,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:44,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:44,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:05:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-11-23 12:05:44,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 58 [2018-11-23 12:05:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:44,932 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-11-23 12:05:44,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:05:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 12:05:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 12:05:44,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:44,934 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:44,934 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:44,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 868693895, now seen corresponding path program 16 times [2018-11-23 12:05:44,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:44,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:45,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {6151#true} call ULTIMATE.init(); {6151#true} is VALID [2018-11-23 12:05:45,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {6151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6151#true} is VALID [2018-11-23 12:05:45,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {6151#true} assume true; {6151#true} is VALID [2018-11-23 12:05:45,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6151#true} {6151#true} #70#return; {6151#true} is VALID [2018-11-23 12:05:45,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {6151#true} call #t~ret7 := main(); {6151#true} is VALID [2018-11-23 12:05:45,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {6151#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6153#(= main_~i~0 0)} is VALID [2018-11-23 12:05:45,498 INFO L273 TraceCheckUtils]: 6: Hoare triple {6153#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6153#(= main_~i~0 0)} is VALID [2018-11-23 12:05:45,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {6153#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6153#(= main_~i~0 0)} is VALID [2018-11-23 12:05:45,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {6153#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {6154#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6154#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,500 INFO L273 TraceCheckUtils]: 10: Hoare triple {6154#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6154#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {6154#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {6155#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6155#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {6155#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6155#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {6155#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6156#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {6156#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6156#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {6156#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6156#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {6156#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6157#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {6157#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6157#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {6157#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6157#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {6157#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6158#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {6158#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6158#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,508 INFO L273 TraceCheckUtils]: 22: Hoare triple {6158#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6158#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,509 INFO L273 TraceCheckUtils]: 23: Hoare triple {6158#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6159#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {6159#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6159#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {6159#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6159#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {6159#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6160#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {6160#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6160#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {6160#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6160#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {6160#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6161#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {6161#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6161#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {6161#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6161#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,515 INFO L273 TraceCheckUtils]: 32: Hoare triple {6161#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6162#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {6162#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6162#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {6162#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6162#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {6162#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6163#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,518 INFO L273 TraceCheckUtils]: 36: Hoare triple {6163#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6163#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,519 INFO L273 TraceCheckUtils]: 37: Hoare triple {6163#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6163#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,520 INFO L273 TraceCheckUtils]: 38: Hoare triple {6163#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6164#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,520 INFO L273 TraceCheckUtils]: 39: Hoare triple {6164#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6164#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,521 INFO L273 TraceCheckUtils]: 40: Hoare triple {6164#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6164#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,522 INFO L273 TraceCheckUtils]: 41: Hoare triple {6164#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6165#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,522 INFO L273 TraceCheckUtils]: 42: Hoare triple {6165#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6165#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,523 INFO L273 TraceCheckUtils]: 43: Hoare triple {6165#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6165#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,524 INFO L273 TraceCheckUtils]: 44: Hoare triple {6165#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6166#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,524 INFO L273 TraceCheckUtils]: 45: Hoare triple {6166#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6166#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {6166#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6166#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,526 INFO L273 TraceCheckUtils]: 47: Hoare triple {6166#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6167#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,526 INFO L273 TraceCheckUtils]: 48: Hoare triple {6167#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6167#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,527 INFO L273 TraceCheckUtils]: 49: Hoare triple {6167#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6167#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,528 INFO L273 TraceCheckUtils]: 50: Hoare triple {6167#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6168#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,529 INFO L273 TraceCheckUtils]: 51: Hoare triple {6168#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6168#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,529 INFO L273 TraceCheckUtils]: 52: Hoare triple {6168#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6168#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,530 INFO L273 TraceCheckUtils]: 53: Hoare triple {6168#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6169#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,531 INFO L273 TraceCheckUtils]: 54: Hoare triple {6169#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6152#false} is VALID [2018-11-23 12:05:45,531 INFO L273 TraceCheckUtils]: 55: Hoare triple {6152#false} havoc ~x~0;~x~0 := 0; {6152#false} is VALID [2018-11-23 12:05:45,531 INFO L273 TraceCheckUtils]: 56: Hoare triple {6152#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6152#false} is VALID [2018-11-23 12:05:45,531 INFO L256 TraceCheckUtils]: 57: Hoare triple {6152#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6152#false} is VALID [2018-11-23 12:05:45,532 INFO L273 TraceCheckUtils]: 58: Hoare triple {6152#false} ~cond := #in~cond; {6152#false} is VALID [2018-11-23 12:05:45,532 INFO L273 TraceCheckUtils]: 59: Hoare triple {6152#false} assume 0 == ~cond; {6152#false} is VALID [2018-11-23 12:05:45,532 INFO L273 TraceCheckUtils]: 60: Hoare triple {6152#false} assume !false; {6152#false} is VALID [2018-11-23 12:05:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:45,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:45,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:45,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:45,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:45,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:45,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:45,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {6151#true} call ULTIMATE.init(); {6151#true} is VALID [2018-11-23 12:05:45,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {6151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6151#true} is VALID [2018-11-23 12:05:45,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {6151#true} assume true; {6151#true} is VALID [2018-11-23 12:05:45,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6151#true} {6151#true} #70#return; {6151#true} is VALID [2018-11-23 12:05:45,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {6151#true} call #t~ret7 := main(); {6151#true} is VALID [2018-11-23 12:05:45,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {6151#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6188#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:45,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {6188#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6188#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:45,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {6188#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6188#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:45,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {6188#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6154#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {6154#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6154#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {6154#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6154#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:45,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {6154#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6155#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {6155#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6155#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {6155#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6155#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:45,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {6155#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6156#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {6156#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6156#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {6156#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6156#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:45,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {6156#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6157#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {6157#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6157#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {6157#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6157#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:45,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {6157#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6158#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {6158#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6158#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {6158#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6158#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:45,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {6158#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6159#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {6159#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6159#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {6159#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6159#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:45,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {6159#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6160#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,942 INFO L273 TraceCheckUtils]: 27: Hoare triple {6160#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6160#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,943 INFO L273 TraceCheckUtils]: 28: Hoare triple {6160#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6160#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:45,944 INFO L273 TraceCheckUtils]: 29: Hoare triple {6160#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6161#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,944 INFO L273 TraceCheckUtils]: 30: Hoare triple {6161#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6161#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,945 INFO L273 TraceCheckUtils]: 31: Hoare triple {6161#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6161#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:45,946 INFO L273 TraceCheckUtils]: 32: Hoare triple {6161#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6162#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,946 INFO L273 TraceCheckUtils]: 33: Hoare triple {6162#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6162#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,947 INFO L273 TraceCheckUtils]: 34: Hoare triple {6162#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6162#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:45,966 INFO L273 TraceCheckUtils]: 35: Hoare triple {6162#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6163#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {6163#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6163#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,971 INFO L273 TraceCheckUtils]: 37: Hoare triple {6163#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6163#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:45,972 INFO L273 TraceCheckUtils]: 38: Hoare triple {6163#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6164#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,972 INFO L273 TraceCheckUtils]: 39: Hoare triple {6164#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6164#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,972 INFO L273 TraceCheckUtils]: 40: Hoare triple {6164#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6164#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:45,973 INFO L273 TraceCheckUtils]: 41: Hoare triple {6164#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6165#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,973 INFO L273 TraceCheckUtils]: 42: Hoare triple {6165#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6165#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,974 INFO L273 TraceCheckUtils]: 43: Hoare triple {6165#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6165#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:45,974 INFO L273 TraceCheckUtils]: 44: Hoare triple {6165#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6166#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {6166#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6166#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,975 INFO L273 TraceCheckUtils]: 46: Hoare triple {6166#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6166#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:45,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {6166#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6167#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,976 INFO L273 TraceCheckUtils]: 48: Hoare triple {6167#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6167#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,976 INFO L273 TraceCheckUtils]: 49: Hoare triple {6167#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6167#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:45,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {6167#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6168#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,978 INFO L273 TraceCheckUtils]: 51: Hoare triple {6168#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6168#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,978 INFO L273 TraceCheckUtils]: 52: Hoare triple {6168#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6168#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:45,979 INFO L273 TraceCheckUtils]: 53: Hoare triple {6168#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6169#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:45,980 INFO L273 TraceCheckUtils]: 54: Hoare triple {6169#(<= main_~i~0 16)} assume !(~i~0 < 100000); {6152#false} is VALID [2018-11-23 12:05:45,980 INFO L273 TraceCheckUtils]: 55: Hoare triple {6152#false} havoc ~x~0;~x~0 := 0; {6152#false} is VALID [2018-11-23 12:05:45,980 INFO L273 TraceCheckUtils]: 56: Hoare triple {6152#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6152#false} is VALID [2018-11-23 12:05:45,981 INFO L256 TraceCheckUtils]: 57: Hoare triple {6152#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6152#false} is VALID [2018-11-23 12:05:45,981 INFO L273 TraceCheckUtils]: 58: Hoare triple {6152#false} ~cond := #in~cond; {6152#false} is VALID [2018-11-23 12:05:45,981 INFO L273 TraceCheckUtils]: 59: Hoare triple {6152#false} assume 0 == ~cond; {6152#false} is VALID [2018-11-23 12:05:45,981 INFO L273 TraceCheckUtils]: 60: Hoare triple {6152#false} assume !false; {6152#false} is VALID [2018-11-23 12:05:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:46,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:46,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:05:46,005 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 12:05:46,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:46,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:05:46,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:46,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:05:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:05:46,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:46,083 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 20 states. [2018-11-23 12:05:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:46,633 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2018-11-23 12:05:46,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:05:46,634 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-23 12:05:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 116 transitions. [2018-11-23 12:05:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:05:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 116 transitions. [2018-11-23 12:05:46,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 116 transitions. [2018-11-23 12:05:46,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:46,795 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:05:46,795 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:05:46,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:05:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:05:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-23 12:05:46,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:46,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-23 12:05:46,825 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-23 12:05:46,825 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-23 12:05:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:46,828 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2018-11-23 12:05:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2018-11-23 12:05:46,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:46,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:46,829 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-23 12:05:46,829 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-23 12:05:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:46,831 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2018-11-23 12:05:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2018-11-23 12:05:46,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:46,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:46,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:46,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:05:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2018-11-23 12:05:46,833 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 61 [2018-11-23 12:05:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:46,833 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2018-11-23 12:05:46,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:05:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-11-23 12:05:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:05:46,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:46,835 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:46,835 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:46,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash -660751500, now seen corresponding path program 17 times [2018-11-23 12:05:46,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:46,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:46,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:46,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:46,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:47,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {6730#true} call ULTIMATE.init(); {6730#true} is VALID [2018-11-23 12:05:47,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {6730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6730#true} is VALID [2018-11-23 12:05:47,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {6730#true} assume true; {6730#true} is VALID [2018-11-23 12:05:47,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6730#true} {6730#true} #70#return; {6730#true} is VALID [2018-11-23 12:05:47,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {6730#true} call #t~ret7 := main(); {6730#true} is VALID [2018-11-23 12:05:47,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {6730#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6732#(= main_~i~0 0)} is VALID [2018-11-23 12:05:47,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {6732#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6732#(= main_~i~0 0)} is VALID [2018-11-23 12:05:47,507 INFO L273 TraceCheckUtils]: 7: Hoare triple {6732#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6732#(= main_~i~0 0)} is VALID [2018-11-23 12:05:47,508 INFO L273 TraceCheckUtils]: 8: Hoare triple {6732#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6733#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:47,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {6733#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6733#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:47,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {6733#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6733#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:47,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {6733#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6734#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:47,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {6734#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6734#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:47,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {6734#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6734#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:47,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {6734#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6735#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:47,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {6735#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6735#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:47,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {6735#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6735#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:47,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {6735#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6736#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:47,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {6736#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6736#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:47,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {6736#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6736#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:47,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {6736#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6737#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:47,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {6737#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6737#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:47,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {6737#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6737#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:47,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {6737#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6738#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:47,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {6738#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6738#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:47,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {6738#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6738#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:47,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {6738#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6739#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:47,534 INFO L273 TraceCheckUtils]: 27: Hoare triple {6739#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6739#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:47,534 INFO L273 TraceCheckUtils]: 28: Hoare triple {6739#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6739#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:47,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {6739#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6740#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:47,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {6740#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6740#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:47,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {6740#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6740#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:47,540 INFO L273 TraceCheckUtils]: 32: Hoare triple {6740#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6741#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:47,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {6741#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6741#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:47,543 INFO L273 TraceCheckUtils]: 34: Hoare triple {6741#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6741#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:47,545 INFO L273 TraceCheckUtils]: 35: Hoare triple {6741#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6742#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:47,545 INFO L273 TraceCheckUtils]: 36: Hoare triple {6742#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:47,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {6742#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6742#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:47,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {6742#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6743#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:47,550 INFO L273 TraceCheckUtils]: 39: Hoare triple {6743#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:47,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {6743#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6743#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:47,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {6743#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6744#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:47,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {6744#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:47,554 INFO L273 TraceCheckUtils]: 43: Hoare triple {6744#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6744#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:47,554 INFO L273 TraceCheckUtils]: 44: Hoare triple {6744#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6745#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:47,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {6745#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:47,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {6745#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6745#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:47,558 INFO L273 TraceCheckUtils]: 47: Hoare triple {6745#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6746#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:47,558 INFO L273 TraceCheckUtils]: 48: Hoare triple {6746#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:47,561 INFO L273 TraceCheckUtils]: 49: Hoare triple {6746#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6746#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:47,561 INFO L273 TraceCheckUtils]: 50: Hoare triple {6746#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6747#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:47,563 INFO L273 TraceCheckUtils]: 51: Hoare triple {6747#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:47,563 INFO L273 TraceCheckUtils]: 52: Hoare triple {6747#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6747#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:47,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {6747#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6748#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:47,566 INFO L273 TraceCheckUtils]: 54: Hoare triple {6748#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:47,568 INFO L273 TraceCheckUtils]: 55: Hoare triple {6748#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6748#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:47,568 INFO L273 TraceCheckUtils]: 56: Hoare triple {6748#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6749#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:47,570 INFO L273 TraceCheckUtils]: 57: Hoare triple {6749#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6731#false} is VALID [2018-11-23 12:05:47,570 INFO L273 TraceCheckUtils]: 58: Hoare triple {6731#false} havoc ~x~0;~x~0 := 0; {6731#false} is VALID [2018-11-23 12:05:47,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {6731#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6731#false} is VALID [2018-11-23 12:05:47,570 INFO L256 TraceCheckUtils]: 60: Hoare triple {6731#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6731#false} is VALID [2018-11-23 12:05:47,570 INFO L273 TraceCheckUtils]: 61: Hoare triple {6731#false} ~cond := #in~cond; {6731#false} is VALID [2018-11-23 12:05:47,570 INFO L273 TraceCheckUtils]: 62: Hoare triple {6731#false} assume 0 == ~cond; {6731#false} is VALID [2018-11-23 12:05:47,570 INFO L273 TraceCheckUtils]: 63: Hoare triple {6731#false} assume !false; {6731#false} is VALID [2018-11-23 12:05:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:47,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:47,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:47,583 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:05:47,878 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:05:47,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:47,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:48,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {6730#true} call ULTIMATE.init(); {6730#true} is VALID [2018-11-23 12:05:48,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {6730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6730#true} is VALID [2018-11-23 12:05:48,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {6730#true} assume true; {6730#true} is VALID [2018-11-23 12:05:48,160 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6730#true} {6730#true} #70#return; {6730#true} is VALID [2018-11-23 12:05:48,160 INFO L256 TraceCheckUtils]: 4: Hoare triple {6730#true} call #t~ret7 := main(); {6730#true} is VALID [2018-11-23 12:05:48,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {6730#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {6768#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:48,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {6768#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6768#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:48,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {6768#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6768#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:48,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {6768#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6733#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {6733#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6733#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {6733#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6733#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:48,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {6733#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6734#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {6734#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6734#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {6734#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6734#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:48,165 INFO L273 TraceCheckUtils]: 14: Hoare triple {6734#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6735#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {6735#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6735#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {6735#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6735#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:48,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {6735#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6736#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {6736#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6736#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {6736#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6736#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:48,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {6736#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6737#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {6737#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6737#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {6737#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6737#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:48,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {6737#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6738#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {6738#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6738#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {6738#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6738#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:48,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {6738#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6739#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,245 INFO L273 TraceCheckUtils]: 27: Hoare triple {6739#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6739#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {6739#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6739#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:48,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {6739#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6740#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {6740#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6740#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,248 INFO L273 TraceCheckUtils]: 31: Hoare triple {6740#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6740#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:48,251 INFO L273 TraceCheckUtils]: 32: Hoare triple {6740#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6741#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {6741#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6741#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {6741#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6741#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:48,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {6741#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6742#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {6742#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6742#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,253 INFO L273 TraceCheckUtils]: 37: Hoare triple {6742#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6742#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:48,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {6742#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6743#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {6743#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6743#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,255 INFO L273 TraceCheckUtils]: 40: Hoare triple {6743#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6743#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:48,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {6743#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6744#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {6744#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6744#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,257 INFO L273 TraceCheckUtils]: 43: Hoare triple {6744#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6744#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:48,258 INFO L273 TraceCheckUtils]: 44: Hoare triple {6744#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6745#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {6745#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6745#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,259 INFO L273 TraceCheckUtils]: 46: Hoare triple {6745#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6745#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:48,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {6745#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6746#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,260 INFO L273 TraceCheckUtils]: 48: Hoare triple {6746#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6746#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,261 INFO L273 TraceCheckUtils]: 49: Hoare triple {6746#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6746#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:48,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {6746#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6747#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,262 INFO L273 TraceCheckUtils]: 51: Hoare triple {6747#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6747#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,263 INFO L273 TraceCheckUtils]: 52: Hoare triple {6747#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6747#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:48,264 INFO L273 TraceCheckUtils]: 53: Hoare triple {6747#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6748#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,264 INFO L273 TraceCheckUtils]: 54: Hoare triple {6748#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6748#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,265 INFO L273 TraceCheckUtils]: 55: Hoare triple {6748#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6748#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:48,266 INFO L273 TraceCheckUtils]: 56: Hoare triple {6748#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6749#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:48,267 INFO L273 TraceCheckUtils]: 57: Hoare triple {6749#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6731#false} is VALID [2018-11-23 12:05:48,267 INFO L273 TraceCheckUtils]: 58: Hoare triple {6731#false} havoc ~x~0;~x~0 := 0; {6731#false} is VALID [2018-11-23 12:05:48,267 INFO L273 TraceCheckUtils]: 59: Hoare triple {6731#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {6731#false} is VALID [2018-11-23 12:05:48,267 INFO L256 TraceCheckUtils]: 60: Hoare triple {6731#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {6731#false} is VALID [2018-11-23 12:05:48,267 INFO L273 TraceCheckUtils]: 61: Hoare triple {6731#false} ~cond := #in~cond; {6731#false} is VALID [2018-11-23 12:05:48,268 INFO L273 TraceCheckUtils]: 62: Hoare triple {6731#false} assume 0 == ~cond; {6731#false} is VALID [2018-11-23 12:05:48,268 INFO L273 TraceCheckUtils]: 63: Hoare triple {6731#false} assume !false; {6731#false} is VALID [2018-11-23 12:05:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:48,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:48,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:05:48,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 12:05:48,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:48,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:05:48,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:48,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:05:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:05:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:48,374 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 21 states. [2018-11-23 12:05:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,018 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2018-11-23 12:05:49,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:05:49,019 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-23 12:05:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 120 transitions. [2018-11-23 12:05:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:05:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 120 transitions. [2018-11-23 12:05:49,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 120 transitions. [2018-11-23 12:05:49,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:49,165 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:05:49,165 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 12:05:49,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:05:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 12:05:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-23 12:05:49,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:49,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 77 states. [2018-11-23 12:05:49,196 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 77 states. [2018-11-23 12:05:49,196 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 77 states. [2018-11-23 12:05:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,199 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2018-11-23 12:05:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-11-23 12:05:49,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,199 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 79 states. [2018-11-23 12:05:49,200 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 79 states. [2018-11-23 12:05:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:49,201 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2018-11-23 12:05:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-11-23 12:05:49,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:49,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:49,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:49,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:05:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2018-11-23 12:05:49,203 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 64 [2018-11-23 12:05:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:49,204 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2018-11-23 12:05:49,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:05:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2018-11-23 12:05:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 12:05:49,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:49,205 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:49,205 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:49,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash 939529319, now seen corresponding path program 18 times [2018-11-23 12:05:49,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:49,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:49,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:49,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:50,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 12:05:50,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7333#true} is VALID [2018-11-23 12:05:50,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 12:05:50,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #70#return; {7333#true} is VALID [2018-11-23 12:05:50,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret7 := main(); {7333#true} is VALID [2018-11-23 12:05:50,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {7335#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {7335#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7335#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {7335#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7335#(= main_~i~0 0)} is VALID [2018-11-23 12:05:50,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {7335#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {7336#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {7336#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {7336#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {7337#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {7337#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {7337#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {7338#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {7338#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {7338#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {7339#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {7339#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,061 INFO L273 TraceCheckUtils]: 20: Hoare triple {7339#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,062 INFO L273 TraceCheckUtils]: 21: Hoare triple {7340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {7340#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,063 INFO L273 TraceCheckUtils]: 23: Hoare triple {7340#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {7341#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,064 INFO L273 TraceCheckUtils]: 25: Hoare triple {7341#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,065 INFO L273 TraceCheckUtils]: 26: Hoare triple {7341#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {7342#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,066 INFO L273 TraceCheckUtils]: 28: Hoare triple {7342#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {7342#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {7343#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {7343#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,069 INFO L273 TraceCheckUtils]: 32: Hoare triple {7343#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,070 INFO L273 TraceCheckUtils]: 33: Hoare triple {7344#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,071 INFO L273 TraceCheckUtils]: 34: Hoare triple {7344#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {7344#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {7345#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {7345#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,074 INFO L273 TraceCheckUtils]: 38: Hoare triple {7345#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7346#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {7346#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,075 INFO L273 TraceCheckUtils]: 40: Hoare triple {7346#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7346#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,076 INFO L273 TraceCheckUtils]: 41: Hoare triple {7346#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7347#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {7347#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {7347#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7347#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {7347#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7348#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {7348#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {7348#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7348#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,080 INFO L273 TraceCheckUtils]: 47: Hoare triple {7348#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7349#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,080 INFO L273 TraceCheckUtils]: 48: Hoare triple {7349#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,081 INFO L273 TraceCheckUtils]: 49: Hoare triple {7349#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7349#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,082 INFO L273 TraceCheckUtils]: 50: Hoare triple {7349#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7350#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,082 INFO L273 TraceCheckUtils]: 51: Hoare triple {7350#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {7350#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7350#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,084 INFO L273 TraceCheckUtils]: 53: Hoare triple {7350#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7351#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,084 INFO L273 TraceCheckUtils]: 54: Hoare triple {7351#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,085 INFO L273 TraceCheckUtils]: 55: Hoare triple {7351#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7351#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,086 INFO L273 TraceCheckUtils]: 56: Hoare triple {7351#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7352#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {7352#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,087 INFO L273 TraceCheckUtils]: 58: Hoare triple {7352#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7352#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,088 INFO L273 TraceCheckUtils]: 59: Hoare triple {7352#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7353#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:50,089 INFO L273 TraceCheckUtils]: 60: Hoare triple {7353#(<= main_~i~0 18)} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:05:50,089 INFO L273 TraceCheckUtils]: 61: Hoare triple {7334#false} havoc ~x~0;~x~0 := 0; {7334#false} is VALID [2018-11-23 12:05:50,089 INFO L273 TraceCheckUtils]: 62: Hoare triple {7334#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {7334#false} is VALID [2018-11-23 12:05:50,089 INFO L256 TraceCheckUtils]: 63: Hoare triple {7334#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7334#false} is VALID [2018-11-23 12:05:50,089 INFO L273 TraceCheckUtils]: 64: Hoare triple {7334#false} ~cond := #in~cond; {7334#false} is VALID [2018-11-23 12:05:50,090 INFO L273 TraceCheckUtils]: 65: Hoare triple {7334#false} assume 0 == ~cond; {7334#false} is VALID [2018-11-23 12:05:50,090 INFO L273 TraceCheckUtils]: 66: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 12:05:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:50,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:50,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:50,105 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:50,565 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:05:50,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:50,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:50,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {7333#true} call ULTIMATE.init(); {7333#true} is VALID [2018-11-23 12:05:50,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {7333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7333#true} is VALID [2018-11-23 12:05:50,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {7333#true} assume true; {7333#true} is VALID [2018-11-23 12:05:50,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7333#true} {7333#true} #70#return; {7333#true} is VALID [2018-11-23 12:05:50,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {7333#true} call #t~ret7 := main(); {7333#true} is VALID [2018-11-23 12:05:50,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {7333#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {7372#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:50,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {7372#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7372#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:50,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {7372#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7372#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:50,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {7372#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {7336#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {7336#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7336#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:50,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {7336#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {7337#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {7337#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7337#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:50,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {7337#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {7338#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {7338#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7338#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:50,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {7338#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {7339#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {7339#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7339#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:50,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {7339#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {7340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {7340#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7340#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:50,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {7340#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {7341#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {7341#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7341#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:50,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {7341#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,870 INFO L273 TraceCheckUtils]: 27: Hoare triple {7342#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,871 INFO L273 TraceCheckUtils]: 28: Hoare triple {7342#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7342#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:50,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {7342#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {7343#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {7343#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7343#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:50,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {7343#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {7344#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {7344#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7344#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:50,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {7344#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {7345#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {7345#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7345#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:50,878 INFO L273 TraceCheckUtils]: 38: Hoare triple {7345#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7346#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {7346#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7346#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {7346#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7346#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:50,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {7346#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7347#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,880 INFO L273 TraceCheckUtils]: 42: Hoare triple {7347#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7347#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,881 INFO L273 TraceCheckUtils]: 43: Hoare triple {7347#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7347#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:50,881 INFO L273 TraceCheckUtils]: 44: Hoare triple {7347#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7348#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {7348#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7348#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {7348#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7348#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:50,884 INFO L273 TraceCheckUtils]: 47: Hoare triple {7348#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7349#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,884 INFO L273 TraceCheckUtils]: 48: Hoare triple {7349#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7349#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {7349#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7349#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:50,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {7349#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7350#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {7350#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7350#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,887 INFO L273 TraceCheckUtils]: 52: Hoare triple {7350#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7350#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:50,887 INFO L273 TraceCheckUtils]: 53: Hoare triple {7350#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7351#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {7351#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7351#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,889 INFO L273 TraceCheckUtils]: 55: Hoare triple {7351#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7351#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:50,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {7351#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7352#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,890 INFO L273 TraceCheckUtils]: 57: Hoare triple {7352#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7352#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,891 INFO L273 TraceCheckUtils]: 58: Hoare triple {7352#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7352#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:50,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {7352#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7353#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:50,892 INFO L273 TraceCheckUtils]: 60: Hoare triple {7353#(<= main_~i~0 18)} assume !(~i~0 < 100000); {7334#false} is VALID [2018-11-23 12:05:50,893 INFO L273 TraceCheckUtils]: 61: Hoare triple {7334#false} havoc ~x~0;~x~0 := 0; {7334#false} is VALID [2018-11-23 12:05:50,893 INFO L273 TraceCheckUtils]: 62: Hoare triple {7334#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {7334#false} is VALID [2018-11-23 12:05:50,893 INFO L256 TraceCheckUtils]: 63: Hoare triple {7334#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7334#false} is VALID [2018-11-23 12:05:50,893 INFO L273 TraceCheckUtils]: 64: Hoare triple {7334#false} ~cond := #in~cond; {7334#false} is VALID [2018-11-23 12:05:50,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {7334#false} assume 0 == ~cond; {7334#false} is VALID [2018-11-23 12:05:50,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {7334#false} assume !false; {7334#false} is VALID [2018-11-23 12:05:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:50,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:50,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:05:50,917 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 12:05:50,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:50,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:05:51,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:51,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:05:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:05:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:51,001 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand 22 states. [2018-11-23 12:05:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:51,623 INFO L93 Difference]: Finished difference Result 98 states and 124 transitions. [2018-11-23 12:05:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:05:51,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-23 12:05:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 124 transitions. [2018-11-23 12:05:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:05:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 124 transitions. [2018-11-23 12:05:51,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 124 transitions. [2018-11-23 12:05:51,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:51,783 INFO L225 Difference]: With dead ends: 98 [2018-11-23 12:05:51,783 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:05:51,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:05:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:05:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-11-23 12:05:51,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:51,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 80 states. [2018-11-23 12:05:51,863 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 80 states. [2018-11-23 12:05:51,863 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 80 states. [2018-11-23 12:05:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:51,865 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-23 12:05:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2018-11-23 12:05:51,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:51,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:51,866 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 82 states. [2018-11-23 12:05:51,866 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 82 states. [2018-11-23 12:05:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:51,867 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-23 12:05:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2018-11-23 12:05:51,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:51,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:51,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:51,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:05:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2018-11-23 12:05:51,869 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 67 [2018-11-23 12:05:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:51,870 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2018-11-23 12:05:51,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:05:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2018-11-23 12:05:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:05:51,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:51,871 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:51,871 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:51,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:51,871 INFO L82 PathProgramCache]: Analyzing trace with hash 768422548, now seen corresponding path program 19 times [2018-11-23 12:05:51,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:51,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:51,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:51,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:51,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:52,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {7960#true} call ULTIMATE.init(); {7960#true} is VALID [2018-11-23 12:05:52,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {7960#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7960#true} is VALID [2018-11-23 12:05:52,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {7960#true} assume true; {7960#true} is VALID [2018-11-23 12:05:52,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7960#true} {7960#true} #70#return; {7960#true} is VALID [2018-11-23 12:05:52,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {7960#true} call #t~ret7 := main(); {7960#true} is VALID [2018-11-23 12:05:52,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {7960#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {7962#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {7962#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7962#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {7962#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7962#(= main_~i~0 0)} is VALID [2018-11-23 12:05:52,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {7962#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7963#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {7963#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {7963#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7963#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {7963#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7964#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {7964#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {7964#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7964#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {7964#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7965#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,397 INFO L273 TraceCheckUtils]: 15: Hoare triple {7965#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {7965#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7965#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {7965#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7966#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {7966#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {7966#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7966#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {7966#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7967#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {7967#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {7967#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7967#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {7967#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7968#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {7968#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {7968#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7968#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {7968#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7969#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,412 INFO L273 TraceCheckUtils]: 27: Hoare triple {7969#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {7969#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7969#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {7969#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7970#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {7970#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {7970#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7970#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {7970#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7971#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {7971#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {7971#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7971#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {7971#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7972#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,427 INFO L273 TraceCheckUtils]: 36: Hoare triple {7972#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,427 INFO L273 TraceCheckUtils]: 37: Hoare triple {7972#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7972#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {7972#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7973#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,429 INFO L273 TraceCheckUtils]: 39: Hoare triple {7973#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {7973#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7973#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {7973#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {7974#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {7974#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7974#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,435 INFO L273 TraceCheckUtils]: 44: Hoare triple {7974#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,435 INFO L273 TraceCheckUtils]: 45: Hoare triple {7975#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {7975#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7975#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,437 INFO L273 TraceCheckUtils]: 47: Hoare triple {7975#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7976#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,440 INFO L273 TraceCheckUtils]: 48: Hoare triple {7976#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,440 INFO L273 TraceCheckUtils]: 49: Hoare triple {7976#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7976#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,443 INFO L273 TraceCheckUtils]: 50: Hoare triple {7976#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7977#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,443 INFO L273 TraceCheckUtils]: 51: Hoare triple {7977#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7977#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,445 INFO L273 TraceCheckUtils]: 52: Hoare triple {7977#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7977#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,445 INFO L273 TraceCheckUtils]: 53: Hoare triple {7977#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7978#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {7978#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7978#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,448 INFO L273 TraceCheckUtils]: 55: Hoare triple {7978#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7978#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,451 INFO L273 TraceCheckUtils]: 56: Hoare triple {7978#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7979#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,451 INFO L273 TraceCheckUtils]: 57: Hoare triple {7979#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7979#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,454 INFO L273 TraceCheckUtils]: 58: Hoare triple {7979#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7979#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {7979#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7980#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,456 INFO L273 TraceCheckUtils]: 60: Hoare triple {7980#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7980#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,458 INFO L273 TraceCheckUtils]: 61: Hoare triple {7980#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7980#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,458 INFO L273 TraceCheckUtils]: 62: Hoare triple {7980#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7981#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:52,460 INFO L273 TraceCheckUtils]: 63: Hoare triple {7981#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7961#false} is VALID [2018-11-23 12:05:52,460 INFO L273 TraceCheckUtils]: 64: Hoare triple {7961#false} havoc ~x~0;~x~0 := 0; {7961#false} is VALID [2018-11-23 12:05:52,460 INFO L273 TraceCheckUtils]: 65: Hoare triple {7961#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {7961#false} is VALID [2018-11-23 12:05:52,460 INFO L256 TraceCheckUtils]: 66: Hoare triple {7961#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7961#false} is VALID [2018-11-23 12:05:52,460 INFO L273 TraceCheckUtils]: 67: Hoare triple {7961#false} ~cond := #in~cond; {7961#false} is VALID [2018-11-23 12:05:52,460 INFO L273 TraceCheckUtils]: 68: Hoare triple {7961#false} assume 0 == ~cond; {7961#false} is VALID [2018-11-23 12:05:52,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {7961#false} assume !false; {7961#false} is VALID [2018-11-23 12:05:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:52,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:52,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:52,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:52,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:52,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {7960#true} call ULTIMATE.init(); {7960#true} is VALID [2018-11-23 12:05:52,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {7960#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7960#true} is VALID [2018-11-23 12:05:52,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {7960#true} assume true; {7960#true} is VALID [2018-11-23 12:05:52,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7960#true} {7960#true} #70#return; {7960#true} is VALID [2018-11-23 12:05:52,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {7960#true} call #t~ret7 := main(); {7960#true} is VALID [2018-11-23 12:05:52,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {7960#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8000#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:52,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {8000#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8000#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:52,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {8000#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8000#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:52,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {8000#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7963#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {7963#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7963#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {7963#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7963#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:52,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {7963#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7964#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {7964#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7964#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {7964#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7964#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:52,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {7964#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7965#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {7965#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {7965#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7965#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:52,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {7965#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7966#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {7966#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7966#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {7966#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7966#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:52,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {7966#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7967#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {7967#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7967#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {7967#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7967#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:52,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {7967#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7968#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {7968#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7968#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {7968#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7968#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:52,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {7968#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7969#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {7969#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7969#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,899 INFO L273 TraceCheckUtils]: 28: Hoare triple {7969#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7969#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:52,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {7969#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7970#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {7970#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7970#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,901 INFO L273 TraceCheckUtils]: 31: Hoare triple {7970#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7970#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:52,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {7970#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7971#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {7971#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7971#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,903 INFO L273 TraceCheckUtils]: 34: Hoare triple {7971#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7971#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:52,904 INFO L273 TraceCheckUtils]: 35: Hoare triple {7971#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7972#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,905 INFO L273 TraceCheckUtils]: 36: Hoare triple {7972#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,905 INFO L273 TraceCheckUtils]: 37: Hoare triple {7972#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7972#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:52,906 INFO L273 TraceCheckUtils]: 38: Hoare triple {7972#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7973#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {7973#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7973#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {7973#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7973#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:52,908 INFO L273 TraceCheckUtils]: 41: Hoare triple {7973#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7974#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,909 INFO L273 TraceCheckUtils]: 42: Hoare triple {7974#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7974#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,909 INFO L273 TraceCheckUtils]: 43: Hoare triple {7974#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7974#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:52,910 INFO L273 TraceCheckUtils]: 44: Hoare triple {7974#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7975#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {7975#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7975#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,911 INFO L273 TraceCheckUtils]: 46: Hoare triple {7975#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7975#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:52,912 INFO L273 TraceCheckUtils]: 47: Hoare triple {7975#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7976#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,913 INFO L273 TraceCheckUtils]: 48: Hoare triple {7976#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7976#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,913 INFO L273 TraceCheckUtils]: 49: Hoare triple {7976#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7976#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:52,914 INFO L273 TraceCheckUtils]: 50: Hoare triple {7976#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7977#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,915 INFO L273 TraceCheckUtils]: 51: Hoare triple {7977#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7977#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,915 INFO L273 TraceCheckUtils]: 52: Hoare triple {7977#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7977#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:52,916 INFO L273 TraceCheckUtils]: 53: Hoare triple {7977#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7978#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,917 INFO L273 TraceCheckUtils]: 54: Hoare triple {7978#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7978#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,918 INFO L273 TraceCheckUtils]: 55: Hoare triple {7978#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7978#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:52,919 INFO L273 TraceCheckUtils]: 56: Hoare triple {7978#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7979#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,919 INFO L273 TraceCheckUtils]: 57: Hoare triple {7979#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7979#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,920 INFO L273 TraceCheckUtils]: 58: Hoare triple {7979#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7979#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:52,921 INFO L273 TraceCheckUtils]: 59: Hoare triple {7979#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7980#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,921 INFO L273 TraceCheckUtils]: 60: Hoare triple {7980#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7980#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,922 INFO L273 TraceCheckUtils]: 61: Hoare triple {7980#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {7980#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:52,923 INFO L273 TraceCheckUtils]: 62: Hoare triple {7980#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7981#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:52,924 INFO L273 TraceCheckUtils]: 63: Hoare triple {7981#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7961#false} is VALID [2018-11-23 12:05:52,924 INFO L273 TraceCheckUtils]: 64: Hoare triple {7961#false} havoc ~x~0;~x~0 := 0; {7961#false} is VALID [2018-11-23 12:05:52,924 INFO L273 TraceCheckUtils]: 65: Hoare triple {7961#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {7961#false} is VALID [2018-11-23 12:05:52,924 INFO L256 TraceCheckUtils]: 66: Hoare triple {7961#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {7961#false} is VALID [2018-11-23 12:05:52,924 INFO L273 TraceCheckUtils]: 67: Hoare triple {7961#false} ~cond := #in~cond; {7961#false} is VALID [2018-11-23 12:05:52,925 INFO L273 TraceCheckUtils]: 68: Hoare triple {7961#false} assume 0 == ~cond; {7961#false} is VALID [2018-11-23 12:05:52,925 INFO L273 TraceCheckUtils]: 69: Hoare triple {7961#false} assume !false; {7961#false} is VALID [2018-11-23 12:05:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:52,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:52,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:05:52,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 12:05:52,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:52,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:05:53,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:53,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:05:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:05:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:53,059 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand 23 states. [2018-11-23 12:05:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:53,692 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2018-11-23 12:05:53,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:05:53,693 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-23 12:05:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2018-11-23 12:05:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:05:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2018-11-23 12:05:53,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 128 transitions. [2018-11-23 12:05:53,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:53,843 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:05:53,843 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 12:05:53,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:05:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 12:05:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-23 12:05:53,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:53,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 83 states. [2018-11-23 12:05:53,871 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 83 states. [2018-11-23 12:05:53,871 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 83 states. [2018-11-23 12:05:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:53,873 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2018-11-23 12:05:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-23 12:05:53,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:53,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:53,874 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 85 states. [2018-11-23 12:05:53,874 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 85 states. [2018-11-23 12:05:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:53,875 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2018-11-23 12:05:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-23 12:05:53,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:53,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:53,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:53,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:05:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2018-11-23 12:05:53,877 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 70 [2018-11-23 12:05:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:53,877 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2018-11-23 12:05:53,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:05:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 12:05:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:05:53,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:53,878 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:53,878 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:53,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:53,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1452788039, now seen corresponding path program 20 times [2018-11-23 12:05:53,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:53,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:53,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:53,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:53,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:54,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {8611#true} call ULTIMATE.init(); {8611#true} is VALID [2018-11-23 12:05:54,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {8611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8611#true} is VALID [2018-11-23 12:05:54,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {8611#true} assume true; {8611#true} is VALID [2018-11-23 12:05:54,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8611#true} {8611#true} #70#return; {8611#true} is VALID [2018-11-23 12:05:54,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {8611#true} call #t~ret7 := main(); {8611#true} is VALID [2018-11-23 12:05:54,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {8611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8613#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {8613#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8613#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,456 INFO L273 TraceCheckUtils]: 7: Hoare triple {8613#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8613#(= main_~i~0 0)} is VALID [2018-11-23 12:05:54,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {8613#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {8614#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {8614#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8614#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {8614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8615#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {8615#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {8615#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8615#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {8615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8616#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {8616#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {8616#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8616#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {8616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8617#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {8617#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {8617#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8617#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {8617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8618#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {8618#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {8618#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8618#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {8618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8619#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {8619#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {8619#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8619#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {8619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8620#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {8620#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {8620#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8620#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {8620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8621#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {8621#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {8621#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8621#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {8621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8622#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {8622#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8622#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {8622#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8622#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {8622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8623#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {8623#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8623#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {8623#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8623#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {8623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8624#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,488 INFO L273 TraceCheckUtils]: 39: Hoare triple {8624#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8624#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {8624#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8624#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {8624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8625#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {8625#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8625#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,491 INFO L273 TraceCheckUtils]: 43: Hoare triple {8625#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8625#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,492 INFO L273 TraceCheckUtils]: 44: Hoare triple {8625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8626#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,492 INFO L273 TraceCheckUtils]: 45: Hoare triple {8626#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8626#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,493 INFO L273 TraceCheckUtils]: 46: Hoare triple {8626#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8626#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,494 INFO L273 TraceCheckUtils]: 47: Hoare triple {8626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8627#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,494 INFO L273 TraceCheckUtils]: 48: Hoare triple {8627#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8627#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,495 INFO L273 TraceCheckUtils]: 49: Hoare triple {8627#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8627#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,496 INFO L273 TraceCheckUtils]: 50: Hoare triple {8627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8628#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,496 INFO L273 TraceCheckUtils]: 51: Hoare triple {8628#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8628#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,497 INFO L273 TraceCheckUtils]: 52: Hoare triple {8628#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8628#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,498 INFO L273 TraceCheckUtils]: 53: Hoare triple {8628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8629#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,498 INFO L273 TraceCheckUtils]: 54: Hoare triple {8629#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8629#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,499 INFO L273 TraceCheckUtils]: 55: Hoare triple {8629#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8629#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,500 INFO L273 TraceCheckUtils]: 56: Hoare triple {8629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8630#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,500 INFO L273 TraceCheckUtils]: 57: Hoare triple {8630#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8630#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,501 INFO L273 TraceCheckUtils]: 58: Hoare triple {8630#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8630#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,502 INFO L273 TraceCheckUtils]: 59: Hoare triple {8630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8631#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,502 INFO L273 TraceCheckUtils]: 60: Hoare triple {8631#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8631#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,503 INFO L273 TraceCheckUtils]: 61: Hoare triple {8631#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8631#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,504 INFO L273 TraceCheckUtils]: 62: Hoare triple {8631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8632#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,504 INFO L273 TraceCheckUtils]: 63: Hoare triple {8632#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8632#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,505 INFO L273 TraceCheckUtils]: 64: Hoare triple {8632#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8632#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,506 INFO L273 TraceCheckUtils]: 65: Hoare triple {8632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8633#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:54,507 INFO L273 TraceCheckUtils]: 66: Hoare triple {8633#(<= main_~i~0 20)} assume !(~i~0 < 100000); {8612#false} is VALID [2018-11-23 12:05:54,507 INFO L273 TraceCheckUtils]: 67: Hoare triple {8612#false} havoc ~x~0;~x~0 := 0; {8612#false} is VALID [2018-11-23 12:05:54,507 INFO L273 TraceCheckUtils]: 68: Hoare triple {8612#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {8612#false} is VALID [2018-11-23 12:05:54,507 INFO L256 TraceCheckUtils]: 69: Hoare triple {8612#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8612#false} is VALID [2018-11-23 12:05:54,507 INFO L273 TraceCheckUtils]: 70: Hoare triple {8612#false} ~cond := #in~cond; {8612#false} is VALID [2018-11-23 12:05:54,508 INFO L273 TraceCheckUtils]: 71: Hoare triple {8612#false} assume 0 == ~cond; {8612#false} is VALID [2018-11-23 12:05:54,508 INFO L273 TraceCheckUtils]: 72: Hoare triple {8612#false} assume !false; {8612#false} is VALID [2018-11-23 12:05:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:54,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:54,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:54,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:54,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:54,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:54,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:54,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {8611#true} call ULTIMATE.init(); {8611#true} is VALID [2018-11-23 12:05:54,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {8611#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8611#true} is VALID [2018-11-23 12:05:54,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {8611#true} assume true; {8611#true} is VALID [2018-11-23 12:05:54,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8611#true} {8611#true} #70#return; {8611#true} is VALID [2018-11-23 12:05:54,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {8611#true} call #t~ret7 := main(); {8611#true} is VALID [2018-11-23 12:05:54,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {8611#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {8652#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:54,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {8652#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8652#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:54,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {8652#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8652#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:54,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {8652#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8614#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {8614#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8614#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {8614#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8614#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:54,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {8614#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8615#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {8615#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8615#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {8615#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8615#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:54,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {8615#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8616#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {8616#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8616#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {8616#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8616#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:54,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {8616#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8617#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {8617#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8617#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {8617#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8617#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:54,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {8617#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8618#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {8618#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8618#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {8618#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8618#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:54,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {8618#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8619#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {8619#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8619#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {8619#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8619#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:54,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {8619#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8620#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,834 INFO L273 TraceCheckUtils]: 27: Hoare triple {8620#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8620#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {8620#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8620#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:54,836 INFO L273 TraceCheckUtils]: 29: Hoare triple {8620#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8621#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {8621#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8621#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,837 INFO L273 TraceCheckUtils]: 31: Hoare triple {8621#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8621#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:54,838 INFO L273 TraceCheckUtils]: 32: Hoare triple {8621#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8622#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,838 INFO L273 TraceCheckUtils]: 33: Hoare triple {8622#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8622#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,839 INFO L273 TraceCheckUtils]: 34: Hoare triple {8622#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8622#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:54,840 INFO L273 TraceCheckUtils]: 35: Hoare triple {8622#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8623#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {8623#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8623#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {8623#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8623#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:54,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {8623#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8624#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {8624#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8624#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,843 INFO L273 TraceCheckUtils]: 40: Hoare triple {8624#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8624#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:54,844 INFO L273 TraceCheckUtils]: 41: Hoare triple {8624#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8625#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,845 INFO L273 TraceCheckUtils]: 42: Hoare triple {8625#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8625#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,845 INFO L273 TraceCheckUtils]: 43: Hoare triple {8625#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8625#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:54,846 INFO L273 TraceCheckUtils]: 44: Hoare triple {8625#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8626#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {8626#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8626#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {8626#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8626#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:54,848 INFO L273 TraceCheckUtils]: 47: Hoare triple {8626#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8627#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {8627#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8627#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,849 INFO L273 TraceCheckUtils]: 49: Hoare triple {8627#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8627#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:54,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {8627#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8628#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {8628#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8628#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {8628#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8628#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:54,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {8628#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8629#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,853 INFO L273 TraceCheckUtils]: 54: Hoare triple {8629#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8629#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {8629#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8629#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:54,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {8629#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8630#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {8630#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8630#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,856 INFO L273 TraceCheckUtils]: 58: Hoare triple {8630#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8630#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:54,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {8630#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8631#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,857 INFO L273 TraceCheckUtils]: 60: Hoare triple {8631#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8631#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,858 INFO L273 TraceCheckUtils]: 61: Hoare triple {8631#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8631#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:54,859 INFO L273 TraceCheckUtils]: 62: Hoare triple {8631#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8632#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,859 INFO L273 TraceCheckUtils]: 63: Hoare triple {8632#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8632#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,860 INFO L273 TraceCheckUtils]: 64: Hoare triple {8632#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {8632#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:54,861 INFO L273 TraceCheckUtils]: 65: Hoare triple {8632#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8633#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:54,861 INFO L273 TraceCheckUtils]: 66: Hoare triple {8633#(<= main_~i~0 20)} assume !(~i~0 < 100000); {8612#false} is VALID [2018-11-23 12:05:54,861 INFO L273 TraceCheckUtils]: 67: Hoare triple {8612#false} havoc ~x~0;~x~0 := 0; {8612#false} is VALID [2018-11-23 12:05:54,862 INFO L273 TraceCheckUtils]: 68: Hoare triple {8612#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {8612#false} is VALID [2018-11-23 12:05:54,862 INFO L256 TraceCheckUtils]: 69: Hoare triple {8612#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {8612#false} is VALID [2018-11-23 12:05:54,862 INFO L273 TraceCheckUtils]: 70: Hoare triple {8612#false} ~cond := #in~cond; {8612#false} is VALID [2018-11-23 12:05:54,862 INFO L273 TraceCheckUtils]: 71: Hoare triple {8612#false} assume 0 == ~cond; {8612#false} is VALID [2018-11-23 12:05:54,862 INFO L273 TraceCheckUtils]: 72: Hoare triple {8612#false} assume !false; {8612#false} is VALID [2018-11-23 12:05:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:54,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:54,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:05:54,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 12:05:54,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:54,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:05:54,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:54,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:05:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:05:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:54,980 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand 24 states. [2018-11-23 12:05:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,770 INFO L93 Difference]: Finished difference Result 104 states and 132 transitions. [2018-11-23 12:05:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:05:55,770 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-23 12:05:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2018-11-23 12:05:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:05:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 132 transitions. [2018-11-23 12:05:55,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 132 transitions. [2018-11-23 12:05:55,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:55,927 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:05:55,928 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:05:55,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:05:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:05:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-23 12:05:55,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:55,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2018-11-23 12:05:55,962 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2018-11-23 12:05:55,962 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2018-11-23 12:05:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,964 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2018-11-23 12:05:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2018-11-23 12:05:55,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:55,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:55,966 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2018-11-23 12:05:55,966 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2018-11-23 12:05:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:55,967 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2018-11-23 12:05:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2018-11-23 12:05:55,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:55,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:55,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:55,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:05:55,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-11-23 12:05:55,970 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 73 [2018-11-23 12:05:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:55,970 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-11-23 12:05:55,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:05:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 12:05:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:05:55,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:55,971 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:55,971 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:55,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:55,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1175376308, now seen corresponding path program 21 times [2018-11-23 12:05:55,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:55,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:55,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:56,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {9286#true} call ULTIMATE.init(); {9286#true} is VALID [2018-11-23 12:05:56,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {9286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9286#true} is VALID [2018-11-23 12:05:56,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {9286#true} assume true; {9286#true} is VALID [2018-11-23 12:05:56,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9286#true} {9286#true} #70#return; {9286#true} is VALID [2018-11-23 12:05:56,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {9286#true} call #t~ret7 := main(); {9286#true} is VALID [2018-11-23 12:05:56,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {9286#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {9288#(= main_~i~0 0)} is VALID [2018-11-23 12:05:56,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {9288#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9288#(= main_~i~0 0)} is VALID [2018-11-23 12:05:56,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {9288#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9288#(= main_~i~0 0)} is VALID [2018-11-23 12:05:56,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {9288#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9289#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {9289#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {9289#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9289#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:56,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {9289#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9290#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {9290#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {9290#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9290#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:56,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {9290#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9291#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {9291#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9291#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {9291#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9291#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:56,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {9291#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9292#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {9292#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9292#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {9292#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9292#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:56,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {9292#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9293#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:56,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {9293#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9293#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:56,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {9293#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9293#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:56,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {9293#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9294#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:56,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {9294#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9294#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:56,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {9294#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9294#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:56,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {9294#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9295#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:56,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {9295#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9295#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:56,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {9295#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9295#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:56,587 INFO L273 TraceCheckUtils]: 29: Hoare triple {9295#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9296#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:56,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {9296#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9296#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:56,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {9296#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9296#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:56,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {9296#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9297#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:56,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {9297#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9297#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:56,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {9297#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9297#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:56,591 INFO L273 TraceCheckUtils]: 35: Hoare triple {9297#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9298#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:56,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {9298#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9298#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:56,593 INFO L273 TraceCheckUtils]: 37: Hoare triple {9298#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9298#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:56,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {9298#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9299#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:56,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {9299#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9299#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:56,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {9299#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9299#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:56,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {9299#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9300#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:56,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {9300#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9300#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:56,597 INFO L273 TraceCheckUtils]: 43: Hoare triple {9300#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9300#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:56,597 INFO L273 TraceCheckUtils]: 44: Hoare triple {9300#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9301#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:56,598 INFO L273 TraceCheckUtils]: 45: Hoare triple {9301#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9301#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:56,599 INFO L273 TraceCheckUtils]: 46: Hoare triple {9301#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9301#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:56,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {9301#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9302#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:56,600 INFO L273 TraceCheckUtils]: 48: Hoare triple {9302#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9302#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:56,601 INFO L273 TraceCheckUtils]: 49: Hoare triple {9302#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9302#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:56,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {9302#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9303#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:56,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {9303#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9303#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:56,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {9303#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9303#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:56,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {9303#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9304#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:56,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {9304#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9304#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:56,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {9304#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9304#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:56,606 INFO L273 TraceCheckUtils]: 56: Hoare triple {9304#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9305#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:56,606 INFO L273 TraceCheckUtils]: 57: Hoare triple {9305#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9305#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:56,607 INFO L273 TraceCheckUtils]: 58: Hoare triple {9305#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9305#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:56,608 INFO L273 TraceCheckUtils]: 59: Hoare triple {9305#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9306#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:56,608 INFO L273 TraceCheckUtils]: 60: Hoare triple {9306#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9306#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:56,609 INFO L273 TraceCheckUtils]: 61: Hoare triple {9306#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9306#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:56,610 INFO L273 TraceCheckUtils]: 62: Hoare triple {9306#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9307#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:56,610 INFO L273 TraceCheckUtils]: 63: Hoare triple {9307#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9307#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:56,611 INFO L273 TraceCheckUtils]: 64: Hoare triple {9307#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9307#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:56,612 INFO L273 TraceCheckUtils]: 65: Hoare triple {9307#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9308#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:56,612 INFO L273 TraceCheckUtils]: 66: Hoare triple {9308#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9308#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:56,613 INFO L273 TraceCheckUtils]: 67: Hoare triple {9308#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9308#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:56,614 INFO L273 TraceCheckUtils]: 68: Hoare triple {9308#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9309#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:56,615 INFO L273 TraceCheckUtils]: 69: Hoare triple {9309#(<= main_~i~0 21)} assume !(~i~0 < 100000); {9287#false} is VALID [2018-11-23 12:05:56,615 INFO L273 TraceCheckUtils]: 70: Hoare triple {9287#false} havoc ~x~0;~x~0 := 0; {9287#false} is VALID [2018-11-23 12:05:56,615 INFO L273 TraceCheckUtils]: 71: Hoare triple {9287#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {9287#false} is VALID [2018-11-23 12:05:56,615 INFO L256 TraceCheckUtils]: 72: Hoare triple {9287#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9287#false} is VALID [2018-11-23 12:05:56,615 INFO L273 TraceCheckUtils]: 73: Hoare triple {9287#false} ~cond := #in~cond; {9287#false} is VALID [2018-11-23 12:05:56,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {9287#false} assume 0 == ~cond; {9287#false} is VALID [2018-11-23 12:05:56,616 INFO L273 TraceCheckUtils]: 75: Hoare triple {9287#false} assume !false; {9287#false} is VALID [2018-11-23 12:05:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:56,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:56,621 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 12:05:56,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:05:57,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 12:05:57,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:57,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:57,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {9286#true} call ULTIMATE.init(); {9286#true} is VALID [2018-11-23 12:05:57,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {9286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9286#true} is VALID [2018-11-23 12:05:57,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {9286#true} assume true; {9286#true} is VALID [2018-11-23 12:05:57,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9286#true} {9286#true} #70#return; {9286#true} is VALID [2018-11-23 12:05:57,499 INFO L256 TraceCheckUtils]: 4: Hoare triple {9286#true} call #t~ret7 := main(); {9286#true} is VALID [2018-11-23 12:05:57,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {9286#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {9328#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:57,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {9328#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9328#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:57,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {9328#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9328#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:57,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {9328#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9289#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {9289#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9289#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {9289#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9289#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:57,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {9289#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9290#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {9290#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9290#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {9290#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9290#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:57,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {9290#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9291#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {9291#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9291#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {9291#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9291#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:57,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {9291#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9292#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {9292#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9292#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,518 INFO L273 TraceCheckUtils]: 19: Hoare triple {9292#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9292#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:57,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {9292#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9293#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {9293#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9293#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {9293#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9293#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:57,524 INFO L273 TraceCheckUtils]: 23: Hoare triple {9293#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9294#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:57,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {9294#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9294#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:57,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {9294#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9294#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:57,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {9294#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9295#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:57,527 INFO L273 TraceCheckUtils]: 27: Hoare triple {9295#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9295#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:57,527 INFO L273 TraceCheckUtils]: 28: Hoare triple {9295#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9295#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:57,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {9295#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9296#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:57,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {9296#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9296#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:57,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {9296#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9296#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:57,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {9296#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9297#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:57,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {9297#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9297#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:57,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {9297#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9297#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:57,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {9297#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9298#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:57,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {9298#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9298#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:57,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {9298#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9298#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:57,538 INFO L273 TraceCheckUtils]: 38: Hoare triple {9298#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9299#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:57,540 INFO L273 TraceCheckUtils]: 39: Hoare triple {9299#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9299#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:57,540 INFO L273 TraceCheckUtils]: 40: Hoare triple {9299#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9299#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:57,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {9299#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9300#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:57,541 INFO L273 TraceCheckUtils]: 42: Hoare triple {9300#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9300#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:57,542 INFO L273 TraceCheckUtils]: 43: Hoare triple {9300#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9300#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:57,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {9300#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9301#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:57,543 INFO L273 TraceCheckUtils]: 45: Hoare triple {9301#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9301#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:57,543 INFO L273 TraceCheckUtils]: 46: Hoare triple {9301#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9301#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:57,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {9301#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9302#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:57,544 INFO L273 TraceCheckUtils]: 48: Hoare triple {9302#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9302#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:57,546 INFO L273 TraceCheckUtils]: 49: Hoare triple {9302#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9302#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:57,547 INFO L273 TraceCheckUtils]: 50: Hoare triple {9302#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9303#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:57,548 INFO L273 TraceCheckUtils]: 51: Hoare triple {9303#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9303#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:57,548 INFO L273 TraceCheckUtils]: 52: Hoare triple {9303#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9303#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:57,550 INFO L273 TraceCheckUtils]: 53: Hoare triple {9303#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9304#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:57,550 INFO L273 TraceCheckUtils]: 54: Hoare triple {9304#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9304#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:57,552 INFO L273 TraceCheckUtils]: 55: Hoare triple {9304#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9304#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:57,553 INFO L273 TraceCheckUtils]: 56: Hoare triple {9304#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9305#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:57,554 INFO L273 TraceCheckUtils]: 57: Hoare triple {9305#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9305#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:57,554 INFO L273 TraceCheckUtils]: 58: Hoare triple {9305#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9305#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:57,556 INFO L273 TraceCheckUtils]: 59: Hoare triple {9305#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9306#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:57,556 INFO L273 TraceCheckUtils]: 60: Hoare triple {9306#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9306#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:57,558 INFO L273 TraceCheckUtils]: 61: Hoare triple {9306#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9306#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:57,558 INFO L273 TraceCheckUtils]: 62: Hoare triple {9306#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9307#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:57,560 INFO L273 TraceCheckUtils]: 63: Hoare triple {9307#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9307#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:57,560 INFO L273 TraceCheckUtils]: 64: Hoare triple {9307#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9307#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:57,562 INFO L273 TraceCheckUtils]: 65: Hoare triple {9307#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9308#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:57,562 INFO L273 TraceCheckUtils]: 66: Hoare triple {9308#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9308#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:57,564 INFO L273 TraceCheckUtils]: 67: Hoare triple {9308#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9308#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:57,565 INFO L273 TraceCheckUtils]: 68: Hoare triple {9308#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9309#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:57,566 INFO L273 TraceCheckUtils]: 69: Hoare triple {9309#(<= main_~i~0 21)} assume !(~i~0 < 100000); {9287#false} is VALID [2018-11-23 12:05:57,566 INFO L273 TraceCheckUtils]: 70: Hoare triple {9287#false} havoc ~x~0;~x~0 := 0; {9287#false} is VALID [2018-11-23 12:05:57,566 INFO L273 TraceCheckUtils]: 71: Hoare triple {9287#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {9287#false} is VALID [2018-11-23 12:05:57,566 INFO L256 TraceCheckUtils]: 72: Hoare triple {9287#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9287#false} is VALID [2018-11-23 12:05:57,567 INFO L273 TraceCheckUtils]: 73: Hoare triple {9287#false} ~cond := #in~cond; {9287#false} is VALID [2018-11-23 12:05:57,567 INFO L273 TraceCheckUtils]: 74: Hoare triple {9287#false} assume 0 == ~cond; {9287#false} is VALID [2018-11-23 12:05:57,567 INFO L273 TraceCheckUtils]: 75: Hoare triple {9287#false} assume !false; {9287#false} is VALID [2018-11-23 12:05:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:57,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:57,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:05:57,593 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 12:05:57,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:57,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:05:57,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:57,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:05:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:05:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:57,717 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 25 states. [2018-11-23 12:05:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:58,734 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2018-11-23 12:05:58,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:05:58,735 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-23 12:05:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 136 transitions. [2018-11-23 12:05:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:05:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 136 transitions. [2018-11-23 12:05:58,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 136 transitions. [2018-11-23 12:05:58,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:58,888 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:05:58,889 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:05:58,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:05:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:05:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-23 12:05:58,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:58,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-23 12:05:58,922 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-23 12:05:58,922 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-23 12:05:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:58,924 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2018-11-23 12:05:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-11-23 12:05:58,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:58,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:58,925 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-23 12:05:58,925 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-23 12:05:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:58,927 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2018-11-23 12:05:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-11-23 12:05:58,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:58,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:58,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:58,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:05:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2018-11-23 12:05:58,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 76 [2018-11-23 12:05:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:58,929 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2018-11-23 12:05:58,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:05:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-23 12:05:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:05:58,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:58,930 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:58,931 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:58,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:58,931 INFO L82 PathProgramCache]: Analyzing trace with hash 319575591, now seen corresponding path program 22 times [2018-11-23 12:05:58,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:58,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:58,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:59,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {9985#true} call ULTIMATE.init(); {9985#true} is VALID [2018-11-23 12:05:59,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {9985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9985#true} is VALID [2018-11-23 12:05:59,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {9985#true} assume true; {9985#true} is VALID [2018-11-23 12:05:59,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9985#true} {9985#true} #70#return; {9985#true} is VALID [2018-11-23 12:05:59,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {9985#true} call #t~ret7 := main(); {9985#true} is VALID [2018-11-23 12:05:59,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {9985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {9987#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {9987#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9987#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {9987#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9987#(= main_~i~0 0)} is VALID [2018-11-23 12:05:59,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {9987#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9988#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {9988#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9988#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {9988#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9988#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:59,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {9988#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9989#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {9989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9989#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {9989#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9989#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:59,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {9989#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9990#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {9990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9990#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {9990#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9990#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:59,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {9990#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9991#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {9991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9991#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {9991#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9991#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:59,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {9991#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9992#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {9992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9992#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {9992#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9992#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:59,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {9992#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9993#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {9993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9993#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {9993#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9993#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:59,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {9993#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9994#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {9994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9994#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,637 INFO L273 TraceCheckUtils]: 28: Hoare triple {9994#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9994#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:59,638 INFO L273 TraceCheckUtils]: 29: Hoare triple {9994#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9995#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,638 INFO L273 TraceCheckUtils]: 30: Hoare triple {9995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9995#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,639 INFO L273 TraceCheckUtils]: 31: Hoare triple {9995#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9995#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:59,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {9995#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9996#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {9996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9996#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {9996#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9996#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:59,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {9996#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9997#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {9997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9997#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {9997#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9997#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:59,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {9997#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9998#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {9998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9998#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {9998#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9998#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:59,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {9998#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9999#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {9999#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9999#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,647 INFO L273 TraceCheckUtils]: 43: Hoare triple {9999#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9999#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:59,648 INFO L273 TraceCheckUtils]: 44: Hoare triple {9999#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10000#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,649 INFO L273 TraceCheckUtils]: 45: Hoare triple {10000#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10000#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,649 INFO L273 TraceCheckUtils]: 46: Hoare triple {10000#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10000#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:59,650 INFO L273 TraceCheckUtils]: 47: Hoare triple {10000#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10001#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,651 INFO L273 TraceCheckUtils]: 48: Hoare triple {10001#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10001#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,652 INFO L273 TraceCheckUtils]: 49: Hoare triple {10001#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10001#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:59,652 INFO L273 TraceCheckUtils]: 50: Hoare triple {10001#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10002#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,653 INFO L273 TraceCheckUtils]: 51: Hoare triple {10002#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10002#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,654 INFO L273 TraceCheckUtils]: 52: Hoare triple {10002#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10002#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:59,654 INFO L273 TraceCheckUtils]: 53: Hoare triple {10002#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10003#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,655 INFO L273 TraceCheckUtils]: 54: Hoare triple {10003#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10003#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {10003#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10003#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:59,657 INFO L273 TraceCheckUtils]: 56: Hoare triple {10003#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10004#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,657 INFO L273 TraceCheckUtils]: 57: Hoare triple {10004#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10004#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,658 INFO L273 TraceCheckUtils]: 58: Hoare triple {10004#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10004#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:59,659 INFO L273 TraceCheckUtils]: 59: Hoare triple {10004#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10005#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,659 INFO L273 TraceCheckUtils]: 60: Hoare triple {10005#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10005#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,660 INFO L273 TraceCheckUtils]: 61: Hoare triple {10005#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10005#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:59,661 INFO L273 TraceCheckUtils]: 62: Hoare triple {10005#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10006#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,661 INFO L273 TraceCheckUtils]: 63: Hoare triple {10006#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10006#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,662 INFO L273 TraceCheckUtils]: 64: Hoare triple {10006#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10006#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:59,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {10006#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10007#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,663 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10007#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,664 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10007#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:59,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10008#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,666 INFO L273 TraceCheckUtils]: 69: Hoare triple {10008#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10008#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,666 INFO L273 TraceCheckUtils]: 70: Hoare triple {10008#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10008#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:59,667 INFO L273 TraceCheckUtils]: 71: Hoare triple {10008#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10009#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:59,668 INFO L273 TraceCheckUtils]: 72: Hoare triple {10009#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9986#false} is VALID [2018-11-23 12:05:59,668 INFO L273 TraceCheckUtils]: 73: Hoare triple {9986#false} havoc ~x~0;~x~0 := 0; {9986#false} is VALID [2018-11-23 12:05:59,668 INFO L273 TraceCheckUtils]: 74: Hoare triple {9986#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {9986#false} is VALID [2018-11-23 12:05:59,668 INFO L256 TraceCheckUtils]: 75: Hoare triple {9986#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9986#false} is VALID [2018-11-23 12:05:59,669 INFO L273 TraceCheckUtils]: 76: Hoare triple {9986#false} ~cond := #in~cond; {9986#false} is VALID [2018-11-23 12:05:59,669 INFO L273 TraceCheckUtils]: 77: Hoare triple {9986#false} assume 0 == ~cond; {9986#false} is VALID [2018-11-23 12:05:59,669 INFO L273 TraceCheckUtils]: 78: Hoare triple {9986#false} assume !false; {9986#false} is VALID [2018-11-23 12:05:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:59,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:59,675 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 12:05:59,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:05:59,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:05:59,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:59,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:00,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {9985#true} call ULTIMATE.init(); {9985#true} is VALID [2018-11-23 12:06:00,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {9985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9985#true} is VALID [2018-11-23 12:06:00,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {9985#true} assume true; {9985#true} is VALID [2018-11-23 12:06:00,271 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9985#true} {9985#true} #70#return; {9985#true} is VALID [2018-11-23 12:06:00,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {9985#true} call #t~ret7 := main(); {9985#true} is VALID [2018-11-23 12:06:00,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {9985#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {10028#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:00,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {10028#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10028#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:00,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {10028#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10028#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:00,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {10028#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9988#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:00,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {9988#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9988#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:00,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {9988#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9988#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:00,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {9988#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9989#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:00,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {9989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9989#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:00,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {9989#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9989#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:00,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {9989#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9990#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:00,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {9990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9990#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:00,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {9990#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9990#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:00,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {9990#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9991#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:00,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {9991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9991#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:00,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {9991#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9991#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:00,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {9991#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9992#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:00,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {9992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9992#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:00,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {9992#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9992#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:00,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {9992#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9993#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:00,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {9993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9993#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:00,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {9993#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9993#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:00,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {9993#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9994#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:00,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {9994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9994#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:00,286 INFO L273 TraceCheckUtils]: 28: Hoare triple {9994#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9994#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:00,287 INFO L273 TraceCheckUtils]: 29: Hoare triple {9994#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9995#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:00,288 INFO L273 TraceCheckUtils]: 30: Hoare triple {9995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9995#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:00,288 INFO L273 TraceCheckUtils]: 31: Hoare triple {9995#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9995#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:00,289 INFO L273 TraceCheckUtils]: 32: Hoare triple {9995#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9996#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:00,290 INFO L273 TraceCheckUtils]: 33: Hoare triple {9996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9996#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:00,290 INFO L273 TraceCheckUtils]: 34: Hoare triple {9996#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9996#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:00,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {9996#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9997#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:00,292 INFO L273 TraceCheckUtils]: 36: Hoare triple {9997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9997#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:00,292 INFO L273 TraceCheckUtils]: 37: Hoare triple {9997#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9997#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:00,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {9997#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9998#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:00,294 INFO L273 TraceCheckUtils]: 39: Hoare triple {9998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9998#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:00,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {9998#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9998#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:00,295 INFO L273 TraceCheckUtils]: 41: Hoare triple {9998#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9999#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:00,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {9999#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9999#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:00,296 INFO L273 TraceCheckUtils]: 43: Hoare triple {9999#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {9999#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:00,297 INFO L273 TraceCheckUtils]: 44: Hoare triple {9999#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10000#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:00,298 INFO L273 TraceCheckUtils]: 45: Hoare triple {10000#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10000#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:00,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {10000#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10000#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:00,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {10000#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10001#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:00,300 INFO L273 TraceCheckUtils]: 48: Hoare triple {10001#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10001#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:00,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {10001#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10001#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:00,301 INFO L273 TraceCheckUtils]: 50: Hoare triple {10001#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10002#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:00,302 INFO L273 TraceCheckUtils]: 51: Hoare triple {10002#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10002#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:00,303 INFO L273 TraceCheckUtils]: 52: Hoare triple {10002#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10002#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:00,304 INFO L273 TraceCheckUtils]: 53: Hoare triple {10002#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10003#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:00,304 INFO L273 TraceCheckUtils]: 54: Hoare triple {10003#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10003#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:00,305 INFO L273 TraceCheckUtils]: 55: Hoare triple {10003#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10003#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:00,306 INFO L273 TraceCheckUtils]: 56: Hoare triple {10003#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10004#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:00,306 INFO L273 TraceCheckUtils]: 57: Hoare triple {10004#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10004#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:00,307 INFO L273 TraceCheckUtils]: 58: Hoare triple {10004#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10004#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:00,308 INFO L273 TraceCheckUtils]: 59: Hoare triple {10004#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10005#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:00,309 INFO L273 TraceCheckUtils]: 60: Hoare triple {10005#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10005#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:00,309 INFO L273 TraceCheckUtils]: 61: Hoare triple {10005#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10005#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:00,310 INFO L273 TraceCheckUtils]: 62: Hoare triple {10005#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10006#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:00,311 INFO L273 TraceCheckUtils]: 63: Hoare triple {10006#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10006#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:00,311 INFO L273 TraceCheckUtils]: 64: Hoare triple {10006#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10006#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:00,312 INFO L273 TraceCheckUtils]: 65: Hoare triple {10006#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10007#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:00,313 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10007#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:00,314 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10007#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:00,315 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10008#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:00,315 INFO L273 TraceCheckUtils]: 69: Hoare triple {10008#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10008#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:00,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {10008#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10008#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:00,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {10008#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10009#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:00,318 INFO L273 TraceCheckUtils]: 72: Hoare triple {10009#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9986#false} is VALID [2018-11-23 12:06:00,318 INFO L273 TraceCheckUtils]: 73: Hoare triple {9986#false} havoc ~x~0;~x~0 := 0; {9986#false} is VALID [2018-11-23 12:06:00,318 INFO L273 TraceCheckUtils]: 74: Hoare triple {9986#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {9986#false} is VALID [2018-11-23 12:06:00,318 INFO L256 TraceCheckUtils]: 75: Hoare triple {9986#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {9986#false} is VALID [2018-11-23 12:06:00,319 INFO L273 TraceCheckUtils]: 76: Hoare triple {9986#false} ~cond := #in~cond; {9986#false} is VALID [2018-11-23 12:06:00,319 INFO L273 TraceCheckUtils]: 77: Hoare triple {9986#false} assume 0 == ~cond; {9986#false} is VALID [2018-11-23 12:06:00,319 INFO L273 TraceCheckUtils]: 78: Hoare triple {9986#false} assume !false; {9986#false} is VALID [2018-11-23 12:06:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:00,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:06:00,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 12:06:00,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:00,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:06:00,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:00,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:06:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:06:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:06:00,493 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 26 states. [2018-11-23 12:06:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:01,342 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2018-11-23 12:06:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:06:01,342 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 12:06:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:06:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 140 transitions. [2018-11-23 12:06:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:06:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 140 transitions. [2018-11-23 12:06:01,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 140 transitions. [2018-11-23 12:06:01,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:01,503 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:06:01,503 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 12:06:01,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:06:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 12:06:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-11-23 12:06:01,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:01,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 92 states. [2018-11-23 12:06:01,544 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 92 states. [2018-11-23 12:06:01,544 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 92 states. [2018-11-23 12:06:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:01,547 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2018-11-23 12:06:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2018-11-23 12:06:01,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:01,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:01,547 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 94 states. [2018-11-23 12:06:01,547 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 94 states. [2018-11-23 12:06:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:01,549 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2018-11-23 12:06:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2018-11-23 12:06:01,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:01,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:01,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:01,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 12:06:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2018-11-23 12:06:01,551 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 79 [2018-11-23 12:06:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:01,551 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2018-11-23 12:06:01,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:06:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-23 12:06:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:06:01,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:01,552 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:01,552 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:01,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash 86284500, now seen corresponding path program 23 times [2018-11-23 12:06:01,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:01,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:01,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:02,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {10708#true} call ULTIMATE.init(); {10708#true} is VALID [2018-11-23 12:06:02,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {10708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10708#true} is VALID [2018-11-23 12:06:02,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {10708#true} assume true; {10708#true} is VALID [2018-11-23 12:06:02,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10708#true} {10708#true} #70#return; {10708#true} is VALID [2018-11-23 12:06:02,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {10708#true} call #t~ret7 := main(); {10708#true} is VALID [2018-11-23 12:06:02,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {10708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {10710#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {10710#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10710#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {10710#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10710#(= main_~i~0 0)} is VALID [2018-11-23 12:06:02,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {10710#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10711#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {10711#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10711#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {10711#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10711#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:02,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {10711#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10712#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {10712#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10712#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {10712#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10712#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:02,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {10712#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10713#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {10713#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10713#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {10713#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10713#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:02,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {10713#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10714#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {10714#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10714#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {10714#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10714#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:02,246 INFO L273 TraceCheckUtils]: 20: Hoare triple {10714#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10715#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {10715#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10715#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {10715#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10715#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:02,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {10715#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10716#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {10716#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10716#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,250 INFO L273 TraceCheckUtils]: 25: Hoare triple {10716#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10716#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:02,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {10716#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10717#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {10717#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10717#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {10717#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10717#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:02,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {10717#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10718#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,254 INFO L273 TraceCheckUtils]: 30: Hoare triple {10718#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10718#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,254 INFO L273 TraceCheckUtils]: 31: Hoare triple {10718#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10718#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:02,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {10718#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10719#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {10719#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10719#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {10719#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10719#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:02,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {10719#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,258 INFO L273 TraceCheckUtils]: 36: Hoare triple {10720#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10720#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,258 INFO L273 TraceCheckUtils]: 37: Hoare triple {10720#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10720#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:02,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {10720#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {10721#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10721#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {10721#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10721#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:02,261 INFO L273 TraceCheckUtils]: 41: Hoare triple {10721#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10722#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {10722#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10722#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {10722#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10722#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:02,263 INFO L273 TraceCheckUtils]: 44: Hoare triple {10722#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10723#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {10723#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10723#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,265 INFO L273 TraceCheckUtils]: 46: Hoare triple {10723#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10723#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:02,266 INFO L273 TraceCheckUtils]: 47: Hoare triple {10723#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10724#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,266 INFO L273 TraceCheckUtils]: 48: Hoare triple {10724#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10724#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,267 INFO L273 TraceCheckUtils]: 49: Hoare triple {10724#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10724#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:02,268 INFO L273 TraceCheckUtils]: 50: Hoare triple {10724#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10725#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,269 INFO L273 TraceCheckUtils]: 51: Hoare triple {10725#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10725#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,269 INFO L273 TraceCheckUtils]: 52: Hoare triple {10725#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10725#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:02,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {10725#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10726#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {10726#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10726#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,271 INFO L273 TraceCheckUtils]: 55: Hoare triple {10726#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10726#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:02,272 INFO L273 TraceCheckUtils]: 56: Hoare triple {10726#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10727#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,273 INFO L273 TraceCheckUtils]: 57: Hoare triple {10727#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10727#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,273 INFO L273 TraceCheckUtils]: 58: Hoare triple {10727#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10727#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:02,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {10727#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10728#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {10728#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10728#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,276 INFO L273 TraceCheckUtils]: 61: Hoare triple {10728#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10728#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:02,276 INFO L273 TraceCheckUtils]: 62: Hoare triple {10728#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10729#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,277 INFO L273 TraceCheckUtils]: 63: Hoare triple {10729#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10729#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,277 INFO L273 TraceCheckUtils]: 64: Hoare triple {10729#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10729#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:02,278 INFO L273 TraceCheckUtils]: 65: Hoare triple {10729#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10730#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,279 INFO L273 TraceCheckUtils]: 66: Hoare triple {10730#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10730#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,280 INFO L273 TraceCheckUtils]: 67: Hoare triple {10730#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10730#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:02,280 INFO L273 TraceCheckUtils]: 68: Hoare triple {10730#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10731#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,281 INFO L273 TraceCheckUtils]: 69: Hoare triple {10731#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10731#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,282 INFO L273 TraceCheckUtils]: 70: Hoare triple {10731#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10731#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:02,282 INFO L273 TraceCheckUtils]: 71: Hoare triple {10731#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10732#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,283 INFO L273 TraceCheckUtils]: 72: Hoare triple {10732#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10732#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,284 INFO L273 TraceCheckUtils]: 73: Hoare triple {10732#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10732#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:02,285 INFO L273 TraceCheckUtils]: 74: Hoare triple {10732#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10733#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:02,285 INFO L273 TraceCheckUtils]: 75: Hoare triple {10733#(<= main_~i~0 23)} assume !(~i~0 < 100000); {10709#false} is VALID [2018-11-23 12:06:02,286 INFO L273 TraceCheckUtils]: 76: Hoare triple {10709#false} havoc ~x~0;~x~0 := 0; {10709#false} is VALID [2018-11-23 12:06:02,286 INFO L273 TraceCheckUtils]: 77: Hoare triple {10709#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {10709#false} is VALID [2018-11-23 12:06:02,286 INFO L256 TraceCheckUtils]: 78: Hoare triple {10709#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {10709#false} is VALID [2018-11-23 12:06:02,286 INFO L273 TraceCheckUtils]: 79: Hoare triple {10709#false} ~cond := #in~cond; {10709#false} is VALID [2018-11-23 12:06:02,286 INFO L273 TraceCheckUtils]: 80: Hoare triple {10709#false} assume 0 == ~cond; {10709#false} is VALID [2018-11-23 12:06:02,287 INFO L273 TraceCheckUtils]: 81: Hoare triple {10709#false} assume !false; {10709#false} is VALID [2018-11-23 12:06:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:02,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:02,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 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 12:06:02,301 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:02,695 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 12:06:02,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:02,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:03,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {10708#true} call ULTIMATE.init(); {10708#true} is VALID [2018-11-23 12:06:03,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {10708#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10708#true} is VALID [2018-11-23 12:06:03,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {10708#true} assume true; {10708#true} is VALID [2018-11-23 12:06:03,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10708#true} {10708#true} #70#return; {10708#true} is VALID [2018-11-23 12:06:03,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {10708#true} call #t~ret7 := main(); {10708#true} is VALID [2018-11-23 12:06:03,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {10708#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {10752#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:03,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {10752#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10752#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:03,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {10752#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10752#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:03,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {10752#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10711#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {10711#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10711#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {10711#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10711#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:03,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {10711#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10712#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {10712#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10712#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {10712#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10712#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:03,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {10712#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10713#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {10713#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10713#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {10713#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10713#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:03,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {10713#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10714#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {10714#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10714#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {10714#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10714#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:03,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {10714#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10715#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {10715#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10715#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {10715#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10715#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:03,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {10715#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10716#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,153 INFO L273 TraceCheckUtils]: 24: Hoare triple {10716#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10716#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {10716#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10716#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:03,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {10716#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10717#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {10717#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10717#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {10717#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10717#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:03,157 INFO L273 TraceCheckUtils]: 29: Hoare triple {10717#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10718#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,157 INFO L273 TraceCheckUtils]: 30: Hoare triple {10718#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10718#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {10718#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10718#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:03,159 INFO L273 TraceCheckUtils]: 32: Hoare triple {10718#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10719#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,159 INFO L273 TraceCheckUtils]: 33: Hoare triple {10719#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10719#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,160 INFO L273 TraceCheckUtils]: 34: Hoare triple {10719#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10719#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:03,161 INFO L273 TraceCheckUtils]: 35: Hoare triple {10719#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10720#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {10720#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10720#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {10720#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10720#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:03,162 INFO L273 TraceCheckUtils]: 38: Hoare triple {10720#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10721#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,163 INFO L273 TraceCheckUtils]: 39: Hoare triple {10721#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10721#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {10721#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10721#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:03,164 INFO L273 TraceCheckUtils]: 41: Hoare triple {10721#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10722#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,165 INFO L273 TraceCheckUtils]: 42: Hoare triple {10722#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10722#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,166 INFO L273 TraceCheckUtils]: 43: Hoare triple {10722#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10722#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:03,166 INFO L273 TraceCheckUtils]: 44: Hoare triple {10722#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10723#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {10723#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10723#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {10723#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10723#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:03,168 INFO L273 TraceCheckUtils]: 47: Hoare triple {10723#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10724#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,169 INFO L273 TraceCheckUtils]: 48: Hoare triple {10724#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10724#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,170 INFO L273 TraceCheckUtils]: 49: Hoare triple {10724#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10724#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:03,171 INFO L273 TraceCheckUtils]: 50: Hoare triple {10724#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10725#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,171 INFO L273 TraceCheckUtils]: 51: Hoare triple {10725#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10725#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {10725#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10725#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:03,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {10725#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10726#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {10726#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10726#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,174 INFO L273 TraceCheckUtils]: 55: Hoare triple {10726#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10726#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:03,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {10726#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10727#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {10727#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10727#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,176 INFO L273 TraceCheckUtils]: 58: Hoare triple {10727#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10727#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:03,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {10727#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10728#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {10728#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10728#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {10728#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10728#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:03,179 INFO L273 TraceCheckUtils]: 62: Hoare triple {10728#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10729#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,180 INFO L273 TraceCheckUtils]: 63: Hoare triple {10729#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10729#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,180 INFO L273 TraceCheckUtils]: 64: Hoare triple {10729#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10729#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:03,181 INFO L273 TraceCheckUtils]: 65: Hoare triple {10729#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10730#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,182 INFO L273 TraceCheckUtils]: 66: Hoare triple {10730#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10730#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,182 INFO L273 TraceCheckUtils]: 67: Hoare triple {10730#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10730#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:03,183 INFO L273 TraceCheckUtils]: 68: Hoare triple {10730#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10731#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,184 INFO L273 TraceCheckUtils]: 69: Hoare triple {10731#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10731#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,184 INFO L273 TraceCheckUtils]: 70: Hoare triple {10731#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10731#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:03,185 INFO L273 TraceCheckUtils]: 71: Hoare triple {10731#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10732#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,186 INFO L273 TraceCheckUtils]: 72: Hoare triple {10732#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10732#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,186 INFO L273 TraceCheckUtils]: 73: Hoare triple {10732#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {10732#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:03,187 INFO L273 TraceCheckUtils]: 74: Hoare triple {10732#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10733#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:03,188 INFO L273 TraceCheckUtils]: 75: Hoare triple {10733#(<= main_~i~0 23)} assume !(~i~0 < 100000); {10709#false} is VALID [2018-11-23 12:06:03,188 INFO L273 TraceCheckUtils]: 76: Hoare triple {10709#false} havoc ~x~0;~x~0 := 0; {10709#false} is VALID [2018-11-23 12:06:03,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {10709#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {10709#false} is VALID [2018-11-23 12:06:03,189 INFO L256 TraceCheckUtils]: 78: Hoare triple {10709#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {10709#false} is VALID [2018-11-23 12:06:03,189 INFO L273 TraceCheckUtils]: 79: Hoare triple {10709#false} ~cond := #in~cond; {10709#false} is VALID [2018-11-23 12:06:03,189 INFO L273 TraceCheckUtils]: 80: Hoare triple {10709#false} assume 0 == ~cond; {10709#false} is VALID [2018-11-23 12:06:03,189 INFO L273 TraceCheckUtils]: 81: Hoare triple {10709#false} assume !false; {10709#false} is VALID [2018-11-23 12:06:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:03,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:03,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:06:03,215 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 12:06:03,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:03,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:06:03,315 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 12:06:03,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:06:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:06:03,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:06:03,316 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand 27 states. [2018-11-23 12:06:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:04,338 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2018-11-23 12:06:04,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:06:04,339 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-23 12:06:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:06:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 144 transitions. [2018-11-23 12:06:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:06:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 144 transitions. [2018-11-23 12:06:04,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 144 transitions. [2018-11-23 12:06:04,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:04,506 INFO L225 Difference]: With dead ends: 113 [2018-11-23 12:06:04,506 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 12:06:04,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:06:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 12:06:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-23 12:06:04,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:04,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 95 states. [2018-11-23 12:06:04,547 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 95 states. [2018-11-23 12:06:04,547 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 95 states. [2018-11-23 12:06:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:04,549 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 12:06:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 12:06:04,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:04,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:04,550 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 97 states. [2018-11-23 12:06:04,550 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 97 states. [2018-11-23 12:06:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:04,551 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 12:06:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 12:06:04,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:04,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:04,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:04,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:06:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2018-11-23 12:06:04,554 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 82 [2018-11-23 12:06:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:04,554 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2018-11-23 12:06:04,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:06:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-23 12:06:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 12:06:04,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:04,555 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:04,556 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:04,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:04,556 INFO L82 PathProgramCache]: Analyzing trace with hash -631522553, now seen corresponding path program 24 times [2018-11-23 12:06:04,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:04,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:04,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:07,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {11455#true} call ULTIMATE.init(); {11455#true} is VALID [2018-11-23 12:06:07,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {11455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11455#true} is VALID [2018-11-23 12:06:07,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {11455#true} assume true; {11455#true} is VALID [2018-11-23 12:06:07,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11455#true} {11455#true} #70#return; {11455#true} is VALID [2018-11-23 12:06:07,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {11455#true} call #t~ret7 := main(); {11455#true} is VALID [2018-11-23 12:06:07,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {11455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {11457#(= main_~i~0 0)} is VALID [2018-11-23 12:06:07,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {11457#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11457#(= main_~i~0 0)} is VALID [2018-11-23 12:06:07,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {11457#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11457#(= main_~i~0 0)} is VALID [2018-11-23 12:06:07,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {11457#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11458#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:07,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {11458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11458#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:07,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {11458#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11458#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:07,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {11458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11459#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:07,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {11459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11459#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:07,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {11459#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11459#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:07,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {11459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11460#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:07,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {11460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11460#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:07,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {11460#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11460#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:07,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {11460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11461#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:07,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {11461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11461#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:07,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {11461#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11461#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:07,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {11461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11462#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:07,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {11462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11462#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:07,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {11462#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11462#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:07,160 INFO L273 TraceCheckUtils]: 23: Hoare triple {11462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11463#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:07,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {11463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11463#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:07,161 INFO L273 TraceCheckUtils]: 25: Hoare triple {11463#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11463#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:07,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {11463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11464#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:07,163 INFO L273 TraceCheckUtils]: 27: Hoare triple {11464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11464#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:07,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {11464#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11464#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:07,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {11464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11465#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:07,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {11465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11465#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:07,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {11465#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11465#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:07,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {11465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11466#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:07,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {11466#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11466#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:07,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {11466#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11466#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:07,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {11466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11467#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:07,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {11467#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11467#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:07,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {11467#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11467#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:07,170 INFO L273 TraceCheckUtils]: 38: Hoare triple {11467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11468#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:07,171 INFO L273 TraceCheckUtils]: 39: Hoare triple {11468#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11468#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:07,172 INFO L273 TraceCheckUtils]: 40: Hoare triple {11468#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11468#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:07,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {11468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11469#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:07,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {11469#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11469#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:07,174 INFO L273 TraceCheckUtils]: 43: Hoare triple {11469#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11469#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:07,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {11469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11470#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:07,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {11470#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11470#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:07,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {11470#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11470#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:07,177 INFO L273 TraceCheckUtils]: 47: Hoare triple {11470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11471#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:07,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {11471#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11471#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:07,178 INFO L273 TraceCheckUtils]: 49: Hoare triple {11471#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11471#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:07,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {11471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11472#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:07,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {11472#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11472#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:07,180 INFO L273 TraceCheckUtils]: 52: Hoare triple {11472#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11472#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:07,181 INFO L273 TraceCheckUtils]: 53: Hoare triple {11472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11473#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:07,181 INFO L273 TraceCheckUtils]: 54: Hoare triple {11473#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11473#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:07,182 INFO L273 TraceCheckUtils]: 55: Hoare triple {11473#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11473#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:07,183 INFO L273 TraceCheckUtils]: 56: Hoare triple {11473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11474#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:07,184 INFO L273 TraceCheckUtils]: 57: Hoare triple {11474#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11474#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:07,184 INFO L273 TraceCheckUtils]: 58: Hoare triple {11474#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11474#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:07,185 INFO L273 TraceCheckUtils]: 59: Hoare triple {11474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11475#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:07,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {11475#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11475#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:07,186 INFO L273 TraceCheckUtils]: 61: Hoare triple {11475#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11475#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:07,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {11475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11476#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:07,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {11476#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11476#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:07,189 INFO L273 TraceCheckUtils]: 64: Hoare triple {11476#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11476#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:07,189 INFO L273 TraceCheckUtils]: 65: Hoare triple {11476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11477#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:07,190 INFO L273 TraceCheckUtils]: 66: Hoare triple {11477#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11477#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:07,191 INFO L273 TraceCheckUtils]: 67: Hoare triple {11477#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11477#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:07,191 INFO L273 TraceCheckUtils]: 68: Hoare triple {11477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11478#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:07,192 INFO L273 TraceCheckUtils]: 69: Hoare triple {11478#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11478#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:07,193 INFO L273 TraceCheckUtils]: 70: Hoare triple {11478#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11478#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:07,194 INFO L273 TraceCheckUtils]: 71: Hoare triple {11478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11479#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:07,194 INFO L273 TraceCheckUtils]: 72: Hoare triple {11479#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11479#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:07,195 INFO L273 TraceCheckUtils]: 73: Hoare triple {11479#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11479#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:07,196 INFO L273 TraceCheckUtils]: 74: Hoare triple {11479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11480#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:07,196 INFO L273 TraceCheckUtils]: 75: Hoare triple {11480#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11480#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:07,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {11480#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11480#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:07,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {11480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11481#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:07,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {11481#(<= main_~i~0 24)} assume !(~i~0 < 100000); {11456#false} is VALID [2018-11-23 12:06:07,199 INFO L273 TraceCheckUtils]: 79: Hoare triple {11456#false} havoc ~x~0;~x~0 := 0; {11456#false} is VALID [2018-11-23 12:06:07,199 INFO L273 TraceCheckUtils]: 80: Hoare triple {11456#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {11456#false} is VALID [2018-11-23 12:06:07,199 INFO L256 TraceCheckUtils]: 81: Hoare triple {11456#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {11456#false} is VALID [2018-11-23 12:06:07,199 INFO L273 TraceCheckUtils]: 82: Hoare triple {11456#false} ~cond := #in~cond; {11456#false} is VALID [2018-11-23 12:06:07,199 INFO L273 TraceCheckUtils]: 83: Hoare triple {11456#false} assume 0 == ~cond; {11456#false} is VALID [2018-11-23 12:06:07,200 INFO L273 TraceCheckUtils]: 84: Hoare triple {11456#false} assume !false; {11456#false} is VALID [2018-11-23 12:06:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:07,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:07,205 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 12:06:07,213 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:08,731 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 12:06:08,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:08,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:09,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {11455#true} call ULTIMATE.init(); {11455#true} is VALID [2018-11-23 12:06:09,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {11455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11455#true} is VALID [2018-11-23 12:06:09,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {11455#true} assume true; {11455#true} is VALID [2018-11-23 12:06:09,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11455#true} {11455#true} #70#return; {11455#true} is VALID [2018-11-23 12:06:09,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {11455#true} call #t~ret7 := main(); {11455#true} is VALID [2018-11-23 12:06:09,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {11455#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {11500#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {11500#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11500#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {11500#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11500#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:09,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {11500#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11458#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {11458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11458#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {11458#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11458#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:09,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {11458#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11459#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {11459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11459#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {11459#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11459#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:09,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {11459#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11460#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {11460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11460#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {11460#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11460#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:09,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {11460#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11461#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {11461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11461#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {11461#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11461#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:09,028 INFO L273 TraceCheckUtils]: 20: Hoare triple {11461#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11462#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {11462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11462#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {11462#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11462#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:09,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {11462#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11463#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {11463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11463#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {11463#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11463#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:09,032 INFO L273 TraceCheckUtils]: 26: Hoare triple {11463#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11464#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {11464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11464#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {11464#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11464#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:09,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {11464#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11465#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,035 INFO L273 TraceCheckUtils]: 30: Hoare triple {11465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11465#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {11465#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11465#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:09,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {11465#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11466#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {11466#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11466#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,038 INFO L273 TraceCheckUtils]: 34: Hoare triple {11466#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11466#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:09,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {11466#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11467#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {11467#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11467#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,040 INFO L273 TraceCheckUtils]: 37: Hoare triple {11467#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11467#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:09,040 INFO L273 TraceCheckUtils]: 38: Hoare triple {11467#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11468#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,041 INFO L273 TraceCheckUtils]: 39: Hoare triple {11468#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11468#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {11468#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11468#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:09,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {11468#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11469#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {11469#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11469#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,044 INFO L273 TraceCheckUtils]: 43: Hoare triple {11469#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11469#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:09,045 INFO L273 TraceCheckUtils]: 44: Hoare triple {11469#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11470#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,045 INFO L273 TraceCheckUtils]: 45: Hoare triple {11470#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11470#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,046 INFO L273 TraceCheckUtils]: 46: Hoare triple {11470#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11470#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:09,046 INFO L273 TraceCheckUtils]: 47: Hoare triple {11470#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11471#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {11471#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11471#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {11471#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11471#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:09,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {11471#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11472#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,049 INFO L273 TraceCheckUtils]: 51: Hoare triple {11472#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11472#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,050 INFO L273 TraceCheckUtils]: 52: Hoare triple {11472#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11472#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:09,051 INFO L273 TraceCheckUtils]: 53: Hoare triple {11472#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11473#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,051 INFO L273 TraceCheckUtils]: 54: Hoare triple {11473#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11473#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,052 INFO L273 TraceCheckUtils]: 55: Hoare triple {11473#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11473#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:09,052 INFO L273 TraceCheckUtils]: 56: Hoare triple {11473#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11474#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,053 INFO L273 TraceCheckUtils]: 57: Hoare triple {11474#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11474#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,054 INFO L273 TraceCheckUtils]: 58: Hoare triple {11474#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11474#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:09,055 INFO L273 TraceCheckUtils]: 59: Hoare triple {11474#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11475#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,055 INFO L273 TraceCheckUtils]: 60: Hoare triple {11475#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11475#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,056 INFO L273 TraceCheckUtils]: 61: Hoare triple {11475#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11475#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:09,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {11475#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11476#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,058 INFO L273 TraceCheckUtils]: 63: Hoare triple {11476#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11476#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,058 INFO L273 TraceCheckUtils]: 64: Hoare triple {11476#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11476#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:09,059 INFO L273 TraceCheckUtils]: 65: Hoare triple {11476#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11477#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,060 INFO L273 TraceCheckUtils]: 66: Hoare triple {11477#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11477#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,060 INFO L273 TraceCheckUtils]: 67: Hoare triple {11477#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11477#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:09,061 INFO L273 TraceCheckUtils]: 68: Hoare triple {11477#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11478#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,062 INFO L273 TraceCheckUtils]: 69: Hoare triple {11478#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11478#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,062 INFO L273 TraceCheckUtils]: 70: Hoare triple {11478#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11478#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:09,063 INFO L273 TraceCheckUtils]: 71: Hoare triple {11478#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11479#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,064 INFO L273 TraceCheckUtils]: 72: Hoare triple {11479#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11479#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,065 INFO L273 TraceCheckUtils]: 73: Hoare triple {11479#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11479#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:09,065 INFO L273 TraceCheckUtils]: 74: Hoare triple {11479#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11480#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,066 INFO L273 TraceCheckUtils]: 75: Hoare triple {11480#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11480#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,067 INFO L273 TraceCheckUtils]: 76: Hoare triple {11480#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {11480#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:09,067 INFO L273 TraceCheckUtils]: 77: Hoare triple {11480#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11481#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:09,068 INFO L273 TraceCheckUtils]: 78: Hoare triple {11481#(<= main_~i~0 24)} assume !(~i~0 < 100000); {11456#false} is VALID [2018-11-23 12:06:09,068 INFO L273 TraceCheckUtils]: 79: Hoare triple {11456#false} havoc ~x~0;~x~0 := 0; {11456#false} is VALID [2018-11-23 12:06:09,069 INFO L273 TraceCheckUtils]: 80: Hoare triple {11456#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {11456#false} is VALID [2018-11-23 12:06:09,069 INFO L256 TraceCheckUtils]: 81: Hoare triple {11456#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {11456#false} is VALID [2018-11-23 12:06:09,069 INFO L273 TraceCheckUtils]: 82: Hoare triple {11456#false} ~cond := #in~cond; {11456#false} is VALID [2018-11-23 12:06:09,069 INFO L273 TraceCheckUtils]: 83: Hoare triple {11456#false} assume 0 == ~cond; {11456#false} is VALID [2018-11-23 12:06:09,069 INFO L273 TraceCheckUtils]: 84: Hoare triple {11456#false} assume !false; {11456#false} is VALID [2018-11-23 12:06:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:09,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:09,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 12:06:09,096 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 12:06:09,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:09,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:06:09,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:09,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:06:09,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:06:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:06:09,200 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand 28 states. [2018-11-23 12:06:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,133 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2018-11-23 12:06:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:06:10,134 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-23 12:06:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2018-11-23 12:06:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:06:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2018-11-23 12:06:10,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 148 transitions. [2018-11-23 12:06:10,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:10,352 INFO L225 Difference]: With dead ends: 116 [2018-11-23 12:06:10,353 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:06:10,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:06:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:06:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-23 12:06:10,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:10,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-23 12:06:10,398 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-23 12:06:10,398 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-23 12:06:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,401 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2018-11-23 12:06:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2018-11-23 12:06:10,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,402 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-23 12:06:10,402 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-23 12:06:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:10,404 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2018-11-23 12:06:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2018-11-23 12:06:10,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:10,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:10,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:10,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 12:06:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2018-11-23 12:06:10,406 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 85 [2018-11-23 12:06:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:10,407 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2018-11-23 12:06:10,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:06:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2018-11-23 12:06:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 12:06:10,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:10,408 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:10,408 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:10,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash -179271692, now seen corresponding path program 25 times [2018-11-23 12:06:10,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:10,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:10,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {12226#true} call ULTIMATE.init(); {12226#true} is VALID [2018-11-23 12:06:11,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {12226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12226#true} is VALID [2018-11-23 12:06:11,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {12226#true} assume true; {12226#true} is VALID [2018-11-23 12:06:11,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12226#true} {12226#true} #70#return; {12226#true} is VALID [2018-11-23 12:06:11,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {12226#true} call #t~ret7 := main(); {12226#true} is VALID [2018-11-23 12:06:11,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {12226#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {12228#(= main_~i~0 0)} is VALID [2018-11-23 12:06:11,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {12228#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12228#(= main_~i~0 0)} is VALID [2018-11-23 12:06:11,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {12228#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12228#(= main_~i~0 0)} is VALID [2018-11-23 12:06:11,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {12228#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12229#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {12229#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12229#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {12229#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12229#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {12229#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12230#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {12230#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12230#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {12230#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12230#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {12230#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12231#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {12231#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12231#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {12231#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12231#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {12231#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12232#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {12232#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12232#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {12232#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12232#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {12232#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12233#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {12233#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12233#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {12233#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12233#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {12233#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12234#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {12234#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12234#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {12234#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12234#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {12234#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12235#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {12235#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12235#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {12235#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12235#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {12235#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12236#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,419 INFO L273 TraceCheckUtils]: 30: Hoare triple {12236#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12236#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,419 INFO L273 TraceCheckUtils]: 31: Hoare triple {12236#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12236#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {12236#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12237#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {12237#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12237#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,422 INFO L273 TraceCheckUtils]: 34: Hoare triple {12237#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12237#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,422 INFO L273 TraceCheckUtils]: 35: Hoare triple {12237#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12238#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {12238#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12238#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,424 INFO L273 TraceCheckUtils]: 37: Hoare triple {12238#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12238#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,425 INFO L273 TraceCheckUtils]: 38: Hoare triple {12238#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12239#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,425 INFO L273 TraceCheckUtils]: 39: Hoare triple {12239#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12239#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,426 INFO L273 TraceCheckUtils]: 40: Hoare triple {12239#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12239#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,427 INFO L273 TraceCheckUtils]: 41: Hoare triple {12239#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12240#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,427 INFO L273 TraceCheckUtils]: 42: Hoare triple {12240#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12240#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,428 INFO L273 TraceCheckUtils]: 43: Hoare triple {12240#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12240#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,429 INFO L273 TraceCheckUtils]: 44: Hoare triple {12240#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12241#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,429 INFO L273 TraceCheckUtils]: 45: Hoare triple {12241#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12241#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,430 INFO L273 TraceCheckUtils]: 46: Hoare triple {12241#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12241#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,431 INFO L273 TraceCheckUtils]: 47: Hoare triple {12241#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12242#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,432 INFO L273 TraceCheckUtils]: 48: Hoare triple {12242#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12242#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,432 INFO L273 TraceCheckUtils]: 49: Hoare triple {12242#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12242#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,433 INFO L273 TraceCheckUtils]: 50: Hoare triple {12242#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12243#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,434 INFO L273 TraceCheckUtils]: 51: Hoare triple {12243#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12243#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,434 INFO L273 TraceCheckUtils]: 52: Hoare triple {12243#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12243#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {12243#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12244#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,436 INFO L273 TraceCheckUtils]: 54: Hoare triple {12244#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12244#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,436 INFO L273 TraceCheckUtils]: 55: Hoare triple {12244#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12244#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {12244#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12245#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,438 INFO L273 TraceCheckUtils]: 57: Hoare triple {12245#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12245#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,439 INFO L273 TraceCheckUtils]: 58: Hoare triple {12245#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12245#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,439 INFO L273 TraceCheckUtils]: 59: Hoare triple {12245#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12246#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,440 INFO L273 TraceCheckUtils]: 60: Hoare triple {12246#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12246#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,441 INFO L273 TraceCheckUtils]: 61: Hoare triple {12246#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12246#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,442 INFO L273 TraceCheckUtils]: 62: Hoare triple {12246#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12247#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,442 INFO L273 TraceCheckUtils]: 63: Hoare triple {12247#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12247#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,443 INFO L273 TraceCheckUtils]: 64: Hoare triple {12247#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12247#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,444 INFO L273 TraceCheckUtils]: 65: Hoare triple {12247#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12248#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,444 INFO L273 TraceCheckUtils]: 66: Hoare triple {12248#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12248#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,445 INFO L273 TraceCheckUtils]: 67: Hoare triple {12248#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12248#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,446 INFO L273 TraceCheckUtils]: 68: Hoare triple {12248#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12249#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,446 INFO L273 TraceCheckUtils]: 69: Hoare triple {12249#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12249#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,447 INFO L273 TraceCheckUtils]: 70: Hoare triple {12249#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12249#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,448 INFO L273 TraceCheckUtils]: 71: Hoare triple {12249#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12250#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,448 INFO L273 TraceCheckUtils]: 72: Hoare triple {12250#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12250#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,449 INFO L273 TraceCheckUtils]: 73: Hoare triple {12250#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12250#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,450 INFO L273 TraceCheckUtils]: 74: Hoare triple {12250#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12251#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,450 INFO L273 TraceCheckUtils]: 75: Hoare triple {12251#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12251#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,451 INFO L273 TraceCheckUtils]: 76: Hoare triple {12251#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12251#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,452 INFO L273 TraceCheckUtils]: 77: Hoare triple {12251#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12252#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,453 INFO L273 TraceCheckUtils]: 78: Hoare triple {12252#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12252#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,453 INFO L273 TraceCheckUtils]: 79: Hoare triple {12252#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12252#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,454 INFO L273 TraceCheckUtils]: 80: Hoare triple {12252#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12253#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:11,455 INFO L273 TraceCheckUtils]: 81: Hoare triple {12253#(<= main_~i~0 25)} assume !(~i~0 < 100000); {12227#false} is VALID [2018-11-23 12:06:11,455 INFO L273 TraceCheckUtils]: 82: Hoare triple {12227#false} havoc ~x~0;~x~0 := 0; {12227#false} is VALID [2018-11-23 12:06:11,455 INFO L273 TraceCheckUtils]: 83: Hoare triple {12227#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {12227#false} is VALID [2018-11-23 12:06:11,455 INFO L256 TraceCheckUtils]: 84: Hoare triple {12227#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {12227#false} is VALID [2018-11-23 12:06:11,455 INFO L273 TraceCheckUtils]: 85: Hoare triple {12227#false} ~cond := #in~cond; {12227#false} is VALID [2018-11-23 12:06:11,456 INFO L273 TraceCheckUtils]: 86: Hoare triple {12227#false} assume 0 == ~cond; {12227#false} is VALID [2018-11-23 12:06:11,456 INFO L273 TraceCheckUtils]: 87: Hoare triple {12227#false} assume !false; {12227#false} is VALID [2018-11-23 12:06:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:11,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:11,462 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 12:06:11,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:11,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:11,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {12226#true} call ULTIMATE.init(); {12226#true} is VALID [2018-11-23 12:06:11,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {12226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12226#true} is VALID [2018-11-23 12:06:11,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {12226#true} assume true; {12226#true} is VALID [2018-11-23 12:06:11,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12226#true} {12226#true} #70#return; {12226#true} is VALID [2018-11-23 12:06:11,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {12226#true} call #t~ret7 := main(); {12226#true} is VALID [2018-11-23 12:06:11,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {12226#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {12272#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {12272#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12272#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {12272#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12272#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:11,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {12272#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12229#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {12229#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12229#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {12229#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12229#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:11,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {12229#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12230#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {12230#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12230#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {12230#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12230#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:11,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {12230#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12231#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {12231#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12231#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {12231#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12231#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:11,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {12231#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12232#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {12232#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12232#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {12232#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12232#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:11,892 INFO L273 TraceCheckUtils]: 20: Hoare triple {12232#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12233#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,892 INFO L273 TraceCheckUtils]: 21: Hoare triple {12233#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12233#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,893 INFO L273 TraceCheckUtils]: 22: Hoare triple {12233#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12233#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:11,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {12233#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12234#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,894 INFO L273 TraceCheckUtils]: 24: Hoare triple {12234#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12234#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,895 INFO L273 TraceCheckUtils]: 25: Hoare triple {12234#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12234#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:11,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {12234#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12235#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {12235#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12235#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {12235#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12235#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:11,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {12235#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12236#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,899 INFO L273 TraceCheckUtils]: 30: Hoare triple {12236#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12236#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {12236#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12236#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:11,900 INFO L273 TraceCheckUtils]: 32: Hoare triple {12236#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12237#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,901 INFO L273 TraceCheckUtils]: 33: Hoare triple {12237#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12237#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {12237#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12237#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:11,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {12237#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12238#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,903 INFO L273 TraceCheckUtils]: 36: Hoare triple {12238#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12238#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,903 INFO L273 TraceCheckUtils]: 37: Hoare triple {12238#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12238#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:11,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {12238#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12239#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,905 INFO L273 TraceCheckUtils]: 39: Hoare triple {12239#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12239#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,906 INFO L273 TraceCheckUtils]: 40: Hoare triple {12239#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12239#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:11,906 INFO L273 TraceCheckUtils]: 41: Hoare triple {12239#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12240#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,907 INFO L273 TraceCheckUtils]: 42: Hoare triple {12240#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12240#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,908 INFO L273 TraceCheckUtils]: 43: Hoare triple {12240#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12240#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:11,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {12240#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12241#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,909 INFO L273 TraceCheckUtils]: 45: Hoare triple {12241#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12241#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,910 INFO L273 TraceCheckUtils]: 46: Hoare triple {12241#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12241#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:11,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {12241#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12242#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,911 INFO L273 TraceCheckUtils]: 48: Hoare triple {12242#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12242#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,912 INFO L273 TraceCheckUtils]: 49: Hoare triple {12242#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12242#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:11,913 INFO L273 TraceCheckUtils]: 50: Hoare triple {12242#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12243#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,913 INFO L273 TraceCheckUtils]: 51: Hoare triple {12243#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12243#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,914 INFO L273 TraceCheckUtils]: 52: Hoare triple {12243#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12243#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:11,915 INFO L273 TraceCheckUtils]: 53: Hoare triple {12243#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12244#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,916 INFO L273 TraceCheckUtils]: 54: Hoare triple {12244#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12244#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,916 INFO L273 TraceCheckUtils]: 55: Hoare triple {12244#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12244#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:11,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {12244#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12245#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,918 INFO L273 TraceCheckUtils]: 57: Hoare triple {12245#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12245#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {12245#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12245#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:11,919 INFO L273 TraceCheckUtils]: 59: Hoare triple {12245#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12246#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,920 INFO L273 TraceCheckUtils]: 60: Hoare triple {12246#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12246#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,920 INFO L273 TraceCheckUtils]: 61: Hoare triple {12246#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12246#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:11,921 INFO L273 TraceCheckUtils]: 62: Hoare triple {12246#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12247#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,922 INFO L273 TraceCheckUtils]: 63: Hoare triple {12247#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12247#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,922 INFO L273 TraceCheckUtils]: 64: Hoare triple {12247#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12247#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:11,923 INFO L273 TraceCheckUtils]: 65: Hoare triple {12247#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12248#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,924 INFO L273 TraceCheckUtils]: 66: Hoare triple {12248#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12248#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,924 INFO L273 TraceCheckUtils]: 67: Hoare triple {12248#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12248#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:11,925 INFO L273 TraceCheckUtils]: 68: Hoare triple {12248#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12249#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,926 INFO L273 TraceCheckUtils]: 69: Hoare triple {12249#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12249#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,927 INFO L273 TraceCheckUtils]: 70: Hoare triple {12249#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12249#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:11,927 INFO L273 TraceCheckUtils]: 71: Hoare triple {12249#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12250#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,928 INFO L273 TraceCheckUtils]: 72: Hoare triple {12250#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12250#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,929 INFO L273 TraceCheckUtils]: 73: Hoare triple {12250#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12250#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:11,929 INFO L273 TraceCheckUtils]: 74: Hoare triple {12250#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12251#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,930 INFO L273 TraceCheckUtils]: 75: Hoare triple {12251#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12251#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,931 INFO L273 TraceCheckUtils]: 76: Hoare triple {12251#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12251#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:11,931 INFO L273 TraceCheckUtils]: 77: Hoare triple {12251#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12252#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,932 INFO L273 TraceCheckUtils]: 78: Hoare triple {12252#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12252#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,932 INFO L273 TraceCheckUtils]: 79: Hoare triple {12252#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {12252#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:11,933 INFO L273 TraceCheckUtils]: 80: Hoare triple {12252#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12253#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:11,934 INFO L273 TraceCheckUtils]: 81: Hoare triple {12253#(<= main_~i~0 25)} assume !(~i~0 < 100000); {12227#false} is VALID [2018-11-23 12:06:11,934 INFO L273 TraceCheckUtils]: 82: Hoare triple {12227#false} havoc ~x~0;~x~0 := 0; {12227#false} is VALID [2018-11-23 12:06:11,934 INFO L273 TraceCheckUtils]: 83: Hoare triple {12227#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {12227#false} is VALID [2018-11-23 12:06:11,935 INFO L256 TraceCheckUtils]: 84: Hoare triple {12227#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {12227#false} is VALID [2018-11-23 12:06:11,935 INFO L273 TraceCheckUtils]: 85: Hoare triple {12227#false} ~cond := #in~cond; {12227#false} is VALID [2018-11-23 12:06:11,935 INFO L273 TraceCheckUtils]: 86: Hoare triple {12227#false} assume 0 == ~cond; {12227#false} is VALID [2018-11-23 12:06:11,935 INFO L273 TraceCheckUtils]: 87: Hoare triple {12227#false} assume !false; {12227#false} is VALID [2018-11-23 12:06:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:11,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:11,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:06:11,960 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 12:06:11,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:11,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:06:12,634 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 12:06:12,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:06:12,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:06:12,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:06:12,636 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 29 states. [2018-11-23 12:06:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,007 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2018-11-23 12:06:14,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:06:14,007 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-23 12:06:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 152 transitions. [2018-11-23 12:06:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:06:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 152 transitions. [2018-11-23 12:06:14,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 152 transitions. [2018-11-23 12:06:14,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:14,177 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:06:14,177 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:06:14,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 88 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 12:06:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:06:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-23 12:06:14,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:14,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-23 12:06:14,246 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-23 12:06:14,246 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-23 12:06:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,249 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2018-11-23 12:06:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-23 12:06:14,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:14,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:14,249 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-23 12:06:14,249 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-23 12:06:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:14,252 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2018-11-23 12:06:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2018-11-23 12:06:14,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:14,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:14,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:14,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 12:06:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2018-11-23 12:06:14,255 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 88 [2018-11-23 12:06:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:14,255 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2018-11-23 12:06:14,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:06:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2018-11-23 12:06:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 12:06:14,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:14,256 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:14,256 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:14,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash -486279193, now seen corresponding path program 26 times [2018-11-23 12:06:14,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:14,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:14,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {13021#true} call ULTIMATE.init(); {13021#true} is VALID [2018-11-23 12:06:15,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {13021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13021#true} is VALID [2018-11-23 12:06:15,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {13021#true} assume true; {13021#true} is VALID [2018-11-23 12:06:15,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13021#true} {13021#true} #70#return; {13021#true} is VALID [2018-11-23 12:06:15,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {13021#true} call #t~ret7 := main(); {13021#true} is VALID [2018-11-23 12:06:15,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {13021#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13023#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {13023#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13023#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {13023#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13023#(= main_~i~0 0)} is VALID [2018-11-23 12:06:15,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {13023#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13024#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {13024#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13024#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {13024#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13024#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {13024#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13025#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {13025#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13025#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {13025#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13025#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {13025#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13026#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {13026#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13026#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {13026#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13026#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {13026#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13027#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {13027#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13027#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,275 INFO L273 TraceCheckUtils]: 19: Hoare triple {13027#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13027#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {13027#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13028#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {13028#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13028#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,278 INFO L273 TraceCheckUtils]: 22: Hoare triple {13028#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13028#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {13028#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13029#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {13029#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13029#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {13029#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13029#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {13029#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13030#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,281 INFO L273 TraceCheckUtils]: 27: Hoare triple {13030#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13030#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,282 INFO L273 TraceCheckUtils]: 28: Hoare triple {13030#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13030#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {13030#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13031#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {13031#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13031#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {13031#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13031#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {13031#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13032#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {13032#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13032#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {13032#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13032#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {13032#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13033#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {13033#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13033#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {13033#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13033#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,289 INFO L273 TraceCheckUtils]: 38: Hoare triple {13033#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13034#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {13034#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13034#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {13034#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13034#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,291 INFO L273 TraceCheckUtils]: 41: Hoare triple {13034#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13035#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,292 INFO L273 TraceCheckUtils]: 42: Hoare triple {13035#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13035#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {13035#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13035#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,293 INFO L273 TraceCheckUtils]: 44: Hoare triple {13035#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13036#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {13036#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13036#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {13036#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13036#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,295 INFO L273 TraceCheckUtils]: 47: Hoare triple {13036#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13037#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,296 INFO L273 TraceCheckUtils]: 48: Hoare triple {13037#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13037#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {13037#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13037#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,297 INFO L273 TraceCheckUtils]: 50: Hoare triple {13037#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13038#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,298 INFO L273 TraceCheckUtils]: 51: Hoare triple {13038#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13038#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,298 INFO L273 TraceCheckUtils]: 52: Hoare triple {13038#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13038#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,299 INFO L273 TraceCheckUtils]: 53: Hoare triple {13038#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13039#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,300 INFO L273 TraceCheckUtils]: 54: Hoare triple {13039#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13039#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,300 INFO L273 TraceCheckUtils]: 55: Hoare triple {13039#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13039#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,301 INFO L273 TraceCheckUtils]: 56: Hoare triple {13039#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13040#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,302 INFO L273 TraceCheckUtils]: 57: Hoare triple {13040#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13040#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,303 INFO L273 TraceCheckUtils]: 58: Hoare triple {13040#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13040#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,303 INFO L273 TraceCheckUtils]: 59: Hoare triple {13040#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13041#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,304 INFO L273 TraceCheckUtils]: 60: Hoare triple {13041#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13041#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {13041#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13041#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,307 INFO L273 TraceCheckUtils]: 62: Hoare triple {13041#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13042#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,308 INFO L273 TraceCheckUtils]: 63: Hoare triple {13042#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13042#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,309 INFO L273 TraceCheckUtils]: 64: Hoare triple {13042#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13042#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,309 INFO L273 TraceCheckUtils]: 65: Hoare triple {13042#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13043#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,309 INFO L273 TraceCheckUtils]: 66: Hoare triple {13043#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13043#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,310 INFO L273 TraceCheckUtils]: 67: Hoare triple {13043#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13043#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,310 INFO L273 TraceCheckUtils]: 68: Hoare triple {13043#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13044#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,311 INFO L273 TraceCheckUtils]: 69: Hoare triple {13044#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13044#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,311 INFO L273 TraceCheckUtils]: 70: Hoare triple {13044#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13044#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,312 INFO L273 TraceCheckUtils]: 71: Hoare triple {13044#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13045#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,312 INFO L273 TraceCheckUtils]: 72: Hoare triple {13045#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13045#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,313 INFO L273 TraceCheckUtils]: 73: Hoare triple {13045#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13045#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,313 INFO L273 TraceCheckUtils]: 74: Hoare triple {13045#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13046#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {13046#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13046#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,315 INFO L273 TraceCheckUtils]: 76: Hoare triple {13046#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13046#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,316 INFO L273 TraceCheckUtils]: 77: Hoare triple {13046#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13047#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,316 INFO L273 TraceCheckUtils]: 78: Hoare triple {13047#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13047#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,317 INFO L273 TraceCheckUtils]: 79: Hoare triple {13047#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13047#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,318 INFO L273 TraceCheckUtils]: 80: Hoare triple {13047#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13048#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,318 INFO L273 TraceCheckUtils]: 81: Hoare triple {13048#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13048#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,319 INFO L273 TraceCheckUtils]: 82: Hoare triple {13048#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13048#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,320 INFO L273 TraceCheckUtils]: 83: Hoare triple {13048#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13049#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,320 INFO L273 TraceCheckUtils]: 84: Hoare triple {13049#(<= main_~i~0 26)} assume !(~i~0 < 100000); {13022#false} is VALID [2018-11-23 12:06:15,321 INFO L273 TraceCheckUtils]: 85: Hoare triple {13022#false} havoc ~x~0;~x~0 := 0; {13022#false} is VALID [2018-11-23 12:06:15,321 INFO L273 TraceCheckUtils]: 86: Hoare triple {13022#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13022#false} is VALID [2018-11-23 12:06:15,321 INFO L256 TraceCheckUtils]: 87: Hoare triple {13022#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13022#false} is VALID [2018-11-23 12:06:15,321 INFO L273 TraceCheckUtils]: 88: Hoare triple {13022#false} ~cond := #in~cond; {13022#false} is VALID [2018-11-23 12:06:15,321 INFO L273 TraceCheckUtils]: 89: Hoare triple {13022#false} assume 0 == ~cond; {13022#false} is VALID [2018-11-23 12:06:15,322 INFO L273 TraceCheckUtils]: 90: Hoare triple {13022#false} assume !false; {13022#false} is VALID [2018-11-23 12:06:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:15,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:15,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:06:15,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:15,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:15,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:15,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:15,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {13021#true} call ULTIMATE.init(); {13021#true} is VALID [2018-11-23 12:06:15,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {13021#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13021#true} is VALID [2018-11-23 12:06:15,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {13021#true} assume true; {13021#true} is VALID [2018-11-23 12:06:15,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13021#true} {13021#true} #70#return; {13021#true} is VALID [2018-11-23 12:06:15,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {13021#true} call #t~ret7 := main(); {13021#true} is VALID [2018-11-23 12:06:15,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {13021#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13068#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:15,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {13068#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13068#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:15,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {13068#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13068#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:15,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {13068#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13024#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {13024#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13024#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {13024#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13024#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:15,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {13024#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13025#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {13025#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13025#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {13025#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13025#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:15,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {13025#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13026#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,743 INFO L273 TraceCheckUtils]: 15: Hoare triple {13026#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13026#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {13026#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13026#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:15,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {13026#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13027#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {13027#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13027#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {13027#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13027#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:15,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {13027#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13028#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {13028#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13028#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {13028#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13028#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:15,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {13028#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13029#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {13029#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13029#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {13029#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13029#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:15,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {13029#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13030#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {13030#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13030#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {13030#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13030#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:15,752 INFO L273 TraceCheckUtils]: 29: Hoare triple {13030#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13031#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {13031#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13031#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {13031#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13031#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:15,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {13031#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13032#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {13032#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13032#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {13032#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13032#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:15,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {13032#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13033#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {13033#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13033#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {13033#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13033#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:15,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {13033#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13034#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {13034#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13034#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,760 INFO L273 TraceCheckUtils]: 40: Hoare triple {13034#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13034#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:15,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {13034#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13035#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {13035#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13035#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {13035#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13035#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:15,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {13035#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13036#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,762 INFO L273 TraceCheckUtils]: 45: Hoare triple {13036#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13036#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {13036#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13036#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:15,764 INFO L273 TraceCheckUtils]: 47: Hoare triple {13036#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13037#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,764 INFO L273 TraceCheckUtils]: 48: Hoare triple {13037#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13037#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,765 INFO L273 TraceCheckUtils]: 49: Hoare triple {13037#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13037#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:15,766 INFO L273 TraceCheckUtils]: 50: Hoare triple {13037#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13038#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,767 INFO L273 TraceCheckUtils]: 51: Hoare triple {13038#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13038#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,767 INFO L273 TraceCheckUtils]: 52: Hoare triple {13038#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13038#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:15,768 INFO L273 TraceCheckUtils]: 53: Hoare triple {13038#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13039#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {13039#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13039#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {13039#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13039#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:15,770 INFO L273 TraceCheckUtils]: 56: Hoare triple {13039#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13040#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,771 INFO L273 TraceCheckUtils]: 57: Hoare triple {13040#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13040#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {13040#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13040#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:15,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {13040#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13041#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,773 INFO L273 TraceCheckUtils]: 60: Hoare triple {13041#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13041#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,773 INFO L273 TraceCheckUtils]: 61: Hoare triple {13041#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13041#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:15,774 INFO L273 TraceCheckUtils]: 62: Hoare triple {13041#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13042#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {13042#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13042#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,775 INFO L273 TraceCheckUtils]: 64: Hoare triple {13042#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13042#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:15,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {13042#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13043#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,777 INFO L273 TraceCheckUtils]: 66: Hoare triple {13043#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13043#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,777 INFO L273 TraceCheckUtils]: 67: Hoare triple {13043#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13043#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:15,778 INFO L273 TraceCheckUtils]: 68: Hoare triple {13043#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13044#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,779 INFO L273 TraceCheckUtils]: 69: Hoare triple {13044#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13044#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,780 INFO L273 TraceCheckUtils]: 70: Hoare triple {13044#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13044#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:15,780 INFO L273 TraceCheckUtils]: 71: Hoare triple {13044#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13045#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {13045#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13045#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,782 INFO L273 TraceCheckUtils]: 73: Hoare triple {13045#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13045#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:15,782 INFO L273 TraceCheckUtils]: 74: Hoare triple {13045#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13046#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,783 INFO L273 TraceCheckUtils]: 75: Hoare triple {13046#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13046#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,784 INFO L273 TraceCheckUtils]: 76: Hoare triple {13046#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13046#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:15,785 INFO L273 TraceCheckUtils]: 77: Hoare triple {13046#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13047#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,785 INFO L273 TraceCheckUtils]: 78: Hoare triple {13047#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13047#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,786 INFO L273 TraceCheckUtils]: 79: Hoare triple {13047#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13047#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:15,787 INFO L273 TraceCheckUtils]: 80: Hoare triple {13047#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13048#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,787 INFO L273 TraceCheckUtils]: 81: Hoare triple {13048#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13048#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,788 INFO L273 TraceCheckUtils]: 82: Hoare triple {13048#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13048#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:15,789 INFO L273 TraceCheckUtils]: 83: Hoare triple {13048#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13049#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:15,789 INFO L273 TraceCheckUtils]: 84: Hoare triple {13049#(<= main_~i~0 26)} assume !(~i~0 < 100000); {13022#false} is VALID [2018-11-23 12:06:15,790 INFO L273 TraceCheckUtils]: 85: Hoare triple {13022#false} havoc ~x~0;~x~0 := 0; {13022#false} is VALID [2018-11-23 12:06:15,790 INFO L273 TraceCheckUtils]: 86: Hoare triple {13022#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13022#false} is VALID [2018-11-23 12:06:15,790 INFO L256 TraceCheckUtils]: 87: Hoare triple {13022#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13022#false} is VALID [2018-11-23 12:06:15,790 INFO L273 TraceCheckUtils]: 88: Hoare triple {13022#false} ~cond := #in~cond; {13022#false} is VALID [2018-11-23 12:06:15,790 INFO L273 TraceCheckUtils]: 89: Hoare triple {13022#false} assume 0 == ~cond; {13022#false} is VALID [2018-11-23 12:06:15,791 INFO L273 TraceCheckUtils]: 90: Hoare triple {13022#false} assume !false; {13022#false} is VALID [2018-11-23 12:06:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:15,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:15,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:06:15,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 12:06:15,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:15,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:06:15,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:15,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:06:15,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:06:15,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:06:15,925 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand 30 states. [2018-11-23 12:06:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:16,834 INFO L93 Difference]: Finished difference Result 122 states and 156 transitions. [2018-11-23 12:06:16,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:06:16,834 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-23 12:06:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:06:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 156 transitions. [2018-11-23 12:06:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:06:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 156 transitions. [2018-11-23 12:06:16,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 156 transitions. [2018-11-23 12:06:17,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:17,022 INFO L225 Difference]: With dead ends: 122 [2018-11-23 12:06:17,022 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:06:17,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:06:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:06:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-11-23 12:06:17,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:17,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 104 states. [2018-11-23 12:06:17,061 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 104 states. [2018-11-23 12:06:17,061 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 104 states. [2018-11-23 12:06:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,064 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2018-11-23 12:06:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2018-11-23 12:06:17,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,065 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 106 states. [2018-11-23 12:06:17,065 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 106 states. [2018-11-23 12:06:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:17,067 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2018-11-23 12:06:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2018-11-23 12:06:17,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:17,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:17,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:17,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:06:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2018-11-23 12:06:17,070 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 91 [2018-11-23 12:06:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:17,070 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2018-11-23 12:06:17,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:06:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 12:06:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:06:17,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:17,071 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:17,072 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:17,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:17,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1733598996, now seen corresponding path program 27 times [2018-11-23 12:06:17,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:17,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:17,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:17,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:18,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {13840#true} call ULTIMATE.init(); {13840#true} is VALID [2018-11-23 12:06:18,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {13840#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13840#true} is VALID [2018-11-23 12:06:18,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {13840#true} assume true; {13840#true} is VALID [2018-11-23 12:06:18,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13840#true} {13840#true} #70#return; {13840#true} is VALID [2018-11-23 12:06:18,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {13840#true} call #t~ret7 := main(); {13840#true} is VALID [2018-11-23 12:06:18,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {13840#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13842#(= main_~i~0 0)} is VALID [2018-11-23 12:06:18,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {13842#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13842#(= main_~i~0 0)} is VALID [2018-11-23 12:06:18,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {13842#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13842#(= main_~i~0 0)} is VALID [2018-11-23 12:06:18,354 INFO L273 TraceCheckUtils]: 8: Hoare triple {13842#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13843#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {13843#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13843#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {13843#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13843#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:18,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {13843#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13844#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {13844#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13844#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {13844#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13844#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:18,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {13844#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13845#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {13845#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13845#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {13845#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13845#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:18,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {13845#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13846#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {13846#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13846#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {13846#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13846#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:18,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {13846#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13847#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {13847#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13847#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {13847#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13847#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:18,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {13847#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13848#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,365 INFO L273 TraceCheckUtils]: 24: Hoare triple {13848#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13848#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {13848#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13848#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:18,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {13848#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13849#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {13849#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13849#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,368 INFO L273 TraceCheckUtils]: 28: Hoare triple {13849#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13849#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:18,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {13849#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13850#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {13850#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13850#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {13850#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13850#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:18,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {13850#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13851#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {13851#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13851#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,372 INFO L273 TraceCheckUtils]: 34: Hoare triple {13851#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13851#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:18,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {13851#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13852#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {13852#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13852#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {13852#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13852#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:18,375 INFO L273 TraceCheckUtils]: 38: Hoare triple {13852#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13853#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {13853#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13853#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {13853#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13853#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:18,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {13853#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13854#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {13854#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13854#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,378 INFO L273 TraceCheckUtils]: 43: Hoare triple {13854#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13854#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:18,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {13854#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13855#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {13855#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13855#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,380 INFO L273 TraceCheckUtils]: 46: Hoare triple {13855#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13855#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:18,381 INFO L273 TraceCheckUtils]: 47: Hoare triple {13855#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13856#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {13856#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13856#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,382 INFO L273 TraceCheckUtils]: 49: Hoare triple {13856#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13856#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:18,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {13856#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13857#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,383 INFO L273 TraceCheckUtils]: 51: Hoare triple {13857#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13857#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,384 INFO L273 TraceCheckUtils]: 52: Hoare triple {13857#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13857#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:18,385 INFO L273 TraceCheckUtils]: 53: Hoare triple {13857#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13858#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,386 INFO L273 TraceCheckUtils]: 54: Hoare triple {13858#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13858#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,386 INFO L273 TraceCheckUtils]: 55: Hoare triple {13858#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13858#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:18,387 INFO L273 TraceCheckUtils]: 56: Hoare triple {13858#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13859#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,387 INFO L273 TraceCheckUtils]: 57: Hoare triple {13859#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13859#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,388 INFO L273 TraceCheckUtils]: 58: Hoare triple {13859#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13859#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:18,389 INFO L273 TraceCheckUtils]: 59: Hoare triple {13859#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13860#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,390 INFO L273 TraceCheckUtils]: 60: Hoare triple {13860#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13860#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,390 INFO L273 TraceCheckUtils]: 61: Hoare triple {13860#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13860#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:18,391 INFO L273 TraceCheckUtils]: 62: Hoare triple {13860#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13861#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,392 INFO L273 TraceCheckUtils]: 63: Hoare triple {13861#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13861#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,392 INFO L273 TraceCheckUtils]: 64: Hoare triple {13861#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13861#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:18,393 INFO L273 TraceCheckUtils]: 65: Hoare triple {13861#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13862#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,394 INFO L273 TraceCheckUtils]: 66: Hoare triple {13862#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13862#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,394 INFO L273 TraceCheckUtils]: 67: Hoare triple {13862#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13862#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:18,395 INFO L273 TraceCheckUtils]: 68: Hoare triple {13862#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13863#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {13863#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13863#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,396 INFO L273 TraceCheckUtils]: 70: Hoare triple {13863#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13863#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:18,397 INFO L273 TraceCheckUtils]: 71: Hoare triple {13863#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13864#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,398 INFO L273 TraceCheckUtils]: 72: Hoare triple {13864#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13864#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,399 INFO L273 TraceCheckUtils]: 73: Hoare triple {13864#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13864#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:18,400 INFO L273 TraceCheckUtils]: 74: Hoare triple {13864#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13865#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,400 INFO L273 TraceCheckUtils]: 75: Hoare triple {13865#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13865#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,401 INFO L273 TraceCheckUtils]: 76: Hoare triple {13865#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13865#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:18,402 INFO L273 TraceCheckUtils]: 77: Hoare triple {13865#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13866#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,402 INFO L273 TraceCheckUtils]: 78: Hoare triple {13866#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13866#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,403 INFO L273 TraceCheckUtils]: 79: Hoare triple {13866#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13866#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:18,404 INFO L273 TraceCheckUtils]: 80: Hoare triple {13866#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13867#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,404 INFO L273 TraceCheckUtils]: 81: Hoare triple {13867#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13867#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,405 INFO L273 TraceCheckUtils]: 82: Hoare triple {13867#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13867#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:18,406 INFO L273 TraceCheckUtils]: 83: Hoare triple {13867#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13868#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,406 INFO L273 TraceCheckUtils]: 84: Hoare triple {13868#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13868#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,407 INFO L273 TraceCheckUtils]: 85: Hoare triple {13868#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13868#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:18,408 INFO L273 TraceCheckUtils]: 86: Hoare triple {13868#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13869#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:18,409 INFO L273 TraceCheckUtils]: 87: Hoare triple {13869#(<= main_~i~0 27)} assume !(~i~0 < 100000); {13841#false} is VALID [2018-11-23 12:06:18,409 INFO L273 TraceCheckUtils]: 88: Hoare triple {13841#false} havoc ~x~0;~x~0 := 0; {13841#false} is VALID [2018-11-23 12:06:18,409 INFO L273 TraceCheckUtils]: 89: Hoare triple {13841#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13841#false} is VALID [2018-11-23 12:06:18,409 INFO L256 TraceCheckUtils]: 90: Hoare triple {13841#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13841#false} is VALID [2018-11-23 12:06:18,409 INFO L273 TraceCheckUtils]: 91: Hoare triple {13841#false} ~cond := #in~cond; {13841#false} is VALID [2018-11-23 12:06:18,410 INFO L273 TraceCheckUtils]: 92: Hoare triple {13841#false} assume 0 == ~cond; {13841#false} is VALID [2018-11-23 12:06:18,410 INFO L273 TraceCheckUtils]: 93: Hoare triple {13841#false} assume !false; {13841#false} is VALID [2018-11-23 12:06:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:18,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:18,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:06:18,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:06:21,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 12:06:21,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:21,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:21,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {13840#true} call ULTIMATE.init(); {13840#true} is VALID [2018-11-23 12:06:21,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {13840#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13840#true} is VALID [2018-11-23 12:06:21,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {13840#true} assume true; {13840#true} is VALID [2018-11-23 12:06:21,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13840#true} {13840#true} #70#return; {13840#true} is VALID [2018-11-23 12:06:21,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {13840#true} call #t~ret7 := main(); {13840#true} is VALID [2018-11-23 12:06:21,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {13840#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {13888#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:21,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {13888#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13888#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:21,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {13888#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13888#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:21,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {13888#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13843#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {13843#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13843#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {13843#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13843#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:21,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {13843#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13844#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {13844#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13844#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {13844#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13844#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:21,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {13844#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13845#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {13845#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13845#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {13845#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13845#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:21,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {13845#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13846#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {13846#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13846#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {13846#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13846#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:21,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {13846#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13847#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {13847#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13847#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {13847#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13847#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:21,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {13847#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13848#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {13848#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13848#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {13848#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13848#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:21,962 INFO L273 TraceCheckUtils]: 26: Hoare triple {13848#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13849#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,962 INFO L273 TraceCheckUtils]: 27: Hoare triple {13849#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13849#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,963 INFO L273 TraceCheckUtils]: 28: Hoare triple {13849#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13849#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:21,964 INFO L273 TraceCheckUtils]: 29: Hoare triple {13849#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13850#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {13850#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13850#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {13850#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13850#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:21,966 INFO L273 TraceCheckUtils]: 32: Hoare triple {13850#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13851#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {13851#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13851#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {13851#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13851#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:21,968 INFO L273 TraceCheckUtils]: 35: Hoare triple {13851#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13852#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,969 INFO L273 TraceCheckUtils]: 36: Hoare triple {13852#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13852#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {13852#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13852#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:21,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {13852#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13853#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,971 INFO L273 TraceCheckUtils]: 39: Hoare triple {13853#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13853#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {13853#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13853#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:21,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {13853#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13854#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,973 INFO L273 TraceCheckUtils]: 42: Hoare triple {13854#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13854#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,973 INFO L273 TraceCheckUtils]: 43: Hoare triple {13854#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13854#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:21,974 INFO L273 TraceCheckUtils]: 44: Hoare triple {13854#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13855#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,975 INFO L273 TraceCheckUtils]: 45: Hoare triple {13855#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13855#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,976 INFO L273 TraceCheckUtils]: 46: Hoare triple {13855#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13855#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:21,976 INFO L273 TraceCheckUtils]: 47: Hoare triple {13855#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13856#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,977 INFO L273 TraceCheckUtils]: 48: Hoare triple {13856#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13856#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,978 INFO L273 TraceCheckUtils]: 49: Hoare triple {13856#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13856#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:21,978 INFO L273 TraceCheckUtils]: 50: Hoare triple {13856#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13857#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {13857#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13857#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,980 INFO L273 TraceCheckUtils]: 52: Hoare triple {13857#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13857#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:21,980 INFO L273 TraceCheckUtils]: 53: Hoare triple {13857#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13858#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,981 INFO L273 TraceCheckUtils]: 54: Hoare triple {13858#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13858#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,982 INFO L273 TraceCheckUtils]: 55: Hoare triple {13858#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13858#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:21,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {13858#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13859#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,983 INFO L273 TraceCheckUtils]: 57: Hoare triple {13859#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13859#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,984 INFO L273 TraceCheckUtils]: 58: Hoare triple {13859#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13859#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:21,985 INFO L273 TraceCheckUtils]: 59: Hoare triple {13859#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13860#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {13860#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13860#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,986 INFO L273 TraceCheckUtils]: 61: Hoare triple {13860#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13860#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:21,986 INFO L273 TraceCheckUtils]: 62: Hoare triple {13860#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13861#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,987 INFO L273 TraceCheckUtils]: 63: Hoare triple {13861#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13861#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,988 INFO L273 TraceCheckUtils]: 64: Hoare triple {13861#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13861#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:21,988 INFO L273 TraceCheckUtils]: 65: Hoare triple {13861#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13862#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,989 INFO L273 TraceCheckUtils]: 66: Hoare triple {13862#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13862#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,990 INFO L273 TraceCheckUtils]: 67: Hoare triple {13862#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13862#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:21,991 INFO L273 TraceCheckUtils]: 68: Hoare triple {13862#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13863#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,991 INFO L273 TraceCheckUtils]: 69: Hoare triple {13863#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13863#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,992 INFO L273 TraceCheckUtils]: 70: Hoare triple {13863#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13863#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:21,993 INFO L273 TraceCheckUtils]: 71: Hoare triple {13863#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13864#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,993 INFO L273 TraceCheckUtils]: 72: Hoare triple {13864#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13864#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,994 INFO L273 TraceCheckUtils]: 73: Hoare triple {13864#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13864#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:21,995 INFO L273 TraceCheckUtils]: 74: Hoare triple {13864#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13865#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,995 INFO L273 TraceCheckUtils]: 75: Hoare triple {13865#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13865#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,996 INFO L273 TraceCheckUtils]: 76: Hoare triple {13865#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13865#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:21,997 INFO L273 TraceCheckUtils]: 77: Hoare triple {13865#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13866#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,998 INFO L273 TraceCheckUtils]: 78: Hoare triple {13866#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13866#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,998 INFO L273 TraceCheckUtils]: 79: Hoare triple {13866#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13866#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:21,999 INFO L273 TraceCheckUtils]: 80: Hoare triple {13866#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13867#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:22,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {13867#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13867#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:22,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {13867#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13867#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:22,001 INFO L273 TraceCheckUtils]: 83: Hoare triple {13867#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13868#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:22,002 INFO L273 TraceCheckUtils]: 84: Hoare triple {13868#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {13868#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:22,002 INFO L273 TraceCheckUtils]: 85: Hoare triple {13868#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {13868#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:22,003 INFO L273 TraceCheckUtils]: 86: Hoare triple {13868#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13869#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:22,004 INFO L273 TraceCheckUtils]: 87: Hoare triple {13869#(<= main_~i~0 27)} assume !(~i~0 < 100000); {13841#false} is VALID [2018-11-23 12:06:22,004 INFO L273 TraceCheckUtils]: 88: Hoare triple {13841#false} havoc ~x~0;~x~0 := 0; {13841#false} is VALID [2018-11-23 12:06:22,004 INFO L273 TraceCheckUtils]: 89: Hoare triple {13841#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {13841#false} is VALID [2018-11-23 12:06:22,005 INFO L256 TraceCheckUtils]: 90: Hoare triple {13841#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {13841#false} is VALID [2018-11-23 12:06:22,005 INFO L273 TraceCheckUtils]: 91: Hoare triple {13841#false} ~cond := #in~cond; {13841#false} is VALID [2018-11-23 12:06:22,005 INFO L273 TraceCheckUtils]: 92: Hoare triple {13841#false} assume 0 == ~cond; {13841#false} is VALID [2018-11-23 12:06:22,005 INFO L273 TraceCheckUtils]: 93: Hoare triple {13841#false} assume !false; {13841#false} is VALID [2018-11-23 12:06:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:22,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:22,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:06:22,034 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 12:06:22,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:22,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:06:22,151 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 12:06:22,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:06:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:06:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:06:22,153 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand 31 states. [2018-11-23 12:06:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,056 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2018-11-23 12:06:23,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:06:23,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-23 12:06:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:06:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 160 transitions. [2018-11-23 12:06:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:06:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 160 transitions. [2018-11-23 12:06:23,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 160 transitions. [2018-11-23 12:06:23,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:23,307 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:06:23,307 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 12:06:23,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:06:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 12:06:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-23 12:06:23,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:23,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-23 12:06:23,443 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-23 12:06:23,443 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-23 12:06:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,445 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2018-11-23 12:06:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 141 transitions. [2018-11-23 12:06:23,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:23,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:23,446 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-23 12:06:23,446 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-23 12:06:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:23,448 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2018-11-23 12:06:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 141 transitions. [2018-11-23 12:06:23,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:23,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:23,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:23,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:06:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2018-11-23 12:06:23,451 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 138 transitions. Word has length 94 [2018-11-23 12:06:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:23,451 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 138 transitions. [2018-11-23 12:06:23,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:06:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 138 transitions. [2018-11-23 12:06:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:06:23,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:23,452 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:23,452 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:23,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash 218303687, now seen corresponding path program 28 times [2018-11-23 12:06:23,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:23,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:23,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {14683#true} call ULTIMATE.init(); {14683#true} is VALID [2018-11-23 12:06:24,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {14683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14683#true} is VALID [2018-11-23 12:06:24,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {14683#true} assume true; {14683#true} is VALID [2018-11-23 12:06:24,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14683#true} {14683#true} #70#return; {14683#true} is VALID [2018-11-23 12:06:24,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {14683#true} call #t~ret7 := main(); {14683#true} is VALID [2018-11-23 12:06:24,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {14683#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14685#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {14685#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14685#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {14685#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14685#(= main_~i~0 0)} is VALID [2018-11-23 12:06:24,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {14685#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14686#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {14686#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14686#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {14686#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14686#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:24,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {14686#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14687#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {14687#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14687#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {14687#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14687#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:24,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {14687#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14688#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {14688#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14688#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {14688#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14688#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:24,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {14688#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14689#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {14689#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14689#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {14689#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14689#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:24,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {14689#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14690#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {14690#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14690#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,430 INFO L273 TraceCheckUtils]: 22: Hoare triple {14690#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14690#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:24,431 INFO L273 TraceCheckUtils]: 23: Hoare triple {14690#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14691#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,432 INFO L273 TraceCheckUtils]: 24: Hoare triple {14691#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14691#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {14691#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14691#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:24,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {14691#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14692#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {14692#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14692#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,435 INFO L273 TraceCheckUtils]: 28: Hoare triple {14692#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14692#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:24,436 INFO L273 TraceCheckUtils]: 29: Hoare triple {14692#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14693#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {14693#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14693#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {14693#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14693#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:24,438 INFO L273 TraceCheckUtils]: 32: Hoare triple {14693#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14694#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {14694#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14694#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {14694#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14694#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:24,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {14694#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14695#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,441 INFO L273 TraceCheckUtils]: 36: Hoare triple {14695#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14695#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,442 INFO L273 TraceCheckUtils]: 37: Hoare triple {14695#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14695#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:24,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {14695#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14696#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {14696#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14696#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {14696#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14696#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:24,445 INFO L273 TraceCheckUtils]: 41: Hoare triple {14696#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14697#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,446 INFO L273 TraceCheckUtils]: 42: Hoare triple {14697#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14697#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,446 INFO L273 TraceCheckUtils]: 43: Hoare triple {14697#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14697#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:24,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {14697#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14698#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,448 INFO L273 TraceCheckUtils]: 45: Hoare triple {14698#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14698#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,449 INFO L273 TraceCheckUtils]: 46: Hoare triple {14698#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14698#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:24,450 INFO L273 TraceCheckUtils]: 47: Hoare triple {14698#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14699#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,450 INFO L273 TraceCheckUtils]: 48: Hoare triple {14699#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14699#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,451 INFO L273 TraceCheckUtils]: 49: Hoare triple {14699#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14699#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:24,452 INFO L273 TraceCheckUtils]: 50: Hoare triple {14699#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14700#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,453 INFO L273 TraceCheckUtils]: 51: Hoare triple {14700#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14700#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,454 INFO L273 TraceCheckUtils]: 52: Hoare triple {14700#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14700#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:24,455 INFO L273 TraceCheckUtils]: 53: Hoare triple {14700#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14701#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,455 INFO L273 TraceCheckUtils]: 54: Hoare triple {14701#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14701#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,456 INFO L273 TraceCheckUtils]: 55: Hoare triple {14701#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14701#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:24,457 INFO L273 TraceCheckUtils]: 56: Hoare triple {14701#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14702#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,458 INFO L273 TraceCheckUtils]: 57: Hoare triple {14702#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14702#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,458 INFO L273 TraceCheckUtils]: 58: Hoare triple {14702#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14702#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:24,460 INFO L273 TraceCheckUtils]: 59: Hoare triple {14702#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14703#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,460 INFO L273 TraceCheckUtils]: 60: Hoare triple {14703#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14703#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,461 INFO L273 TraceCheckUtils]: 61: Hoare triple {14703#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14703#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:24,462 INFO L273 TraceCheckUtils]: 62: Hoare triple {14703#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14704#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,463 INFO L273 TraceCheckUtils]: 63: Hoare triple {14704#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14704#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,463 INFO L273 TraceCheckUtils]: 64: Hoare triple {14704#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14704#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:24,464 INFO L273 TraceCheckUtils]: 65: Hoare triple {14704#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14705#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,465 INFO L273 TraceCheckUtils]: 66: Hoare triple {14705#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14705#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,466 INFO L273 TraceCheckUtils]: 67: Hoare triple {14705#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14705#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:24,467 INFO L273 TraceCheckUtils]: 68: Hoare triple {14705#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14706#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,467 INFO L273 TraceCheckUtils]: 69: Hoare triple {14706#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14706#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {14706#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14706#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:24,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {14706#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14707#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,470 INFO L273 TraceCheckUtils]: 72: Hoare triple {14707#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14707#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,471 INFO L273 TraceCheckUtils]: 73: Hoare triple {14707#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14707#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:24,471 INFO L273 TraceCheckUtils]: 74: Hoare triple {14707#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14708#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,472 INFO L273 TraceCheckUtils]: 75: Hoare triple {14708#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14708#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,473 INFO L273 TraceCheckUtils]: 76: Hoare triple {14708#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14708#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:24,474 INFO L273 TraceCheckUtils]: 77: Hoare triple {14708#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14709#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,475 INFO L273 TraceCheckUtils]: 78: Hoare triple {14709#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14709#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,475 INFO L273 TraceCheckUtils]: 79: Hoare triple {14709#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14709#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:24,476 INFO L273 TraceCheckUtils]: 80: Hoare triple {14709#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14710#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,477 INFO L273 TraceCheckUtils]: 81: Hoare triple {14710#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14710#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,478 INFO L273 TraceCheckUtils]: 82: Hoare triple {14710#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14710#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:24,479 INFO L273 TraceCheckUtils]: 83: Hoare triple {14710#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14711#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {14711#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14711#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {14711#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14711#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:24,481 INFO L273 TraceCheckUtils]: 86: Hoare triple {14711#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14712#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,482 INFO L273 TraceCheckUtils]: 87: Hoare triple {14712#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14712#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {14712#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14712#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:24,484 INFO L273 TraceCheckUtils]: 89: Hoare triple {14712#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14713#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:24,485 INFO L273 TraceCheckUtils]: 90: Hoare triple {14713#(<= main_~i~0 28)} assume !(~i~0 < 100000); {14684#false} is VALID [2018-11-23 12:06:24,485 INFO L273 TraceCheckUtils]: 91: Hoare triple {14684#false} havoc ~x~0;~x~0 := 0; {14684#false} is VALID [2018-11-23 12:06:24,485 INFO L273 TraceCheckUtils]: 92: Hoare triple {14684#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {14684#false} is VALID [2018-11-23 12:06:24,485 INFO L256 TraceCheckUtils]: 93: Hoare triple {14684#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {14684#false} is VALID [2018-11-23 12:06:24,486 INFO L273 TraceCheckUtils]: 94: Hoare triple {14684#false} ~cond := #in~cond; {14684#false} is VALID [2018-11-23 12:06:24,486 INFO L273 TraceCheckUtils]: 95: Hoare triple {14684#false} assume 0 == ~cond; {14684#false} is VALID [2018-11-23 12:06:24,486 INFO L273 TraceCheckUtils]: 96: Hoare triple {14684#false} assume !false; {14684#false} is VALID [2018-11-23 12:06:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:24,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:24,500 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 12:06:24,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:06:24,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:06:24,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:24,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:26,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {14683#true} call ULTIMATE.init(); {14683#true} is VALID [2018-11-23 12:06:26,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {14683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14683#true} is VALID [2018-11-23 12:06:26,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {14683#true} assume true; {14683#true} is VALID [2018-11-23 12:06:26,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14683#true} {14683#true} #70#return; {14683#true} is VALID [2018-11-23 12:06:26,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {14683#true} call #t~ret7 := main(); {14683#true} is VALID [2018-11-23 12:06:26,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {14683#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {14732#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:26,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {14732#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14732#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:26,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {14732#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14732#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:26,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {14732#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14686#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:26,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {14686#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14686#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:26,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {14686#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14686#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:26,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {14686#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14687#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:26,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {14687#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14687#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:26,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {14687#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14687#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:26,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {14687#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14688#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:26,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {14688#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14688#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:26,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {14688#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14688#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:26,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {14688#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14689#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:26,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {14689#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14689#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:26,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {14689#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14689#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:26,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {14689#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14690#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:26,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {14690#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14690#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:26,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {14690#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14690#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:26,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {14690#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14691#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:26,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {14691#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14691#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:26,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {14691#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14691#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:26,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {14691#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14692#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:26,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {14692#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14692#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:26,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {14692#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14692#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:26,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {14692#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14693#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:26,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {14693#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14693#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:26,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {14693#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14693#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:26,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {14693#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14694#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:26,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {14694#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14694#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:26,449 INFO L273 TraceCheckUtils]: 34: Hoare triple {14694#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14694#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:26,450 INFO L273 TraceCheckUtils]: 35: Hoare triple {14694#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14695#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:26,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {14695#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14695#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:26,451 INFO L273 TraceCheckUtils]: 37: Hoare triple {14695#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14695#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:26,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {14695#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14696#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:26,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {14696#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14696#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:26,453 INFO L273 TraceCheckUtils]: 40: Hoare triple {14696#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14696#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:26,454 INFO L273 TraceCheckUtils]: 41: Hoare triple {14696#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14697#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:26,455 INFO L273 TraceCheckUtils]: 42: Hoare triple {14697#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14697#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:26,455 INFO L273 TraceCheckUtils]: 43: Hoare triple {14697#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14697#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:26,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {14697#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14698#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:26,475 INFO L273 TraceCheckUtils]: 45: Hoare triple {14698#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14698#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:26,484 INFO L273 TraceCheckUtils]: 46: Hoare triple {14698#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14698#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:26,500 INFO L273 TraceCheckUtils]: 47: Hoare triple {14698#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14699#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:26,507 INFO L273 TraceCheckUtils]: 48: Hoare triple {14699#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14699#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:26,507 INFO L273 TraceCheckUtils]: 49: Hoare triple {14699#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14699#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:26,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {14699#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14700#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:26,508 INFO L273 TraceCheckUtils]: 51: Hoare triple {14700#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14700#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:26,509 INFO L273 TraceCheckUtils]: 52: Hoare triple {14700#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14700#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:26,527 INFO L273 TraceCheckUtils]: 53: Hoare triple {14700#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14701#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:26,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {14701#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14701#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:26,540 INFO L273 TraceCheckUtils]: 55: Hoare triple {14701#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14701#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:26,542 INFO L273 TraceCheckUtils]: 56: Hoare triple {14701#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14702#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:26,542 INFO L273 TraceCheckUtils]: 57: Hoare triple {14702#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14702#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:26,542 INFO L273 TraceCheckUtils]: 58: Hoare triple {14702#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14702#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:26,543 INFO L273 TraceCheckUtils]: 59: Hoare triple {14702#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14703#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:26,543 INFO L273 TraceCheckUtils]: 60: Hoare triple {14703#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14703#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:26,544 INFO L273 TraceCheckUtils]: 61: Hoare triple {14703#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14703#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:26,544 INFO L273 TraceCheckUtils]: 62: Hoare triple {14703#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14704#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:26,545 INFO L273 TraceCheckUtils]: 63: Hoare triple {14704#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14704#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:26,545 INFO L273 TraceCheckUtils]: 64: Hoare triple {14704#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14704#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:26,546 INFO L273 TraceCheckUtils]: 65: Hoare triple {14704#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14705#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:26,546 INFO L273 TraceCheckUtils]: 66: Hoare triple {14705#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14705#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:26,547 INFO L273 TraceCheckUtils]: 67: Hoare triple {14705#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14705#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:26,548 INFO L273 TraceCheckUtils]: 68: Hoare triple {14705#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14706#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:26,548 INFO L273 TraceCheckUtils]: 69: Hoare triple {14706#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14706#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:26,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {14706#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14706#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:26,550 INFO L273 TraceCheckUtils]: 71: Hoare triple {14706#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14707#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:26,551 INFO L273 TraceCheckUtils]: 72: Hoare triple {14707#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14707#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:26,551 INFO L273 TraceCheckUtils]: 73: Hoare triple {14707#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14707#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:26,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {14707#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14708#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:26,553 INFO L273 TraceCheckUtils]: 75: Hoare triple {14708#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14708#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:26,553 INFO L273 TraceCheckUtils]: 76: Hoare triple {14708#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14708#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:26,554 INFO L273 TraceCheckUtils]: 77: Hoare triple {14708#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14709#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:26,555 INFO L273 TraceCheckUtils]: 78: Hoare triple {14709#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14709#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:26,555 INFO L273 TraceCheckUtils]: 79: Hoare triple {14709#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14709#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:26,556 INFO L273 TraceCheckUtils]: 80: Hoare triple {14709#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14710#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:26,557 INFO L273 TraceCheckUtils]: 81: Hoare triple {14710#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14710#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:26,557 INFO L273 TraceCheckUtils]: 82: Hoare triple {14710#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14710#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:26,558 INFO L273 TraceCheckUtils]: 83: Hoare triple {14710#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14711#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:26,559 INFO L273 TraceCheckUtils]: 84: Hoare triple {14711#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14711#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:26,559 INFO L273 TraceCheckUtils]: 85: Hoare triple {14711#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14711#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:26,560 INFO L273 TraceCheckUtils]: 86: Hoare triple {14711#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14712#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:26,561 INFO L273 TraceCheckUtils]: 87: Hoare triple {14712#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14712#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:26,561 INFO L273 TraceCheckUtils]: 88: Hoare triple {14712#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {14712#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:26,562 INFO L273 TraceCheckUtils]: 89: Hoare triple {14712#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14713#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:26,563 INFO L273 TraceCheckUtils]: 90: Hoare triple {14713#(<= main_~i~0 28)} assume !(~i~0 < 100000); {14684#false} is VALID [2018-11-23 12:06:26,563 INFO L273 TraceCheckUtils]: 91: Hoare triple {14684#false} havoc ~x~0;~x~0 := 0; {14684#false} is VALID [2018-11-23 12:06:26,563 INFO L273 TraceCheckUtils]: 92: Hoare triple {14684#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {14684#false} is VALID [2018-11-23 12:06:26,564 INFO L256 TraceCheckUtils]: 93: Hoare triple {14684#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {14684#false} is VALID [2018-11-23 12:06:26,564 INFO L273 TraceCheckUtils]: 94: Hoare triple {14684#false} ~cond := #in~cond; {14684#false} is VALID [2018-11-23 12:06:26,564 INFO L273 TraceCheckUtils]: 95: Hoare triple {14684#false} assume 0 == ~cond; {14684#false} is VALID [2018-11-23 12:06:26,564 INFO L273 TraceCheckUtils]: 96: Hoare triple {14684#false} assume !false; {14684#false} is VALID [2018-11-23 12:06:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:26,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:26,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:06:26,593 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 12:06:26,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:26,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:06:26,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:26,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:06:26,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:06:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:06:26,739 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 32 states. [2018-11-23 12:06:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,606 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2018-11-23 12:06:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:06:27,606 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-23 12:06:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:06:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 164 transitions. [2018-11-23 12:06:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:06:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 164 transitions. [2018-11-23 12:06:27,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 164 transitions. [2018-11-23 12:06:27,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:27,804 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:06:27,804 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 12:06:27,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:06:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 12:06:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-23 12:06:27,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:27,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2018-11-23 12:06:27,856 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2018-11-23 12:06:27,856 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2018-11-23 12:06:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,858 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2018-11-23 12:06:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2018-11-23 12:06:27,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:27,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:27,859 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2018-11-23 12:06:27,859 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2018-11-23 12:06:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:27,861 INFO L93 Difference]: Finished difference Result 112 states and 145 transitions. [2018-11-23 12:06:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2018-11-23 12:06:27,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:27,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:27,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:27,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 12:06:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2018-11-23 12:06:27,864 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 97 [2018-11-23 12:06:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:27,864 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2018-11-23 12:06:27,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:06:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2018-11-23 12:06:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:06:27,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:27,866 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:27,866 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:27,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1837965772, now seen corresponding path program 29 times [2018-11-23 12:06:27,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:27,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:27,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:29,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {15550#true} call ULTIMATE.init(); {15550#true} is VALID [2018-11-23 12:06:29,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {15550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15550#true} is VALID [2018-11-23 12:06:29,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {15550#true} assume true; {15550#true} is VALID [2018-11-23 12:06:29,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15550#true} {15550#true} #70#return; {15550#true} is VALID [2018-11-23 12:06:29,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {15550#true} call #t~ret7 := main(); {15550#true} is VALID [2018-11-23 12:06:29,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {15550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {15552#(= main_~i~0 0)} is VALID [2018-11-23 12:06:29,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {15552#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15552#(= main_~i~0 0)} is VALID [2018-11-23 12:06:29,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {15552#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15552#(= main_~i~0 0)} is VALID [2018-11-23 12:06:29,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {15552#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15553#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {15553#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15553#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {15553#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15553#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:29,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {15553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15554#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {15554#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15554#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {15554#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15554#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:29,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {15554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15555#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {15555#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15555#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {15555#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15555#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:29,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {15555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15556#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {15556#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15556#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {15556#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15556#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:29,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {15556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15557#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {15557#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15557#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {15557#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15557#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:29,808 INFO L273 TraceCheckUtils]: 23: Hoare triple {15557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15558#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {15558#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15558#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,809 INFO L273 TraceCheckUtils]: 25: Hoare triple {15558#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15558#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:29,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {15558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15559#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {15559#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15559#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {15559#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15559#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:29,812 INFO L273 TraceCheckUtils]: 29: Hoare triple {15559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15560#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {15560#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15560#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {15560#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15560#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:29,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {15560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15561#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,815 INFO L273 TraceCheckUtils]: 33: Hoare triple {15561#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15561#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,815 INFO L273 TraceCheckUtils]: 34: Hoare triple {15561#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15561#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:29,816 INFO L273 TraceCheckUtils]: 35: Hoare triple {15561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15562#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,817 INFO L273 TraceCheckUtils]: 36: Hoare triple {15562#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15562#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,817 INFO L273 TraceCheckUtils]: 37: Hoare triple {15562#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15562#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:29,818 INFO L273 TraceCheckUtils]: 38: Hoare triple {15562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15563#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,819 INFO L273 TraceCheckUtils]: 39: Hoare triple {15563#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15563#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,819 INFO L273 TraceCheckUtils]: 40: Hoare triple {15563#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15563#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:29,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {15563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15564#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {15564#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15564#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,821 INFO L273 TraceCheckUtils]: 43: Hoare triple {15564#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15564#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:29,822 INFO L273 TraceCheckUtils]: 44: Hoare triple {15564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15565#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,823 INFO L273 TraceCheckUtils]: 45: Hoare triple {15565#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15565#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,823 INFO L273 TraceCheckUtils]: 46: Hoare triple {15565#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15565#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:29,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {15565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15566#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,824 INFO L273 TraceCheckUtils]: 48: Hoare triple {15566#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15566#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {15566#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15566#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:29,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {15566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15567#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:29,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {15567#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15567#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:29,827 INFO L273 TraceCheckUtils]: 52: Hoare triple {15567#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15567#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:29,828 INFO L273 TraceCheckUtils]: 53: Hoare triple {15567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15568#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:29,828 INFO L273 TraceCheckUtils]: 54: Hoare triple {15568#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15568#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:29,829 INFO L273 TraceCheckUtils]: 55: Hoare triple {15568#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15568#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:29,830 INFO L273 TraceCheckUtils]: 56: Hoare triple {15568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15569#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:29,830 INFO L273 TraceCheckUtils]: 57: Hoare triple {15569#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15569#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:29,831 INFO L273 TraceCheckUtils]: 58: Hoare triple {15569#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15569#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:29,837 INFO L273 TraceCheckUtils]: 59: Hoare triple {15569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15570#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:29,837 INFO L273 TraceCheckUtils]: 60: Hoare triple {15570#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15570#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:29,838 INFO L273 TraceCheckUtils]: 61: Hoare triple {15570#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15570#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:29,838 INFO L273 TraceCheckUtils]: 62: Hoare triple {15570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15571#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:29,838 INFO L273 TraceCheckUtils]: 63: Hoare triple {15571#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15571#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:29,839 INFO L273 TraceCheckUtils]: 64: Hoare triple {15571#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15571#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:29,839 INFO L273 TraceCheckUtils]: 65: Hoare triple {15571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15572#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:29,840 INFO L273 TraceCheckUtils]: 66: Hoare triple {15572#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15572#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:29,840 INFO L273 TraceCheckUtils]: 67: Hoare triple {15572#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15572#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:29,840 INFO L273 TraceCheckUtils]: 68: Hoare triple {15572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15573#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:29,841 INFO L273 TraceCheckUtils]: 69: Hoare triple {15573#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15573#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:29,841 INFO L273 TraceCheckUtils]: 70: Hoare triple {15573#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15573#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:29,842 INFO L273 TraceCheckUtils]: 71: Hoare triple {15573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15574#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:29,843 INFO L273 TraceCheckUtils]: 72: Hoare triple {15574#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15574#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:29,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {15574#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15574#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:29,844 INFO L273 TraceCheckUtils]: 74: Hoare triple {15574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15575#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:29,844 INFO L273 TraceCheckUtils]: 75: Hoare triple {15575#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15575#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:29,845 INFO L273 TraceCheckUtils]: 76: Hoare triple {15575#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15575#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:29,846 INFO L273 TraceCheckUtils]: 77: Hoare triple {15575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15576#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:29,847 INFO L273 TraceCheckUtils]: 78: Hoare triple {15576#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15576#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:29,847 INFO L273 TraceCheckUtils]: 79: Hoare triple {15576#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15576#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:29,848 INFO L273 TraceCheckUtils]: 80: Hoare triple {15576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15577#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:29,849 INFO L273 TraceCheckUtils]: 81: Hoare triple {15577#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15577#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:29,849 INFO L273 TraceCheckUtils]: 82: Hoare triple {15577#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15577#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:29,850 INFO L273 TraceCheckUtils]: 83: Hoare triple {15577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15578#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:29,851 INFO L273 TraceCheckUtils]: 84: Hoare triple {15578#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15578#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:29,873 INFO L273 TraceCheckUtils]: 85: Hoare triple {15578#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15578#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:29,888 INFO L273 TraceCheckUtils]: 86: Hoare triple {15578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15579#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:29,897 INFO L273 TraceCheckUtils]: 87: Hoare triple {15579#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15579#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:29,912 INFO L273 TraceCheckUtils]: 88: Hoare triple {15579#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15579#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:29,921 INFO L273 TraceCheckUtils]: 89: Hoare triple {15579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15580#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:29,934 INFO L273 TraceCheckUtils]: 90: Hoare triple {15580#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15580#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:29,943 INFO L273 TraceCheckUtils]: 91: Hoare triple {15580#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15580#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:29,955 INFO L273 TraceCheckUtils]: 92: Hoare triple {15580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15581#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:29,968 INFO L273 TraceCheckUtils]: 93: Hoare triple {15581#(<= main_~i~0 29)} assume !(~i~0 < 100000); {15551#false} is VALID [2018-11-23 12:06:29,968 INFO L273 TraceCheckUtils]: 94: Hoare triple {15551#false} havoc ~x~0;~x~0 := 0; {15551#false} is VALID [2018-11-23 12:06:29,969 INFO L273 TraceCheckUtils]: 95: Hoare triple {15551#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {15551#false} is VALID [2018-11-23 12:06:29,969 INFO L256 TraceCheckUtils]: 96: Hoare triple {15551#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {15551#false} is VALID [2018-11-23 12:06:29,969 INFO L273 TraceCheckUtils]: 97: Hoare triple {15551#false} ~cond := #in~cond; {15551#false} is VALID [2018-11-23 12:06:29,969 INFO L273 TraceCheckUtils]: 98: Hoare triple {15551#false} assume 0 == ~cond; {15551#false} is VALID [2018-11-23 12:06:29,969 INFO L273 TraceCheckUtils]: 99: Hoare triple {15551#false} assume !false; {15551#false} is VALID [2018-11-23 12:06:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:29,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:29,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 12:06:29,992 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:06:35,622 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 12:06:35,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:35,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:35,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {15550#true} call ULTIMATE.init(); {15550#true} is VALID [2018-11-23 12:06:35,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {15550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15550#true} is VALID [2018-11-23 12:06:35,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {15550#true} assume true; {15550#true} is VALID [2018-11-23 12:06:35,959 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15550#true} {15550#true} #70#return; {15550#true} is VALID [2018-11-23 12:06:35,959 INFO L256 TraceCheckUtils]: 4: Hoare triple {15550#true} call #t~ret7 := main(); {15550#true} is VALID [2018-11-23 12:06:35,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {15550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {15600#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:35,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {15600#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15600#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:35,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {15600#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15600#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:35,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {15600#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15553#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:35,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {15553#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15553#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:35,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {15553#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15553#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:35,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {15553#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15554#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:35,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {15554#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15554#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:35,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {15554#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15554#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:35,968 INFO L273 TraceCheckUtils]: 14: Hoare triple {15554#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15555#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:35,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {15555#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15555#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:35,969 INFO L273 TraceCheckUtils]: 16: Hoare triple {15555#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15555#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:35,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {15555#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15556#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:35,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {15556#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15556#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:35,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {15556#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15556#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:35,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {15556#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15557#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:35,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {15557#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15557#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:35,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {15557#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15557#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:35,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {15557#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15558#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:35,973 INFO L273 TraceCheckUtils]: 24: Hoare triple {15558#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15558#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:35,974 INFO L273 TraceCheckUtils]: 25: Hoare triple {15558#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15558#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:35,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {15558#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15559#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:35,975 INFO L273 TraceCheckUtils]: 27: Hoare triple {15559#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15559#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:35,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {15559#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15559#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:35,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {15559#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15560#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:35,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {15560#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15560#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:35,988 INFO L273 TraceCheckUtils]: 31: Hoare triple {15560#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15560#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:35,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {15560#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15561#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:35,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {15561#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15561#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:35,990 INFO L273 TraceCheckUtils]: 34: Hoare triple {15561#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15561#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:35,991 INFO L273 TraceCheckUtils]: 35: Hoare triple {15561#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15562#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:35,991 INFO L273 TraceCheckUtils]: 36: Hoare triple {15562#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15562#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:35,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {15562#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15562#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:35,992 INFO L273 TraceCheckUtils]: 38: Hoare triple {15562#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15563#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:35,992 INFO L273 TraceCheckUtils]: 39: Hoare triple {15563#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15563#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:35,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {15563#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15563#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:35,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {15563#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15564#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:35,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {15564#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15564#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:35,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {15564#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15564#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:35,994 INFO L273 TraceCheckUtils]: 44: Hoare triple {15564#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15565#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:35,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {15565#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15565#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:35,996 INFO L273 TraceCheckUtils]: 46: Hoare triple {15565#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15565#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:35,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {15565#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15566#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:35,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {15566#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15566#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:35,998 INFO L273 TraceCheckUtils]: 49: Hoare triple {15566#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15566#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:35,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {15566#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15567#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:35,999 INFO L273 TraceCheckUtils]: 51: Hoare triple {15567#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15567#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:36,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {15567#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15567#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:36,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {15567#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15568#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:36,002 INFO L273 TraceCheckUtils]: 54: Hoare triple {15568#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15568#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:36,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {15568#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15568#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:36,003 INFO L273 TraceCheckUtils]: 56: Hoare triple {15568#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15569#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:36,004 INFO L273 TraceCheckUtils]: 57: Hoare triple {15569#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15569#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:36,004 INFO L273 TraceCheckUtils]: 58: Hoare triple {15569#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15569#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:36,005 INFO L273 TraceCheckUtils]: 59: Hoare triple {15569#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15570#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:36,006 INFO L273 TraceCheckUtils]: 60: Hoare triple {15570#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15570#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:36,006 INFO L273 TraceCheckUtils]: 61: Hoare triple {15570#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15570#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:36,007 INFO L273 TraceCheckUtils]: 62: Hoare triple {15570#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15571#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:36,008 INFO L273 TraceCheckUtils]: 63: Hoare triple {15571#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15571#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:36,008 INFO L273 TraceCheckUtils]: 64: Hoare triple {15571#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15571#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:36,009 INFO L273 TraceCheckUtils]: 65: Hoare triple {15571#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15572#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:36,010 INFO L273 TraceCheckUtils]: 66: Hoare triple {15572#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15572#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:36,010 INFO L273 TraceCheckUtils]: 67: Hoare triple {15572#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15572#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:36,011 INFO L273 TraceCheckUtils]: 68: Hoare triple {15572#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15573#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:36,012 INFO L273 TraceCheckUtils]: 69: Hoare triple {15573#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15573#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:36,012 INFO L273 TraceCheckUtils]: 70: Hoare triple {15573#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15573#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:36,013 INFO L273 TraceCheckUtils]: 71: Hoare triple {15573#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15574#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:36,014 INFO L273 TraceCheckUtils]: 72: Hoare triple {15574#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15574#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:36,014 INFO L273 TraceCheckUtils]: 73: Hoare triple {15574#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15574#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:36,015 INFO L273 TraceCheckUtils]: 74: Hoare triple {15574#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15575#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:36,016 INFO L273 TraceCheckUtils]: 75: Hoare triple {15575#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15575#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:36,017 INFO L273 TraceCheckUtils]: 76: Hoare triple {15575#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15575#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:36,017 INFO L273 TraceCheckUtils]: 77: Hoare triple {15575#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15576#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:36,018 INFO L273 TraceCheckUtils]: 78: Hoare triple {15576#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15576#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:36,019 INFO L273 TraceCheckUtils]: 79: Hoare triple {15576#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15576#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:36,019 INFO L273 TraceCheckUtils]: 80: Hoare triple {15576#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15577#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:36,020 INFO L273 TraceCheckUtils]: 81: Hoare triple {15577#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15577#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:36,021 INFO L273 TraceCheckUtils]: 82: Hoare triple {15577#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15577#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:36,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {15577#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15578#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:36,022 INFO L273 TraceCheckUtils]: 84: Hoare triple {15578#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15578#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:36,023 INFO L273 TraceCheckUtils]: 85: Hoare triple {15578#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15578#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:36,023 INFO L273 TraceCheckUtils]: 86: Hoare triple {15578#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15579#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:36,024 INFO L273 TraceCheckUtils]: 87: Hoare triple {15579#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15579#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:36,025 INFO L273 TraceCheckUtils]: 88: Hoare triple {15579#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15579#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:36,026 INFO L273 TraceCheckUtils]: 89: Hoare triple {15579#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15580#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:36,026 INFO L273 TraceCheckUtils]: 90: Hoare triple {15580#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15580#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:36,027 INFO L273 TraceCheckUtils]: 91: Hoare triple {15580#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {15580#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:36,028 INFO L273 TraceCheckUtils]: 92: Hoare triple {15580#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15581#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:36,028 INFO L273 TraceCheckUtils]: 93: Hoare triple {15581#(<= main_~i~0 29)} assume !(~i~0 < 100000); {15551#false} is VALID [2018-11-23 12:06:36,028 INFO L273 TraceCheckUtils]: 94: Hoare triple {15551#false} havoc ~x~0;~x~0 := 0; {15551#false} is VALID [2018-11-23 12:06:36,029 INFO L273 TraceCheckUtils]: 95: Hoare triple {15551#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {15551#false} is VALID [2018-11-23 12:06:36,029 INFO L256 TraceCheckUtils]: 96: Hoare triple {15551#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {15551#false} is VALID [2018-11-23 12:06:36,029 INFO L273 TraceCheckUtils]: 97: Hoare triple {15551#false} ~cond := #in~cond; {15551#false} is VALID [2018-11-23 12:06:36,029 INFO L273 TraceCheckUtils]: 98: Hoare triple {15551#false} assume 0 == ~cond; {15551#false} is VALID [2018-11-23 12:06:36,029 INFO L273 TraceCheckUtils]: 99: Hoare triple {15551#false} assume !false; {15551#false} is VALID [2018-11-23 12:06:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:36,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:36,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 12:06:36,059 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 12:06:36,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:36,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:06:36,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:36,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:06:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:06:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:06:36,179 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 33 states. [2018-11-23 12:06:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:37,090 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2018-11-23 12:06:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:06:37,091 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-23 12:06:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:06:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 168 transitions. [2018-11-23 12:06:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:06:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 168 transitions. [2018-11-23 12:06:37,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 168 transitions. [2018-11-23 12:06:37,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:37,281 INFO L225 Difference]: With dead ends: 131 [2018-11-23 12:06:37,281 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 12:06:37,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:06:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 12:06:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-23 12:06:37,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:37,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-23 12:06:37,334 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-23 12:06:37,334 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-23 12:06:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:37,336 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2018-11-23 12:06:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2018-11-23 12:06:37,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:37,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:37,337 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-23 12:06:37,337 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-23 12:06:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:37,339 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2018-11-23 12:06:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2018-11-23 12:06:37,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:37,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:37,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:37,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:06:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2018-11-23 12:06:37,342 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 100 [2018-11-23 12:06:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:37,343 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2018-11-23 12:06:37,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:06:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2018-11-23 12:06:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:06:37,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:37,343 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:37,344 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:37,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1042875993, now seen corresponding path program 30 times [2018-11-23 12:06:37,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:37,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:37,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:38,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {16441#true} call ULTIMATE.init(); {16441#true} is VALID [2018-11-23 12:06:38,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {16441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16441#true} is VALID [2018-11-23 12:06:38,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {16441#true} assume true; {16441#true} is VALID [2018-11-23 12:06:38,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16441#true} {16441#true} #70#return; {16441#true} is VALID [2018-11-23 12:06:38,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {16441#true} call #t~ret7 := main(); {16441#true} is VALID [2018-11-23 12:06:38,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {16441#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {16443#(= main_~i~0 0)} is VALID [2018-11-23 12:06:38,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {16443#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16443#(= main_~i~0 0)} is VALID [2018-11-23 12:06:38,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {16443#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16443#(= main_~i~0 0)} is VALID [2018-11-23 12:06:38,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {16443#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {16444#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {16444#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:38,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {16444#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {16445#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {16445#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:38,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {16445#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {16446#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {16446#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:38,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {16446#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {16447#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {16447#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:38,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {16447#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {16448#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,345 INFO L273 TraceCheckUtils]: 22: Hoare triple {16448#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:38,346 INFO L273 TraceCheckUtils]: 23: Hoare triple {16448#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {16449#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {16449#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:38,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {16449#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {16450#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {16450#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:38,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {16450#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {16451#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {16451#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:38,352 INFO L273 TraceCheckUtils]: 32: Hoare triple {16451#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,353 INFO L273 TraceCheckUtils]: 33: Hoare triple {16452#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {16452#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:38,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {16452#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {16453#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {16453#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:38,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {16453#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,357 INFO L273 TraceCheckUtils]: 39: Hoare triple {16454#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {16454#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:38,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {16454#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {16455#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,359 INFO L273 TraceCheckUtils]: 43: Hoare triple {16455#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:38,360 INFO L273 TraceCheckUtils]: 44: Hoare triple {16455#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {16456#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,361 INFO L273 TraceCheckUtils]: 46: Hoare triple {16456#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:38,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {16456#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,362 INFO L273 TraceCheckUtils]: 48: Hoare triple {16457#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,363 INFO L273 TraceCheckUtils]: 49: Hoare triple {16457#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:38,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {16457#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,364 INFO L273 TraceCheckUtils]: 51: Hoare triple {16458#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {16458#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:38,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {16458#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,366 INFO L273 TraceCheckUtils]: 54: Hoare triple {16459#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,367 INFO L273 TraceCheckUtils]: 55: Hoare triple {16459#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:38,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {16459#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,369 INFO L273 TraceCheckUtils]: 57: Hoare triple {16460#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {16460#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:38,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {16460#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,371 INFO L273 TraceCheckUtils]: 60: Hoare triple {16461#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {16461#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:38,372 INFO L273 TraceCheckUtils]: 62: Hoare triple {16461#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,373 INFO L273 TraceCheckUtils]: 63: Hoare triple {16462#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,373 INFO L273 TraceCheckUtils]: 64: Hoare triple {16462#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:38,374 INFO L273 TraceCheckUtils]: 65: Hoare triple {16462#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,375 INFO L273 TraceCheckUtils]: 66: Hoare triple {16463#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,375 INFO L273 TraceCheckUtils]: 67: Hoare triple {16463#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:38,376 INFO L273 TraceCheckUtils]: 68: Hoare triple {16463#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,376 INFO L273 TraceCheckUtils]: 69: Hoare triple {16464#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,377 INFO L273 TraceCheckUtils]: 70: Hoare triple {16464#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:38,378 INFO L273 TraceCheckUtils]: 71: Hoare triple {16464#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,379 INFO L273 TraceCheckUtils]: 72: Hoare triple {16465#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,379 INFO L273 TraceCheckUtils]: 73: Hoare triple {16465#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:38,380 INFO L273 TraceCheckUtils]: 74: Hoare triple {16465#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,381 INFO L273 TraceCheckUtils]: 75: Hoare triple {16466#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,381 INFO L273 TraceCheckUtils]: 76: Hoare triple {16466#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:38,382 INFO L273 TraceCheckUtils]: 77: Hoare triple {16466#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,383 INFO L273 TraceCheckUtils]: 78: Hoare triple {16467#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,383 INFO L273 TraceCheckUtils]: 79: Hoare triple {16467#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:38,384 INFO L273 TraceCheckUtils]: 80: Hoare triple {16467#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,385 INFO L273 TraceCheckUtils]: 81: Hoare triple {16468#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,385 INFO L273 TraceCheckUtils]: 82: Hoare triple {16468#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:38,386 INFO L273 TraceCheckUtils]: 83: Hoare triple {16468#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16469#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,387 INFO L273 TraceCheckUtils]: 84: Hoare triple {16469#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16469#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,387 INFO L273 TraceCheckUtils]: 85: Hoare triple {16469#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16469#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:38,388 INFO L273 TraceCheckUtils]: 86: Hoare triple {16469#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16470#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,389 INFO L273 TraceCheckUtils]: 87: Hoare triple {16470#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16470#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,389 INFO L273 TraceCheckUtils]: 88: Hoare triple {16470#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16470#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:38,390 INFO L273 TraceCheckUtils]: 89: Hoare triple {16470#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16471#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,391 INFO L273 TraceCheckUtils]: 90: Hoare triple {16471#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16471#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,391 INFO L273 TraceCheckUtils]: 91: Hoare triple {16471#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16471#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:38,392 INFO L273 TraceCheckUtils]: 92: Hoare triple {16471#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16472#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,393 INFO L273 TraceCheckUtils]: 93: Hoare triple {16472#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16472#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,393 INFO L273 TraceCheckUtils]: 94: Hoare triple {16472#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16472#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:38,394 INFO L273 TraceCheckUtils]: 95: Hoare triple {16472#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16473#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:38,395 INFO L273 TraceCheckUtils]: 96: Hoare triple {16473#(<= main_~i~0 30)} assume !(~i~0 < 100000); {16442#false} is VALID [2018-11-23 12:06:38,395 INFO L273 TraceCheckUtils]: 97: Hoare triple {16442#false} havoc ~x~0;~x~0 := 0; {16442#false} is VALID [2018-11-23 12:06:38,395 INFO L273 TraceCheckUtils]: 98: Hoare triple {16442#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {16442#false} is VALID [2018-11-23 12:06:38,396 INFO L256 TraceCheckUtils]: 99: Hoare triple {16442#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {16442#false} is VALID [2018-11-23 12:06:38,396 INFO L273 TraceCheckUtils]: 100: Hoare triple {16442#false} ~cond := #in~cond; {16442#false} is VALID [2018-11-23 12:06:38,396 INFO L273 TraceCheckUtils]: 101: Hoare triple {16442#false} assume 0 == ~cond; {16442#false} is VALID [2018-11-23 12:06:38,396 INFO L273 TraceCheckUtils]: 102: Hoare triple {16442#false} assume !false; {16442#false} is VALID [2018-11-23 12:06:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:38,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:38,405 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 12:06:38,414 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:06:48,298 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 12:06:48,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:48,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:48,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {16441#true} call ULTIMATE.init(); {16441#true} is VALID [2018-11-23 12:06:48,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {16441#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16441#true} is VALID [2018-11-23 12:06:48,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {16441#true} assume true; {16441#true} is VALID [2018-11-23 12:06:48,719 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16441#true} {16441#true} #70#return; {16441#true} is VALID [2018-11-23 12:06:48,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {16441#true} call #t~ret7 := main(); {16441#true} is VALID [2018-11-23 12:06:48,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {16441#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {16492#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {16492#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16492#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {16492#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16492#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:48,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {16492#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {16444#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {16444#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16444#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:48,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {16444#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {16445#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {16445#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16445#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:48,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {16445#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {16446#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {16446#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16446#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:48,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {16446#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {16447#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {16447#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16447#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:48,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {16447#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,737 INFO L273 TraceCheckUtils]: 21: Hoare triple {16448#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {16448#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16448#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:48,739 INFO L273 TraceCheckUtils]: 23: Hoare triple {16448#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {16449#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {16449#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16449#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:48,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {16449#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {16450#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {16450#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16450#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:48,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {16450#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {16451#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {16451#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16451#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:48,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {16451#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {16452#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {16452#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16452#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:48,751 INFO L273 TraceCheckUtils]: 35: Hoare triple {16452#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {16453#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,753 INFO L273 TraceCheckUtils]: 37: Hoare triple {16453#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16453#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:48,753 INFO L273 TraceCheckUtils]: 38: Hoare triple {16453#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {16454#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {16454#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16454#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:48,757 INFO L273 TraceCheckUtils]: 41: Hoare triple {16454#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {16455#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {16455#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16455#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:48,759 INFO L273 TraceCheckUtils]: 44: Hoare triple {16455#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {16456#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,761 INFO L273 TraceCheckUtils]: 46: Hoare triple {16456#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16456#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:48,763 INFO L273 TraceCheckUtils]: 47: Hoare triple {16456#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {16457#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,765 INFO L273 TraceCheckUtils]: 49: Hoare triple {16457#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16457#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:48,765 INFO L273 TraceCheckUtils]: 50: Hoare triple {16457#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,767 INFO L273 TraceCheckUtils]: 51: Hoare triple {16458#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,767 INFO L273 TraceCheckUtils]: 52: Hoare triple {16458#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16458#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:48,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {16458#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {16459#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {16459#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16459#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:48,771 INFO L273 TraceCheckUtils]: 56: Hoare triple {16459#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,773 INFO L273 TraceCheckUtils]: 57: Hoare triple {16460#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,773 INFO L273 TraceCheckUtils]: 58: Hoare triple {16460#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16460#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:48,775 INFO L273 TraceCheckUtils]: 59: Hoare triple {16460#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {16461#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,777 INFO L273 TraceCheckUtils]: 61: Hoare triple {16461#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16461#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:48,777 INFO L273 TraceCheckUtils]: 62: Hoare triple {16461#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,779 INFO L273 TraceCheckUtils]: 63: Hoare triple {16462#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,779 INFO L273 TraceCheckUtils]: 64: Hoare triple {16462#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16462#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:48,781 INFO L273 TraceCheckUtils]: 65: Hoare triple {16462#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,781 INFO L273 TraceCheckUtils]: 66: Hoare triple {16463#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {16463#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16463#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:48,783 INFO L273 TraceCheckUtils]: 68: Hoare triple {16463#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,785 INFO L273 TraceCheckUtils]: 69: Hoare triple {16464#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,785 INFO L273 TraceCheckUtils]: 70: Hoare triple {16464#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16464#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:48,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {16464#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,787 INFO L273 TraceCheckUtils]: 72: Hoare triple {16465#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,789 INFO L273 TraceCheckUtils]: 73: Hoare triple {16465#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16465#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:48,789 INFO L273 TraceCheckUtils]: 74: Hoare triple {16465#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,791 INFO L273 TraceCheckUtils]: 75: Hoare triple {16466#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,791 INFO L273 TraceCheckUtils]: 76: Hoare triple {16466#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16466#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:48,793 INFO L273 TraceCheckUtils]: 77: Hoare triple {16466#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,793 INFO L273 TraceCheckUtils]: 78: Hoare triple {16467#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,795 INFO L273 TraceCheckUtils]: 79: Hoare triple {16467#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16467#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:48,795 INFO L273 TraceCheckUtils]: 80: Hoare triple {16467#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,797 INFO L273 TraceCheckUtils]: 81: Hoare triple {16468#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,797 INFO L273 TraceCheckUtils]: 82: Hoare triple {16468#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16468#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:48,799 INFO L273 TraceCheckUtils]: 83: Hoare triple {16468#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16469#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,801 INFO L273 TraceCheckUtils]: 84: Hoare triple {16469#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16469#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,801 INFO L273 TraceCheckUtils]: 85: Hoare triple {16469#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16469#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:48,803 INFO L273 TraceCheckUtils]: 86: Hoare triple {16469#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16470#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,803 INFO L273 TraceCheckUtils]: 87: Hoare triple {16470#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16470#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,805 INFO L273 TraceCheckUtils]: 88: Hoare triple {16470#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16470#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:48,805 INFO L273 TraceCheckUtils]: 89: Hoare triple {16470#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16471#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,807 INFO L273 TraceCheckUtils]: 90: Hoare triple {16471#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16471#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,807 INFO L273 TraceCheckUtils]: 91: Hoare triple {16471#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16471#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:48,809 INFO L273 TraceCheckUtils]: 92: Hoare triple {16471#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16472#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,809 INFO L273 TraceCheckUtils]: 93: Hoare triple {16472#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16472#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,811 INFO L273 TraceCheckUtils]: 94: Hoare triple {16472#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {16472#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:48,811 INFO L273 TraceCheckUtils]: 95: Hoare triple {16472#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16473#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:48,813 INFO L273 TraceCheckUtils]: 96: Hoare triple {16473#(<= main_~i~0 30)} assume !(~i~0 < 100000); {16442#false} is VALID [2018-11-23 12:06:48,813 INFO L273 TraceCheckUtils]: 97: Hoare triple {16442#false} havoc ~x~0;~x~0 := 0; {16442#false} is VALID [2018-11-23 12:06:48,813 INFO L273 TraceCheckUtils]: 98: Hoare triple {16442#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {16442#false} is VALID [2018-11-23 12:06:48,813 INFO L256 TraceCheckUtils]: 99: Hoare triple {16442#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {16442#false} is VALID [2018-11-23 12:06:48,813 INFO L273 TraceCheckUtils]: 100: Hoare triple {16442#false} ~cond := #in~cond; {16442#false} is VALID [2018-11-23 12:06:48,813 INFO L273 TraceCheckUtils]: 101: Hoare triple {16442#false} assume 0 == ~cond; {16442#false} is VALID [2018-11-23 12:06:48,813 INFO L273 TraceCheckUtils]: 102: Hoare triple {16442#false} assume !false; {16442#false} is VALID [2018-11-23 12:06:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:48,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:48,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:06:48,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 12:06:48,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:48,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:06:48,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:48,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:06:48,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:06:48,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:06:49,000 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 34 states. [2018-11-23 12:06:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:49,984 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2018-11-23 12:06:49,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:06:49,985 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-23 12:06:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:06:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 172 transitions. [2018-11-23 12:06:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:06:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 172 transitions. [2018-11-23 12:06:49,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 172 transitions. [2018-11-23 12:06:50,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:50,195 INFO L225 Difference]: With dead ends: 134 [2018-11-23 12:06:50,196 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 12:06:50,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:06:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 12:06:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-11-23 12:06:50,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:50,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 116 states. [2018-11-23 12:06:50,239 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 116 states. [2018-11-23 12:06:50,239 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 116 states. [2018-11-23 12:06:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:50,242 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2018-11-23 12:06:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2018-11-23 12:06:50,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:50,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:50,243 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 118 states. [2018-11-23 12:06:50,243 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 118 states. [2018-11-23 12:06:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:50,245 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2018-11-23 12:06:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2018-11-23 12:06:50,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:50,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:50,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:50,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:06:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2018-11-23 12:06:50,248 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 103 [2018-11-23 12:06:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:50,249 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2018-11-23 12:06:50,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:06:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2018-11-23 12:06:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 12:06:50,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:50,249 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:50,250 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:50,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1267907244, now seen corresponding path program 31 times [2018-11-23 12:06:50,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:50,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:51,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {17356#true} call ULTIMATE.init(); {17356#true} is VALID [2018-11-23 12:06:51,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {17356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17356#true} is VALID [2018-11-23 12:06:51,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {17356#true} assume true; {17356#true} is VALID [2018-11-23 12:06:51,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17356#true} {17356#true} #70#return; {17356#true} is VALID [2018-11-23 12:06:51,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {17356#true} call #t~ret7 := main(); {17356#true} is VALID [2018-11-23 12:06:51,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {17356#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {17358#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {17358#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17358#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {17358#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17358#(= main_~i~0 0)} is VALID [2018-11-23 12:06:51,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {17358#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17359#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {17359#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17359#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {17359#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17359#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:51,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {17359#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17360#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {17360#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17360#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {17360#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17360#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:51,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {17360#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17361#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {17361#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17361#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {17361#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17361#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:51,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {17361#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17362#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {17362#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17362#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {17362#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17362#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:51,669 INFO L273 TraceCheckUtils]: 20: Hoare triple {17362#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17363#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {17363#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17363#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {17363#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17363#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:51,671 INFO L273 TraceCheckUtils]: 23: Hoare triple {17363#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17364#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,671 INFO L273 TraceCheckUtils]: 24: Hoare triple {17364#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17364#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,672 INFO L273 TraceCheckUtils]: 25: Hoare triple {17364#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17364#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:51,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {17364#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17365#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,673 INFO L273 TraceCheckUtils]: 27: Hoare triple {17365#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17365#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {17365#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17365#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:51,675 INFO L273 TraceCheckUtils]: 29: Hoare triple {17365#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17366#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {17366#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17366#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,676 INFO L273 TraceCheckUtils]: 31: Hoare triple {17366#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17366#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:51,677 INFO L273 TraceCheckUtils]: 32: Hoare triple {17366#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17367#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:51,678 INFO L273 TraceCheckUtils]: 33: Hoare triple {17367#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17367#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:51,678 INFO L273 TraceCheckUtils]: 34: Hoare triple {17367#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17367#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:51,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {17367#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17368#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:51,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {17368#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17368#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:51,680 INFO L273 TraceCheckUtils]: 37: Hoare triple {17368#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17368#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:51,681 INFO L273 TraceCheckUtils]: 38: Hoare triple {17368#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17369#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:51,682 INFO L273 TraceCheckUtils]: 39: Hoare triple {17369#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17369#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:51,682 INFO L273 TraceCheckUtils]: 40: Hoare triple {17369#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17369#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:51,683 INFO L273 TraceCheckUtils]: 41: Hoare triple {17369#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17370#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:51,683 INFO L273 TraceCheckUtils]: 42: Hoare triple {17370#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17370#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:51,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {17370#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17370#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:51,685 INFO L273 TraceCheckUtils]: 44: Hoare triple {17370#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17371#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:51,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {17371#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17371#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:51,686 INFO L273 TraceCheckUtils]: 46: Hoare triple {17371#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17371#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:51,687 INFO L273 TraceCheckUtils]: 47: Hoare triple {17371#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17372#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:51,687 INFO L273 TraceCheckUtils]: 48: Hoare triple {17372#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17372#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:51,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {17372#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17372#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:51,689 INFO L273 TraceCheckUtils]: 50: Hoare triple {17372#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17373#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:51,689 INFO L273 TraceCheckUtils]: 51: Hoare triple {17373#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17373#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:51,690 INFO L273 TraceCheckUtils]: 52: Hoare triple {17373#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17373#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:51,691 INFO L273 TraceCheckUtils]: 53: Hoare triple {17373#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17374#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:51,691 INFO L273 TraceCheckUtils]: 54: Hoare triple {17374#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17374#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:51,692 INFO L273 TraceCheckUtils]: 55: Hoare triple {17374#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17374#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:51,693 INFO L273 TraceCheckUtils]: 56: Hoare triple {17374#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17375#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:51,693 INFO L273 TraceCheckUtils]: 57: Hoare triple {17375#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17375#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:51,694 INFO L273 TraceCheckUtils]: 58: Hoare triple {17375#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17375#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:51,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {17375#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17376#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:51,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {17376#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17376#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:51,696 INFO L273 TraceCheckUtils]: 61: Hoare triple {17376#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17376#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:51,697 INFO L273 TraceCheckUtils]: 62: Hoare triple {17376#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17377#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:51,698 INFO L273 TraceCheckUtils]: 63: Hoare triple {17377#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17377#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:51,698 INFO L273 TraceCheckUtils]: 64: Hoare triple {17377#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17377#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:51,699 INFO L273 TraceCheckUtils]: 65: Hoare triple {17377#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17378#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:51,700 INFO L273 TraceCheckUtils]: 66: Hoare triple {17378#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17378#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:51,700 INFO L273 TraceCheckUtils]: 67: Hoare triple {17378#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17378#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:51,701 INFO L273 TraceCheckUtils]: 68: Hoare triple {17378#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17379#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:51,702 INFO L273 TraceCheckUtils]: 69: Hoare triple {17379#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17379#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:51,702 INFO L273 TraceCheckUtils]: 70: Hoare triple {17379#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17379#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:51,703 INFO L273 TraceCheckUtils]: 71: Hoare triple {17379#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17380#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:51,704 INFO L273 TraceCheckUtils]: 72: Hoare triple {17380#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17380#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:51,704 INFO L273 TraceCheckUtils]: 73: Hoare triple {17380#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17380#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:51,705 INFO L273 TraceCheckUtils]: 74: Hoare triple {17380#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17381#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:51,706 INFO L273 TraceCheckUtils]: 75: Hoare triple {17381#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17381#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:51,706 INFO L273 TraceCheckUtils]: 76: Hoare triple {17381#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17381#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:51,707 INFO L273 TraceCheckUtils]: 77: Hoare triple {17381#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17382#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:51,708 INFO L273 TraceCheckUtils]: 78: Hoare triple {17382#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17382#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:51,708 INFO L273 TraceCheckUtils]: 79: Hoare triple {17382#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17382#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:51,709 INFO L273 TraceCheckUtils]: 80: Hoare triple {17382#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17383#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:51,710 INFO L273 TraceCheckUtils]: 81: Hoare triple {17383#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17383#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:51,710 INFO L273 TraceCheckUtils]: 82: Hoare triple {17383#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17383#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:51,711 INFO L273 TraceCheckUtils]: 83: Hoare triple {17383#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17384#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:51,712 INFO L273 TraceCheckUtils]: 84: Hoare triple {17384#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17384#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:51,714 INFO L273 TraceCheckUtils]: 85: Hoare triple {17384#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17384#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:51,715 INFO L273 TraceCheckUtils]: 86: Hoare triple {17384#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17385#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:51,715 INFO L273 TraceCheckUtils]: 87: Hoare triple {17385#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17385#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:51,715 INFO L273 TraceCheckUtils]: 88: Hoare triple {17385#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17385#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:51,716 INFO L273 TraceCheckUtils]: 89: Hoare triple {17385#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17386#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:51,716 INFO L273 TraceCheckUtils]: 90: Hoare triple {17386#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17386#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:51,716 INFO L273 TraceCheckUtils]: 91: Hoare triple {17386#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17386#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:51,717 INFO L273 TraceCheckUtils]: 92: Hoare triple {17386#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17387#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:51,718 INFO L273 TraceCheckUtils]: 93: Hoare triple {17387#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17387#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:51,718 INFO L273 TraceCheckUtils]: 94: Hoare triple {17387#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17387#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:51,719 INFO L273 TraceCheckUtils]: 95: Hoare triple {17387#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17388#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:51,720 INFO L273 TraceCheckUtils]: 96: Hoare triple {17388#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17388#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:51,720 INFO L273 TraceCheckUtils]: 97: Hoare triple {17388#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17388#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:51,721 INFO L273 TraceCheckUtils]: 98: Hoare triple {17388#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17389#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:51,722 INFO L273 TraceCheckUtils]: 99: Hoare triple {17389#(<= main_~i~0 31)} assume !(~i~0 < 100000); {17357#false} is VALID [2018-11-23 12:06:51,722 INFO L273 TraceCheckUtils]: 100: Hoare triple {17357#false} havoc ~x~0;~x~0 := 0; {17357#false} is VALID [2018-11-23 12:06:51,722 INFO L273 TraceCheckUtils]: 101: Hoare triple {17357#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {17357#false} is VALID [2018-11-23 12:06:51,723 INFO L256 TraceCheckUtils]: 102: Hoare triple {17357#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {17357#false} is VALID [2018-11-23 12:06:51,723 INFO L273 TraceCheckUtils]: 103: Hoare triple {17357#false} ~cond := #in~cond; {17357#false} is VALID [2018-11-23 12:06:51,723 INFO L273 TraceCheckUtils]: 104: Hoare triple {17357#false} assume 0 == ~cond; {17357#false} is VALID [2018-11-23 12:06:51,723 INFO L273 TraceCheckUtils]: 105: Hoare triple {17357#false} assume !false; {17357#false} is VALID [2018-11-23 12:06:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:51,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:51,733 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 12:06:51,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:51,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:52,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {17356#true} call ULTIMATE.init(); {17356#true} is VALID [2018-11-23 12:06:52,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {17356#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17356#true} is VALID [2018-11-23 12:06:52,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {17356#true} assume true; {17356#true} is VALID [2018-11-23 12:06:52,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17356#true} {17356#true} #70#return; {17356#true} is VALID [2018-11-23 12:06:52,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {17356#true} call #t~ret7 := main(); {17356#true} is VALID [2018-11-23 12:06:52,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {17356#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {17408#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:52,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {17408#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17408#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:52,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {17408#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17408#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:52,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {17408#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17359#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {17359#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17359#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {17359#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17359#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:52,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {17359#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17360#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {17360#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17360#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {17360#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17360#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:52,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {17360#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17361#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {17361#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17361#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {17361#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17361#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:52,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {17361#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17362#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {17362#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17362#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {17362#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17362#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:52,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {17362#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17363#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,165 INFO L273 TraceCheckUtils]: 21: Hoare triple {17363#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17363#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,166 INFO L273 TraceCheckUtils]: 22: Hoare triple {17363#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17363#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:52,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {17363#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17364#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {17364#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17364#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {17364#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17364#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:52,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {17364#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17365#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,170 INFO L273 TraceCheckUtils]: 27: Hoare triple {17365#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17365#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,171 INFO L273 TraceCheckUtils]: 28: Hoare triple {17365#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17365#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:52,172 INFO L273 TraceCheckUtils]: 29: Hoare triple {17365#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17366#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {17366#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17366#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {17366#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17366#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:52,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {17366#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17367#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {17367#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17367#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {17367#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17367#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:52,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {17367#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17368#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {17368#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17368#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {17368#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17368#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:52,178 INFO L273 TraceCheckUtils]: 38: Hoare triple {17368#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17369#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,179 INFO L273 TraceCheckUtils]: 39: Hoare triple {17369#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17369#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {17369#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17369#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:52,180 INFO L273 TraceCheckUtils]: 41: Hoare triple {17369#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17370#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,181 INFO L273 TraceCheckUtils]: 42: Hoare triple {17370#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17370#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {17370#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17370#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:52,182 INFO L273 TraceCheckUtils]: 44: Hoare triple {17370#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17371#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,183 INFO L273 TraceCheckUtils]: 45: Hoare triple {17371#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17371#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,183 INFO L273 TraceCheckUtils]: 46: Hoare triple {17371#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17371#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:52,184 INFO L273 TraceCheckUtils]: 47: Hoare triple {17371#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17372#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,185 INFO L273 TraceCheckUtils]: 48: Hoare triple {17372#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17372#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {17372#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17372#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:52,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {17372#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17373#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,187 INFO L273 TraceCheckUtils]: 51: Hoare triple {17373#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17373#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {17373#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17373#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:52,188 INFO L273 TraceCheckUtils]: 53: Hoare triple {17373#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17374#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,189 INFO L273 TraceCheckUtils]: 54: Hoare triple {17374#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17374#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,189 INFO L273 TraceCheckUtils]: 55: Hoare triple {17374#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17374#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:52,190 INFO L273 TraceCheckUtils]: 56: Hoare triple {17374#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17375#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,191 INFO L273 TraceCheckUtils]: 57: Hoare triple {17375#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17375#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,191 INFO L273 TraceCheckUtils]: 58: Hoare triple {17375#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17375#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:52,192 INFO L273 TraceCheckUtils]: 59: Hoare triple {17375#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17376#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,193 INFO L273 TraceCheckUtils]: 60: Hoare triple {17376#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17376#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,193 INFO L273 TraceCheckUtils]: 61: Hoare triple {17376#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17376#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:52,194 INFO L273 TraceCheckUtils]: 62: Hoare triple {17376#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17377#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,195 INFO L273 TraceCheckUtils]: 63: Hoare triple {17377#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17377#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,196 INFO L273 TraceCheckUtils]: 64: Hoare triple {17377#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17377#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:52,196 INFO L273 TraceCheckUtils]: 65: Hoare triple {17377#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17378#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,197 INFO L273 TraceCheckUtils]: 66: Hoare triple {17378#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17378#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,198 INFO L273 TraceCheckUtils]: 67: Hoare triple {17378#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17378#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:52,198 INFO L273 TraceCheckUtils]: 68: Hoare triple {17378#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17379#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,199 INFO L273 TraceCheckUtils]: 69: Hoare triple {17379#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17379#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,200 INFO L273 TraceCheckUtils]: 70: Hoare triple {17379#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17379#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:52,200 INFO L273 TraceCheckUtils]: 71: Hoare triple {17379#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17380#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,201 INFO L273 TraceCheckUtils]: 72: Hoare triple {17380#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17380#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,202 INFO L273 TraceCheckUtils]: 73: Hoare triple {17380#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17380#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:52,202 INFO L273 TraceCheckUtils]: 74: Hoare triple {17380#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17381#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,203 INFO L273 TraceCheckUtils]: 75: Hoare triple {17381#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17381#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,204 INFO L273 TraceCheckUtils]: 76: Hoare triple {17381#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17381#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:52,204 INFO L273 TraceCheckUtils]: 77: Hoare triple {17381#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17382#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,205 INFO L273 TraceCheckUtils]: 78: Hoare triple {17382#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17382#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,206 INFO L273 TraceCheckUtils]: 79: Hoare triple {17382#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17382#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:52,207 INFO L273 TraceCheckUtils]: 80: Hoare triple {17382#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17383#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,207 INFO L273 TraceCheckUtils]: 81: Hoare triple {17383#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17383#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,208 INFO L273 TraceCheckUtils]: 82: Hoare triple {17383#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17383#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:52,209 INFO L273 TraceCheckUtils]: 83: Hoare triple {17383#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17384#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:52,209 INFO L273 TraceCheckUtils]: 84: Hoare triple {17384#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17384#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:52,210 INFO L273 TraceCheckUtils]: 85: Hoare triple {17384#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17384#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:52,211 INFO L273 TraceCheckUtils]: 86: Hoare triple {17384#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17385#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:52,211 INFO L273 TraceCheckUtils]: 87: Hoare triple {17385#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17385#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:52,212 INFO L273 TraceCheckUtils]: 88: Hoare triple {17385#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17385#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:52,213 INFO L273 TraceCheckUtils]: 89: Hoare triple {17385#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17386#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:52,213 INFO L273 TraceCheckUtils]: 90: Hoare triple {17386#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17386#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:52,214 INFO L273 TraceCheckUtils]: 91: Hoare triple {17386#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17386#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:52,215 INFO L273 TraceCheckUtils]: 92: Hoare triple {17386#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17387#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:52,216 INFO L273 TraceCheckUtils]: 93: Hoare triple {17387#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17387#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:52,216 INFO L273 TraceCheckUtils]: 94: Hoare triple {17387#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17387#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:52,217 INFO L273 TraceCheckUtils]: 95: Hoare triple {17387#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17388#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:52,218 INFO L273 TraceCheckUtils]: 96: Hoare triple {17388#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17388#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:52,218 INFO L273 TraceCheckUtils]: 97: Hoare triple {17388#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {17388#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:52,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {17388#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17389#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:52,220 INFO L273 TraceCheckUtils]: 99: Hoare triple {17389#(<= main_~i~0 31)} assume !(~i~0 < 100000); {17357#false} is VALID [2018-11-23 12:06:52,220 INFO L273 TraceCheckUtils]: 100: Hoare triple {17357#false} havoc ~x~0;~x~0 := 0; {17357#false} is VALID [2018-11-23 12:06:52,220 INFO L273 TraceCheckUtils]: 101: Hoare triple {17357#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {17357#false} is VALID [2018-11-23 12:06:52,220 INFO L256 TraceCheckUtils]: 102: Hoare triple {17357#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {17357#false} is VALID [2018-11-23 12:06:52,220 INFO L273 TraceCheckUtils]: 103: Hoare triple {17357#false} ~cond := #in~cond; {17357#false} is VALID [2018-11-23 12:06:52,221 INFO L273 TraceCheckUtils]: 104: Hoare triple {17357#false} assume 0 == ~cond; {17357#false} is VALID [2018-11-23 12:06:52,221 INFO L273 TraceCheckUtils]: 105: Hoare triple {17357#false} assume !false; {17357#false} is VALID [2018-11-23 12:06:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:52,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:52,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:06:52,249 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 12:06:52,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:52,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:06:52,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:52,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:06:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:06:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:06:52,383 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand 35 states. [2018-11-23 12:06:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:53,371 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2018-11-23 12:06:53,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:06:53,371 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-23 12:06:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 176 transitions. [2018-11-23 12:06:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:06:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 176 transitions. [2018-11-23 12:06:53,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 176 transitions. [2018-11-23 12:06:53,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:53,621 INFO L225 Difference]: With dead ends: 137 [2018-11-23 12:06:53,621 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:06:53,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:06:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:06:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:06:53,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:53,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:06:53,667 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:06:53,668 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:06:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:53,670 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2018-11-23 12:06:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2018-11-23 12:06:53,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:53,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:53,671 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:06:53,671 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:06:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:53,673 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2018-11-23 12:06:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2018-11-23 12:06:53,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:53,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:53,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:53,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:06:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2018-11-23 12:06:53,676 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 106 [2018-11-23 12:06:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:53,676 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2018-11-23 12:06:53,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:06:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2018-11-23 12:06:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 12:06:53,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:53,677 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:53,678 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:53,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash -729956729, now seen corresponding path program 32 times [2018-11-23 12:06:53,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:53,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:53,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:06:53,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:54,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {18295#true} call ULTIMATE.init(); {18295#true} is VALID [2018-11-23 12:06:54,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {18295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18295#true} is VALID [2018-11-23 12:06:54,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {18295#true} assume true; {18295#true} is VALID [2018-11-23 12:06:54,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18295#true} {18295#true} #70#return; {18295#true} is VALID [2018-11-23 12:06:54,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {18295#true} call #t~ret7 := main(); {18295#true} is VALID [2018-11-23 12:06:54,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {18295#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {18297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:54,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {18297#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:54,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {18297#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18297#(= main_~i~0 0)} is VALID [2018-11-23 12:06:54,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {18297#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:54,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {18298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:54,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {18298#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:54,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {18298#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:54,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {18299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:54,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {18299#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:54,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {18299#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:54,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {18300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:54,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {18300#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:54,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {18300#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:54,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {18301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:54,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {18301#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:54,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {18301#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:54,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {18302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:54,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {18302#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:54,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {18302#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:54,845 INFO L273 TraceCheckUtils]: 24: Hoare triple {18303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:54,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {18303#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:54,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {18303#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:54,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {18304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:54,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {18304#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:54,849 INFO L273 TraceCheckUtils]: 29: Hoare triple {18304#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:54,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {18305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:54,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {18305#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:54,851 INFO L273 TraceCheckUtils]: 32: Hoare triple {18305#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:54,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {18306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:54,852 INFO L273 TraceCheckUtils]: 34: Hoare triple {18306#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:54,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {18306#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:54,853 INFO L273 TraceCheckUtils]: 36: Hoare triple {18307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:54,854 INFO L273 TraceCheckUtils]: 37: Hoare triple {18307#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:54,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {18307#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:54,856 INFO L273 TraceCheckUtils]: 39: Hoare triple {18308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:54,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {18308#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:54,857 INFO L273 TraceCheckUtils]: 41: Hoare triple {18308#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:54,858 INFO L273 TraceCheckUtils]: 42: Hoare triple {18309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:54,858 INFO L273 TraceCheckUtils]: 43: Hoare triple {18309#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:54,859 INFO L273 TraceCheckUtils]: 44: Hoare triple {18309#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:54,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {18310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:54,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {18310#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:54,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {18310#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:54,862 INFO L273 TraceCheckUtils]: 48: Hoare triple {18311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:54,862 INFO L273 TraceCheckUtils]: 49: Hoare triple {18311#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:54,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {18311#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:54,864 INFO L273 TraceCheckUtils]: 51: Hoare triple {18312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:54,864 INFO L273 TraceCheckUtils]: 52: Hoare triple {18312#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:54,865 INFO L273 TraceCheckUtils]: 53: Hoare triple {18312#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:54,866 INFO L273 TraceCheckUtils]: 54: Hoare triple {18313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:54,866 INFO L273 TraceCheckUtils]: 55: Hoare triple {18313#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:54,867 INFO L273 TraceCheckUtils]: 56: Hoare triple {18313#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:54,868 INFO L273 TraceCheckUtils]: 57: Hoare triple {18314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:54,868 INFO L273 TraceCheckUtils]: 58: Hoare triple {18314#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:54,869 INFO L273 TraceCheckUtils]: 59: Hoare triple {18314#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:54,870 INFO L273 TraceCheckUtils]: 60: Hoare triple {18315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:54,870 INFO L273 TraceCheckUtils]: 61: Hoare triple {18315#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:54,871 INFO L273 TraceCheckUtils]: 62: Hoare triple {18315#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:54,872 INFO L273 TraceCheckUtils]: 63: Hoare triple {18316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:54,873 INFO L273 TraceCheckUtils]: 64: Hoare triple {18316#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:54,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {18316#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:54,874 INFO L273 TraceCheckUtils]: 66: Hoare triple {18317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:54,875 INFO L273 TraceCheckUtils]: 67: Hoare triple {18317#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:54,875 INFO L273 TraceCheckUtils]: 68: Hoare triple {18317#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:54,876 INFO L273 TraceCheckUtils]: 69: Hoare triple {18318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:54,876 INFO L273 TraceCheckUtils]: 70: Hoare triple {18318#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:54,877 INFO L273 TraceCheckUtils]: 71: Hoare triple {18318#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:54,878 INFO L273 TraceCheckUtils]: 72: Hoare triple {18319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:54,879 INFO L273 TraceCheckUtils]: 73: Hoare triple {18319#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:54,879 INFO L273 TraceCheckUtils]: 74: Hoare triple {18319#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:54,880 INFO L273 TraceCheckUtils]: 75: Hoare triple {18320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:54,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {18320#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:54,881 INFO L273 TraceCheckUtils]: 77: Hoare triple {18320#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:54,882 INFO L273 TraceCheckUtils]: 78: Hoare triple {18321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:54,882 INFO L273 TraceCheckUtils]: 79: Hoare triple {18321#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:54,883 INFO L273 TraceCheckUtils]: 80: Hoare triple {18321#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:54,884 INFO L273 TraceCheckUtils]: 81: Hoare triple {18322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:54,884 INFO L273 TraceCheckUtils]: 82: Hoare triple {18322#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:54,885 INFO L273 TraceCheckUtils]: 83: Hoare triple {18322#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:54,886 INFO L273 TraceCheckUtils]: 84: Hoare triple {18323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:54,886 INFO L273 TraceCheckUtils]: 85: Hoare triple {18323#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:54,887 INFO L273 TraceCheckUtils]: 86: Hoare triple {18323#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:54,888 INFO L273 TraceCheckUtils]: 87: Hoare triple {18324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:54,888 INFO L273 TraceCheckUtils]: 88: Hoare triple {18324#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:54,889 INFO L273 TraceCheckUtils]: 89: Hoare triple {18324#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:54,890 INFO L273 TraceCheckUtils]: 90: Hoare triple {18325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:54,890 INFO L273 TraceCheckUtils]: 91: Hoare triple {18325#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:54,891 INFO L273 TraceCheckUtils]: 92: Hoare triple {18325#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:54,892 INFO L273 TraceCheckUtils]: 93: Hoare triple {18326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:54,892 INFO L273 TraceCheckUtils]: 94: Hoare triple {18326#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:54,893 INFO L273 TraceCheckUtils]: 95: Hoare triple {18326#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:54,894 INFO L273 TraceCheckUtils]: 96: Hoare triple {18327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:54,894 INFO L273 TraceCheckUtils]: 97: Hoare triple {18327#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:54,895 INFO L273 TraceCheckUtils]: 98: Hoare triple {18327#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:54,896 INFO L273 TraceCheckUtils]: 99: Hoare triple {18328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:54,896 INFO L273 TraceCheckUtils]: 100: Hoare triple {18328#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:54,897 INFO L273 TraceCheckUtils]: 101: Hoare triple {18328#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:54,898 INFO L273 TraceCheckUtils]: 102: Hoare triple {18329#(<= main_~i~0 32)} assume !(~i~0 < 100000); {18296#false} is VALID [2018-11-23 12:06:54,898 INFO L273 TraceCheckUtils]: 103: Hoare triple {18296#false} havoc ~x~0;~x~0 := 0; {18296#false} is VALID [2018-11-23 12:06:54,898 INFO L273 TraceCheckUtils]: 104: Hoare triple {18296#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {18296#false} is VALID [2018-11-23 12:06:54,899 INFO L256 TraceCheckUtils]: 105: Hoare triple {18296#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {18296#false} is VALID [2018-11-23 12:06:54,899 INFO L273 TraceCheckUtils]: 106: Hoare triple {18296#false} ~cond := #in~cond; {18296#false} is VALID [2018-11-23 12:06:54,899 INFO L273 TraceCheckUtils]: 107: Hoare triple {18296#false} assume 0 == ~cond; {18296#false} is VALID [2018-11-23 12:06:54,899 INFO L273 TraceCheckUtils]: 108: Hoare triple {18296#false} assume !false; {18296#false} is VALID [2018-11-23 12:06:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:54,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:54,912 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 12:06:54,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:06:54,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:06:54,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:06:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:55,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:06:55,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {18295#true} call ULTIMATE.init(); {18295#true} is VALID [2018-11-23 12:06:55,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {18295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18295#true} is VALID [2018-11-23 12:06:55,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {18295#true} assume true; {18295#true} is VALID [2018-11-23 12:06:55,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18295#true} {18295#true} #70#return; {18295#true} is VALID [2018-11-23 12:06:55,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {18295#true} call #t~ret7 := main(); {18295#true} is VALID [2018-11-23 12:06:55,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {18295#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {18348#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:55,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {18348#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18348#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:55,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {18348#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18348#(<= main_~i~0 0)} is VALID [2018-11-23 12:06:55,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {18348#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:55,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {18298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:55,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {18298#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18298#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:55,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {18298#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:55,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {18299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:55,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {18299#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18299#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:55,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {18299#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:55,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {18300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:55,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {18300#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18300#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:55,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {18300#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:55,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {18301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:55,413 INFO L273 TraceCheckUtils]: 19: Hoare triple {18301#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18301#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:55,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {18301#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:55,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {18302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:55,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {18302#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18302#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:55,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {18302#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:55,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {18303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:55,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {18303#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18303#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:55,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {18303#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:55,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {18304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:55,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {18304#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18304#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:55,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {18304#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:55,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {18305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:55,421 INFO L273 TraceCheckUtils]: 31: Hoare triple {18305#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18305#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:55,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {18305#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:55,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {18306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:55,424 INFO L273 TraceCheckUtils]: 34: Hoare triple {18306#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18306#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:55,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {18306#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:55,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {18307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:55,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {18307#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18307#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:55,426 INFO L273 TraceCheckUtils]: 38: Hoare triple {18307#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:55,427 INFO L273 TraceCheckUtils]: 39: Hoare triple {18308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:55,428 INFO L273 TraceCheckUtils]: 40: Hoare triple {18308#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18308#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:55,428 INFO L273 TraceCheckUtils]: 41: Hoare triple {18308#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:55,429 INFO L273 TraceCheckUtils]: 42: Hoare triple {18309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:55,430 INFO L273 TraceCheckUtils]: 43: Hoare triple {18309#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18309#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:55,430 INFO L273 TraceCheckUtils]: 44: Hoare triple {18309#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:55,431 INFO L273 TraceCheckUtils]: 45: Hoare triple {18310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:55,431 INFO L273 TraceCheckUtils]: 46: Hoare triple {18310#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18310#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:55,432 INFO L273 TraceCheckUtils]: 47: Hoare triple {18310#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:55,433 INFO L273 TraceCheckUtils]: 48: Hoare triple {18311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:55,433 INFO L273 TraceCheckUtils]: 49: Hoare triple {18311#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18311#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:55,434 INFO L273 TraceCheckUtils]: 50: Hoare triple {18311#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:55,435 INFO L273 TraceCheckUtils]: 51: Hoare triple {18312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:55,436 INFO L273 TraceCheckUtils]: 52: Hoare triple {18312#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18312#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:55,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {18312#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:55,437 INFO L273 TraceCheckUtils]: 54: Hoare triple {18313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:55,437 INFO L273 TraceCheckUtils]: 55: Hoare triple {18313#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18313#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:55,438 INFO L273 TraceCheckUtils]: 56: Hoare triple {18313#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:55,439 INFO L273 TraceCheckUtils]: 57: Hoare triple {18314#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:55,440 INFO L273 TraceCheckUtils]: 58: Hoare triple {18314#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18314#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:55,440 INFO L273 TraceCheckUtils]: 59: Hoare triple {18314#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:55,441 INFO L273 TraceCheckUtils]: 60: Hoare triple {18315#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:55,441 INFO L273 TraceCheckUtils]: 61: Hoare triple {18315#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18315#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:55,442 INFO L273 TraceCheckUtils]: 62: Hoare triple {18315#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:55,443 INFO L273 TraceCheckUtils]: 63: Hoare triple {18316#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:55,447 INFO L273 TraceCheckUtils]: 64: Hoare triple {18316#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18316#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:55,447 INFO L273 TraceCheckUtils]: 65: Hoare triple {18316#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:55,448 INFO L273 TraceCheckUtils]: 66: Hoare triple {18317#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:55,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {18317#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18317#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:55,449 INFO L273 TraceCheckUtils]: 68: Hoare triple {18317#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:55,451 INFO L273 TraceCheckUtils]: 69: Hoare triple {18318#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:55,452 INFO L273 TraceCheckUtils]: 70: Hoare triple {18318#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18318#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:55,452 INFO L273 TraceCheckUtils]: 71: Hoare triple {18318#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:55,453 INFO L273 TraceCheckUtils]: 72: Hoare triple {18319#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:55,453 INFO L273 TraceCheckUtils]: 73: Hoare triple {18319#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18319#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:55,454 INFO L273 TraceCheckUtils]: 74: Hoare triple {18319#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:55,454 INFO L273 TraceCheckUtils]: 75: Hoare triple {18320#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:55,454 INFO L273 TraceCheckUtils]: 76: Hoare triple {18320#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18320#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:55,455 INFO L273 TraceCheckUtils]: 77: Hoare triple {18320#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:55,455 INFO L273 TraceCheckUtils]: 78: Hoare triple {18321#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:55,455 INFO L273 TraceCheckUtils]: 79: Hoare triple {18321#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18321#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:55,456 INFO L273 TraceCheckUtils]: 80: Hoare triple {18321#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:55,457 INFO L273 TraceCheckUtils]: 81: Hoare triple {18322#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:55,457 INFO L273 TraceCheckUtils]: 82: Hoare triple {18322#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18322#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:55,458 INFO L273 TraceCheckUtils]: 83: Hoare triple {18322#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:55,459 INFO L273 TraceCheckUtils]: 84: Hoare triple {18323#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:55,459 INFO L273 TraceCheckUtils]: 85: Hoare triple {18323#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18323#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:55,460 INFO L273 TraceCheckUtils]: 86: Hoare triple {18323#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:55,461 INFO L273 TraceCheckUtils]: 87: Hoare triple {18324#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:55,461 INFO L273 TraceCheckUtils]: 88: Hoare triple {18324#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18324#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:55,462 INFO L273 TraceCheckUtils]: 89: Hoare triple {18324#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:55,463 INFO L273 TraceCheckUtils]: 90: Hoare triple {18325#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:55,464 INFO L273 TraceCheckUtils]: 91: Hoare triple {18325#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18325#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:55,464 INFO L273 TraceCheckUtils]: 92: Hoare triple {18325#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:55,465 INFO L273 TraceCheckUtils]: 93: Hoare triple {18326#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:55,465 INFO L273 TraceCheckUtils]: 94: Hoare triple {18326#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18326#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:55,466 INFO L273 TraceCheckUtils]: 95: Hoare triple {18326#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:55,467 INFO L273 TraceCheckUtils]: 96: Hoare triple {18327#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:55,467 INFO L273 TraceCheckUtils]: 97: Hoare triple {18327#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18327#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:55,468 INFO L273 TraceCheckUtils]: 98: Hoare triple {18327#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:55,469 INFO L273 TraceCheckUtils]: 99: Hoare triple {18328#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:55,469 INFO L273 TraceCheckUtils]: 100: Hoare triple {18328#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {18328#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:55,470 INFO L273 TraceCheckUtils]: 101: Hoare triple {18328#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18329#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:55,471 INFO L273 TraceCheckUtils]: 102: Hoare triple {18329#(<= main_~i~0 32)} assume !(~i~0 < 100000); {18296#false} is VALID [2018-11-23 12:06:55,471 INFO L273 TraceCheckUtils]: 103: Hoare triple {18296#false} havoc ~x~0;~x~0 := 0; {18296#false} is VALID [2018-11-23 12:06:55,471 INFO L273 TraceCheckUtils]: 104: Hoare triple {18296#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {18296#false} is VALID [2018-11-23 12:06:55,472 INFO L256 TraceCheckUtils]: 105: Hoare triple {18296#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {18296#false} is VALID [2018-11-23 12:06:55,472 INFO L273 TraceCheckUtils]: 106: Hoare triple {18296#false} ~cond := #in~cond; {18296#false} is VALID [2018-11-23 12:06:55,472 INFO L273 TraceCheckUtils]: 107: Hoare triple {18296#false} assume 0 == ~cond; {18296#false} is VALID [2018-11-23 12:06:55,472 INFO L273 TraceCheckUtils]: 108: Hoare triple {18296#false} assume !false; {18296#false} is VALID [2018-11-23 12:06:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:55,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:06:55,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:06:55,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 12:06:55,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:06:55,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:06:55,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:55,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:06:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:06:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:06:55,639 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand 36 states. [2018-11-23 12:06:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:56,570 INFO L93 Difference]: Finished difference Result 140 states and 180 transitions. [2018-11-23 12:06:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:06:56,571 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-23 12:06:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:06:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 180 transitions. [2018-11-23 12:06:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:06:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 180 transitions. [2018-11-23 12:06:56,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 180 transitions. [2018-11-23 12:06:56,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:06:56,877 INFO L225 Difference]: With dead ends: 140 [2018-11-23 12:06:56,877 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 12:06:56,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:06:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 12:06:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-23 12:06:56,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:06:56,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-23 12:06:56,933 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-23 12:06:56,934 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-23 12:06:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:56,936 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2018-11-23 12:06:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 161 transitions. [2018-11-23 12:06:56,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:56,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:56,937 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-23 12:06:56,937 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-23 12:06:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:06:56,939 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2018-11-23 12:06:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 161 transitions. [2018-11-23 12:06:56,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:06:56,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:06:56,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:06:56,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:06:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 12:06:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2018-11-23 12:06:56,942 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 109 [2018-11-23 12:06:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:06:56,942 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2018-11-23 12:06:56,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:06:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 12:06:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 12:06:56,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:06:56,943 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:06:56,944 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:06:56,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:06:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash 830854260, now seen corresponding path program 33 times [2018-11-23 12:06:56,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:06:56,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:06:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:56,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:06:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:06:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:06:58,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {19258#true} call ULTIMATE.init(); {19258#true} is VALID [2018-11-23 12:06:58,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {19258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19258#true} is VALID [2018-11-23 12:06:58,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {19258#true} assume true; {19258#true} is VALID [2018-11-23 12:06:58,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19258#true} {19258#true} #70#return; {19258#true} is VALID [2018-11-23 12:06:58,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {19258#true} call #t~ret7 := main(); {19258#true} is VALID [2018-11-23 12:06:58,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {19258#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {19260#(= main_~i~0 0)} is VALID [2018-11-23 12:06:58,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {19260#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19260#(= main_~i~0 0)} is VALID [2018-11-23 12:06:58,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {19260#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19260#(= main_~i~0 0)} is VALID [2018-11-23 12:06:58,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {19260#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19261#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:58,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {19261#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19261#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:58,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {19261#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19261#(<= main_~i~0 1)} is VALID [2018-11-23 12:06:58,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {19261#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19262#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:58,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {19262#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19262#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:58,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {19262#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19262#(<= main_~i~0 2)} is VALID [2018-11-23 12:06:58,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {19262#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19263#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:58,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {19263#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19263#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:58,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {19263#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19263#(<= main_~i~0 3)} is VALID [2018-11-23 12:06:58,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {19263#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19264#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:58,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {19264#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19264#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:58,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {19264#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19264#(<= main_~i~0 4)} is VALID [2018-11-23 12:06:58,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {19264#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19265#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:58,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {19265#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19265#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:58,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {19265#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19265#(<= main_~i~0 5)} is VALID [2018-11-23 12:06:58,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {19265#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19266#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:58,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {19266#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19266#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:58,149 INFO L273 TraceCheckUtils]: 25: Hoare triple {19266#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19266#(<= main_~i~0 6)} is VALID [2018-11-23 12:06:58,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {19266#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19267#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:58,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {19267#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19267#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:58,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {19267#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19267#(<= main_~i~0 7)} is VALID [2018-11-23 12:06:58,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {19267#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19268#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:58,153 INFO L273 TraceCheckUtils]: 30: Hoare triple {19268#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19268#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:58,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {19268#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19268#(<= main_~i~0 8)} is VALID [2018-11-23 12:06:58,154 INFO L273 TraceCheckUtils]: 32: Hoare triple {19268#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19269#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:58,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {19269#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19269#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:58,155 INFO L273 TraceCheckUtils]: 34: Hoare triple {19269#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19269#(<= main_~i~0 9)} is VALID [2018-11-23 12:06:58,156 INFO L273 TraceCheckUtils]: 35: Hoare triple {19269#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19270#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:58,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {19270#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19270#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:58,157 INFO L273 TraceCheckUtils]: 37: Hoare triple {19270#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19270#(<= main_~i~0 10)} is VALID [2018-11-23 12:06:58,158 INFO L273 TraceCheckUtils]: 38: Hoare triple {19270#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:58,179 INFO L273 TraceCheckUtils]: 39: Hoare triple {19271#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19271#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:58,193 INFO L273 TraceCheckUtils]: 40: Hoare triple {19271#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19271#(<= main_~i~0 11)} is VALID [2018-11-23 12:06:58,194 INFO L273 TraceCheckUtils]: 41: Hoare triple {19271#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19272#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:58,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {19272#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19272#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:58,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {19272#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19272#(<= main_~i~0 12)} is VALID [2018-11-23 12:06:58,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {19272#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19273#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:58,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {19273#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19273#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:58,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {19273#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19273#(<= main_~i~0 13)} is VALID [2018-11-23 12:06:58,200 INFO L273 TraceCheckUtils]: 47: Hoare triple {19273#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19274#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:58,201 INFO L273 TraceCheckUtils]: 48: Hoare triple {19274#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19274#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:58,201 INFO L273 TraceCheckUtils]: 49: Hoare triple {19274#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19274#(<= main_~i~0 14)} is VALID [2018-11-23 12:06:58,202 INFO L273 TraceCheckUtils]: 50: Hoare triple {19274#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19275#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:58,202 INFO L273 TraceCheckUtils]: 51: Hoare triple {19275#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19275#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:58,202 INFO L273 TraceCheckUtils]: 52: Hoare triple {19275#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19275#(<= main_~i~0 15)} is VALID [2018-11-23 12:06:58,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {19275#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19276#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:58,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {19276#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19276#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:58,204 INFO L273 TraceCheckUtils]: 55: Hoare triple {19276#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19276#(<= main_~i~0 16)} is VALID [2018-11-23 12:06:58,205 INFO L273 TraceCheckUtils]: 56: Hoare triple {19276#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19277#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:58,205 INFO L273 TraceCheckUtils]: 57: Hoare triple {19277#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19277#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:58,206 INFO L273 TraceCheckUtils]: 58: Hoare triple {19277#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19277#(<= main_~i~0 17)} is VALID [2018-11-23 12:06:58,207 INFO L273 TraceCheckUtils]: 59: Hoare triple {19277#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19278#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:58,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {19278#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19278#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:58,208 INFO L273 TraceCheckUtils]: 61: Hoare triple {19278#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19278#(<= main_~i~0 18)} is VALID [2018-11-23 12:06:58,209 INFO L273 TraceCheckUtils]: 62: Hoare triple {19278#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19279#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:58,209 INFO L273 TraceCheckUtils]: 63: Hoare triple {19279#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19279#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:58,210 INFO L273 TraceCheckUtils]: 64: Hoare triple {19279#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19279#(<= main_~i~0 19)} is VALID [2018-11-23 12:06:58,211 INFO L273 TraceCheckUtils]: 65: Hoare triple {19279#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19280#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:58,211 INFO L273 TraceCheckUtils]: 66: Hoare triple {19280#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19280#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:58,212 INFO L273 TraceCheckUtils]: 67: Hoare triple {19280#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19280#(<= main_~i~0 20)} is VALID [2018-11-23 12:06:58,213 INFO L273 TraceCheckUtils]: 68: Hoare triple {19280#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19281#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:58,213 INFO L273 TraceCheckUtils]: 69: Hoare triple {19281#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19281#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:58,214 INFO L273 TraceCheckUtils]: 70: Hoare triple {19281#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19281#(<= main_~i~0 21)} is VALID [2018-11-23 12:06:58,215 INFO L273 TraceCheckUtils]: 71: Hoare triple {19281#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19282#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:58,215 INFO L273 TraceCheckUtils]: 72: Hoare triple {19282#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19282#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:58,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {19282#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19282#(<= main_~i~0 22)} is VALID [2018-11-23 12:06:58,217 INFO L273 TraceCheckUtils]: 74: Hoare triple {19282#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19283#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:58,217 INFO L273 TraceCheckUtils]: 75: Hoare triple {19283#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19283#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:58,218 INFO L273 TraceCheckUtils]: 76: Hoare triple {19283#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19283#(<= main_~i~0 23)} is VALID [2018-11-23 12:06:58,219 INFO L273 TraceCheckUtils]: 77: Hoare triple {19283#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19284#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:58,219 INFO L273 TraceCheckUtils]: 78: Hoare triple {19284#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19284#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:58,220 INFO L273 TraceCheckUtils]: 79: Hoare triple {19284#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19284#(<= main_~i~0 24)} is VALID [2018-11-23 12:06:58,221 INFO L273 TraceCheckUtils]: 80: Hoare triple {19284#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19285#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:58,221 INFO L273 TraceCheckUtils]: 81: Hoare triple {19285#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19285#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:58,222 INFO L273 TraceCheckUtils]: 82: Hoare triple {19285#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19285#(<= main_~i~0 25)} is VALID [2018-11-23 12:06:58,223 INFO L273 TraceCheckUtils]: 83: Hoare triple {19285#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19286#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:58,223 INFO L273 TraceCheckUtils]: 84: Hoare triple {19286#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19286#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:58,224 INFO L273 TraceCheckUtils]: 85: Hoare triple {19286#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19286#(<= main_~i~0 26)} is VALID [2018-11-23 12:06:58,225 INFO L273 TraceCheckUtils]: 86: Hoare triple {19286#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19287#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:58,225 INFO L273 TraceCheckUtils]: 87: Hoare triple {19287#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19287#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:58,226 INFO L273 TraceCheckUtils]: 88: Hoare triple {19287#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19287#(<= main_~i~0 27)} is VALID [2018-11-23 12:06:58,227 INFO L273 TraceCheckUtils]: 89: Hoare triple {19287#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19288#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:58,227 INFO L273 TraceCheckUtils]: 90: Hoare triple {19288#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19288#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:58,228 INFO L273 TraceCheckUtils]: 91: Hoare triple {19288#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19288#(<= main_~i~0 28)} is VALID [2018-11-23 12:06:58,229 INFO L273 TraceCheckUtils]: 92: Hoare triple {19288#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19289#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:58,229 INFO L273 TraceCheckUtils]: 93: Hoare triple {19289#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19289#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:58,230 INFO L273 TraceCheckUtils]: 94: Hoare triple {19289#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19289#(<= main_~i~0 29)} is VALID [2018-11-23 12:06:58,231 INFO L273 TraceCheckUtils]: 95: Hoare triple {19289#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19290#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:58,231 INFO L273 TraceCheckUtils]: 96: Hoare triple {19290#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19290#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:58,232 INFO L273 TraceCheckUtils]: 97: Hoare triple {19290#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19290#(<= main_~i~0 30)} is VALID [2018-11-23 12:06:58,233 INFO L273 TraceCheckUtils]: 98: Hoare triple {19290#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19291#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:58,233 INFO L273 TraceCheckUtils]: 99: Hoare triple {19291#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19291#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:58,234 INFO L273 TraceCheckUtils]: 100: Hoare triple {19291#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19291#(<= main_~i~0 31)} is VALID [2018-11-23 12:06:58,235 INFO L273 TraceCheckUtils]: 101: Hoare triple {19291#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19292#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:58,235 INFO L273 TraceCheckUtils]: 102: Hoare triple {19292#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19292#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:58,236 INFO L273 TraceCheckUtils]: 103: Hoare triple {19292#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19292#(<= main_~i~0 32)} is VALID [2018-11-23 12:06:58,237 INFO L273 TraceCheckUtils]: 104: Hoare triple {19292#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19293#(<= main_~i~0 33)} is VALID [2018-11-23 12:06:58,237 INFO L273 TraceCheckUtils]: 105: Hoare triple {19293#(<= main_~i~0 33)} assume !(~i~0 < 100000); {19259#false} is VALID [2018-11-23 12:06:58,238 INFO L273 TraceCheckUtils]: 106: Hoare triple {19259#false} havoc ~x~0;~x~0 := 0; {19259#false} is VALID [2018-11-23 12:06:58,238 INFO L273 TraceCheckUtils]: 107: Hoare triple {19259#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {19259#false} is VALID [2018-11-23 12:06:58,238 INFO L256 TraceCheckUtils]: 108: Hoare triple {19259#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {19259#false} is VALID [2018-11-23 12:06:58,238 INFO L273 TraceCheckUtils]: 109: Hoare triple {19259#false} ~cond := #in~cond; {19259#false} is VALID [2018-11-23 12:06:58,238 INFO L273 TraceCheckUtils]: 110: Hoare triple {19259#false} assume 0 == ~cond; {19259#false} is VALID [2018-11-23 12:06:58,239 INFO L273 TraceCheckUtils]: 111: Hoare triple {19259#false} assume !false; {19259#false} is VALID [2018-11-23 12:06:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:06:58,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:06:58,249 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 12:06:58,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:07:04,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 12:07:04,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:04,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:04,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {19258#true} call ULTIMATE.init(); {19258#true} is VALID [2018-11-23 12:07:04,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {19258#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19258#true} is VALID [2018-11-23 12:07:04,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {19258#true} assume true; {19258#true} is VALID [2018-11-23 12:07:04,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19258#true} {19258#true} #70#return; {19258#true} is VALID [2018-11-23 12:07:04,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {19258#true} call #t~ret7 := main(); {19258#true} is VALID [2018-11-23 12:07:04,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {19258#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {19312#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:04,695 INFO L273 TraceCheckUtils]: 6: Hoare triple {19312#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19312#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:04,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {19312#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19312#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:04,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {19312#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19261#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:04,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {19261#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19261#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:04,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {19261#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19261#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:04,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {19261#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19262#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:04,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {19262#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19262#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:04,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {19262#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19262#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:04,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {19262#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19263#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:04,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {19263#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19263#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:04,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {19263#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19263#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:04,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {19263#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19264#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:04,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {19264#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19264#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:04,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {19264#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19264#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:04,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {19264#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19265#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:04,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {19265#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19265#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:04,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {19265#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19265#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:04,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {19265#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19266#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:04,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {19266#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19266#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:04,707 INFO L273 TraceCheckUtils]: 25: Hoare triple {19266#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19266#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:04,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {19266#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19267#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:04,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {19267#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19267#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:04,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {19267#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19267#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:04,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {19267#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19268#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:04,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {19268#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19268#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:04,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {19268#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19268#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:04,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {19268#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19269#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:04,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {19269#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19269#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:04,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {19269#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19269#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:04,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {19269#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19270#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:04,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {19270#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19270#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:04,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {19270#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19270#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:04,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {19270#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19271#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:04,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {19271#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19271#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:04,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {19271#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19271#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:04,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {19271#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19272#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:04,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {19272#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19272#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:04,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {19272#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19272#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:04,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {19272#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19273#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:04,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {19273#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19273#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:04,721 INFO L273 TraceCheckUtils]: 46: Hoare triple {19273#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19273#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:04,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {19273#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19274#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:04,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {19274#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19274#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:04,723 INFO L273 TraceCheckUtils]: 49: Hoare triple {19274#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19274#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:04,724 INFO L273 TraceCheckUtils]: 50: Hoare triple {19274#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19275#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:04,724 INFO L273 TraceCheckUtils]: 51: Hoare triple {19275#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19275#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:04,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {19275#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19275#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:04,726 INFO L273 TraceCheckUtils]: 53: Hoare triple {19275#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19276#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:04,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {19276#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19276#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:04,727 INFO L273 TraceCheckUtils]: 55: Hoare triple {19276#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19276#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:04,728 INFO L273 TraceCheckUtils]: 56: Hoare triple {19276#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19277#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:04,728 INFO L273 TraceCheckUtils]: 57: Hoare triple {19277#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19277#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:04,729 INFO L273 TraceCheckUtils]: 58: Hoare triple {19277#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19277#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:04,730 INFO L273 TraceCheckUtils]: 59: Hoare triple {19277#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19278#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:04,730 INFO L273 TraceCheckUtils]: 60: Hoare triple {19278#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19278#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:04,731 INFO L273 TraceCheckUtils]: 61: Hoare triple {19278#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19278#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:04,732 INFO L273 TraceCheckUtils]: 62: Hoare triple {19278#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19279#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:04,732 INFO L273 TraceCheckUtils]: 63: Hoare triple {19279#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19279#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:04,733 INFO L273 TraceCheckUtils]: 64: Hoare triple {19279#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19279#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:04,734 INFO L273 TraceCheckUtils]: 65: Hoare triple {19279#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19280#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:04,734 INFO L273 TraceCheckUtils]: 66: Hoare triple {19280#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19280#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:04,735 INFO L273 TraceCheckUtils]: 67: Hoare triple {19280#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19280#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:04,736 INFO L273 TraceCheckUtils]: 68: Hoare triple {19280#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19281#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:04,736 INFO L273 TraceCheckUtils]: 69: Hoare triple {19281#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19281#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:04,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {19281#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19281#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:04,738 INFO L273 TraceCheckUtils]: 71: Hoare triple {19281#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19282#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:04,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {19282#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19282#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:04,739 INFO L273 TraceCheckUtils]: 73: Hoare triple {19282#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19282#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:04,740 INFO L273 TraceCheckUtils]: 74: Hoare triple {19282#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19283#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:04,740 INFO L273 TraceCheckUtils]: 75: Hoare triple {19283#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19283#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:04,741 INFO L273 TraceCheckUtils]: 76: Hoare triple {19283#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19283#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:04,742 INFO L273 TraceCheckUtils]: 77: Hoare triple {19283#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19284#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:04,742 INFO L273 TraceCheckUtils]: 78: Hoare triple {19284#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19284#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:04,743 INFO L273 TraceCheckUtils]: 79: Hoare triple {19284#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19284#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:04,744 INFO L273 TraceCheckUtils]: 80: Hoare triple {19284#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19285#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:04,744 INFO L273 TraceCheckUtils]: 81: Hoare triple {19285#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19285#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:04,745 INFO L273 TraceCheckUtils]: 82: Hoare triple {19285#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19285#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:04,746 INFO L273 TraceCheckUtils]: 83: Hoare triple {19285#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19286#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:04,746 INFO L273 TraceCheckUtils]: 84: Hoare triple {19286#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19286#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:04,747 INFO L273 TraceCheckUtils]: 85: Hoare triple {19286#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19286#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:04,748 INFO L273 TraceCheckUtils]: 86: Hoare triple {19286#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19287#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:04,748 INFO L273 TraceCheckUtils]: 87: Hoare triple {19287#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19287#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:04,749 INFO L273 TraceCheckUtils]: 88: Hoare triple {19287#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19287#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:04,750 INFO L273 TraceCheckUtils]: 89: Hoare triple {19287#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19288#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:04,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {19288#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19288#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:04,751 INFO L273 TraceCheckUtils]: 91: Hoare triple {19288#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19288#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:04,752 INFO L273 TraceCheckUtils]: 92: Hoare triple {19288#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19289#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:04,752 INFO L273 TraceCheckUtils]: 93: Hoare triple {19289#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19289#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:04,753 INFO L273 TraceCheckUtils]: 94: Hoare triple {19289#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19289#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:04,754 INFO L273 TraceCheckUtils]: 95: Hoare triple {19289#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19290#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:04,754 INFO L273 TraceCheckUtils]: 96: Hoare triple {19290#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19290#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:04,755 INFO L273 TraceCheckUtils]: 97: Hoare triple {19290#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19290#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:04,756 INFO L273 TraceCheckUtils]: 98: Hoare triple {19290#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19291#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:04,756 INFO L273 TraceCheckUtils]: 99: Hoare triple {19291#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19291#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:04,757 INFO L273 TraceCheckUtils]: 100: Hoare triple {19291#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19291#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:04,758 INFO L273 TraceCheckUtils]: 101: Hoare triple {19291#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19292#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:04,758 INFO L273 TraceCheckUtils]: 102: Hoare triple {19292#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19292#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:04,759 INFO L273 TraceCheckUtils]: 103: Hoare triple {19292#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {19292#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:04,760 INFO L273 TraceCheckUtils]: 104: Hoare triple {19292#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19293#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:04,760 INFO L273 TraceCheckUtils]: 105: Hoare triple {19293#(<= main_~i~0 33)} assume !(~i~0 < 100000); {19259#false} is VALID [2018-11-23 12:07:04,761 INFO L273 TraceCheckUtils]: 106: Hoare triple {19259#false} havoc ~x~0;~x~0 := 0; {19259#false} is VALID [2018-11-23 12:07:04,761 INFO L273 TraceCheckUtils]: 107: Hoare triple {19259#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {19259#false} is VALID [2018-11-23 12:07:04,761 INFO L256 TraceCheckUtils]: 108: Hoare triple {19259#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {19259#false} is VALID [2018-11-23 12:07:04,761 INFO L273 TraceCheckUtils]: 109: Hoare triple {19259#false} ~cond := #in~cond; {19259#false} is VALID [2018-11-23 12:07:04,761 INFO L273 TraceCheckUtils]: 110: Hoare triple {19259#false} assume 0 == ~cond; {19259#false} is VALID [2018-11-23 12:07:04,761 INFO L273 TraceCheckUtils]: 111: Hoare triple {19259#false} assume !false; {19259#false} is VALID [2018-11-23 12:07:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:04,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:04,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:07:04,793 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 12:07:04,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:04,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:07:04,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:04,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:07:04,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:07:04,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:07:04,934 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand 37 states. [2018-11-23 12:07:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:06,166 INFO L93 Difference]: Finished difference Result 143 states and 184 transitions. [2018-11-23 12:07:06,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:07:06,166 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-23 12:07:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:07:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 184 transitions. [2018-11-23 12:07:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:07:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 184 transitions. [2018-11-23 12:07:06,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 184 transitions. [2018-11-23 12:07:06,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:06,389 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:07:06,389 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 12:07:06,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:07:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 12:07:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-11-23 12:07:06,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:06,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 125 states. [2018-11-23 12:07:06,467 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 125 states. [2018-11-23 12:07:06,467 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 125 states. [2018-11-23 12:07:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:06,470 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2018-11-23 12:07:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2018-11-23 12:07:06,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:06,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:06,471 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 127 states. [2018-11-23 12:07:06,471 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 127 states. [2018-11-23 12:07:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:06,472 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2018-11-23 12:07:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2018-11-23 12:07:06,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:06,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:06,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:06,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:07:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2018-11-23 12:07:06,475 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 112 [2018-11-23 12:07:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:06,476 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2018-11-23 12:07:06,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:07:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 12:07:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 12:07:06,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:06,477 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:06,477 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:06,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1635081063, now seen corresponding path program 34 times [2018-11-23 12:07:06,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:06,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:06,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:06,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:07,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {20245#true} call ULTIMATE.init(); {20245#true} is VALID [2018-11-23 12:07:07,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {20245#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20245#true} is VALID [2018-11-23 12:07:07,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {20245#true} assume true; {20245#true} is VALID [2018-11-23 12:07:07,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20245#true} {20245#true} #70#return; {20245#true} is VALID [2018-11-23 12:07:07,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {20245#true} call #t~ret7 := main(); {20245#true} is VALID [2018-11-23 12:07:07,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {20245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {20247#(= main_~i~0 0)} is VALID [2018-11-23 12:07:07,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {20247#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20247#(= main_~i~0 0)} is VALID [2018-11-23 12:07:07,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {20247#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20247#(= main_~i~0 0)} is VALID [2018-11-23 12:07:07,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {20247#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20248#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {20248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20248#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {20248#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20248#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:07,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {20248#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20249#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {20249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20249#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {20249#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20249#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:07,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {20249#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20250#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {20250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20250#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {20250#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20250#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:07,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {20250#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20251#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {20251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20251#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {20251#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20251#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:07,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {20251#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20252#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {20252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20252#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {20252#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20252#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:07,694 INFO L273 TraceCheckUtils]: 23: Hoare triple {20252#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20253#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {20253#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20253#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,695 INFO L273 TraceCheckUtils]: 25: Hoare triple {20253#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20253#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:07,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {20253#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20254#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {20254#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20254#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {20254#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20254#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:07,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {20254#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20255#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {20255#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20255#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {20255#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20255#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:07,700 INFO L273 TraceCheckUtils]: 32: Hoare triple {20255#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20256#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,701 INFO L273 TraceCheckUtils]: 33: Hoare triple {20256#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20256#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {20256#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20256#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:07,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {20256#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20257#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {20257#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20257#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {20257#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20257#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:07,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {20257#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20258#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,705 INFO L273 TraceCheckUtils]: 39: Hoare triple {20258#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20258#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,706 INFO L273 TraceCheckUtils]: 40: Hoare triple {20258#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20258#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:07,706 INFO L273 TraceCheckUtils]: 41: Hoare triple {20258#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20259#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,707 INFO L273 TraceCheckUtils]: 42: Hoare triple {20259#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20259#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,708 INFO L273 TraceCheckUtils]: 43: Hoare triple {20259#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20259#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:07,708 INFO L273 TraceCheckUtils]: 44: Hoare triple {20259#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20260#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,709 INFO L273 TraceCheckUtils]: 45: Hoare triple {20260#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20260#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,709 INFO L273 TraceCheckUtils]: 46: Hoare triple {20260#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20260#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:07,710 INFO L273 TraceCheckUtils]: 47: Hoare triple {20260#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20261#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,711 INFO L273 TraceCheckUtils]: 48: Hoare triple {20261#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20261#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,711 INFO L273 TraceCheckUtils]: 49: Hoare triple {20261#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20261#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:07,712 INFO L273 TraceCheckUtils]: 50: Hoare triple {20261#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20262#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,713 INFO L273 TraceCheckUtils]: 51: Hoare triple {20262#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20262#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,713 INFO L273 TraceCheckUtils]: 52: Hoare triple {20262#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20262#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:07,714 INFO L273 TraceCheckUtils]: 53: Hoare triple {20262#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20263#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,715 INFO L273 TraceCheckUtils]: 54: Hoare triple {20263#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20263#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,715 INFO L273 TraceCheckUtils]: 55: Hoare triple {20263#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20263#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:07,716 INFO L273 TraceCheckUtils]: 56: Hoare triple {20263#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20264#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {20264#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20264#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {20264#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20264#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:07,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {20264#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20265#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {20265#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20265#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,720 INFO L273 TraceCheckUtils]: 61: Hoare triple {20265#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20265#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:07,720 INFO L273 TraceCheckUtils]: 62: Hoare triple {20265#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20266#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,721 INFO L273 TraceCheckUtils]: 63: Hoare triple {20266#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20266#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,721 INFO L273 TraceCheckUtils]: 64: Hoare triple {20266#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20266#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:07,722 INFO L273 TraceCheckUtils]: 65: Hoare triple {20266#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20267#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,723 INFO L273 TraceCheckUtils]: 66: Hoare triple {20267#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20267#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,723 INFO L273 TraceCheckUtils]: 67: Hoare triple {20267#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20267#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:07,724 INFO L273 TraceCheckUtils]: 68: Hoare triple {20267#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20268#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,725 INFO L273 TraceCheckUtils]: 69: Hoare triple {20268#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20268#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,725 INFO L273 TraceCheckUtils]: 70: Hoare triple {20268#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20268#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:07,726 INFO L273 TraceCheckUtils]: 71: Hoare triple {20268#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20269#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,727 INFO L273 TraceCheckUtils]: 72: Hoare triple {20269#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20269#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,727 INFO L273 TraceCheckUtils]: 73: Hoare triple {20269#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20269#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:07,728 INFO L273 TraceCheckUtils]: 74: Hoare triple {20269#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20270#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,729 INFO L273 TraceCheckUtils]: 75: Hoare triple {20270#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20270#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,729 INFO L273 TraceCheckUtils]: 76: Hoare triple {20270#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20270#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:07,730 INFO L273 TraceCheckUtils]: 77: Hoare triple {20270#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20271#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,731 INFO L273 TraceCheckUtils]: 78: Hoare triple {20271#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20271#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,731 INFO L273 TraceCheckUtils]: 79: Hoare triple {20271#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20271#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:07,732 INFO L273 TraceCheckUtils]: 80: Hoare triple {20271#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20272#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,733 INFO L273 TraceCheckUtils]: 81: Hoare triple {20272#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20272#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,733 INFO L273 TraceCheckUtils]: 82: Hoare triple {20272#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20272#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:07,734 INFO L273 TraceCheckUtils]: 83: Hoare triple {20272#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20273#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,735 INFO L273 TraceCheckUtils]: 84: Hoare triple {20273#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20273#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,735 INFO L273 TraceCheckUtils]: 85: Hoare triple {20273#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20273#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:07,736 INFO L273 TraceCheckUtils]: 86: Hoare triple {20273#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20274#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,737 INFO L273 TraceCheckUtils]: 87: Hoare triple {20274#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20274#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {20274#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20274#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:07,738 INFO L273 TraceCheckUtils]: 89: Hoare triple {20274#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20275#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,738 INFO L273 TraceCheckUtils]: 90: Hoare triple {20275#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20275#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,739 INFO L273 TraceCheckUtils]: 91: Hoare triple {20275#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20275#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:07,740 INFO L273 TraceCheckUtils]: 92: Hoare triple {20275#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20276#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,740 INFO L273 TraceCheckUtils]: 93: Hoare triple {20276#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20276#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,741 INFO L273 TraceCheckUtils]: 94: Hoare triple {20276#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20276#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:07,742 INFO L273 TraceCheckUtils]: 95: Hoare triple {20276#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20277#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,742 INFO L273 TraceCheckUtils]: 96: Hoare triple {20277#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20277#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,743 INFO L273 TraceCheckUtils]: 97: Hoare triple {20277#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20277#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:07,744 INFO L273 TraceCheckUtils]: 98: Hoare triple {20277#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20278#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,744 INFO L273 TraceCheckUtils]: 99: Hoare triple {20278#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20278#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,745 INFO L273 TraceCheckUtils]: 100: Hoare triple {20278#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20278#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:07,746 INFO L273 TraceCheckUtils]: 101: Hoare triple {20278#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20279#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,746 INFO L273 TraceCheckUtils]: 102: Hoare triple {20279#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20279#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,747 INFO L273 TraceCheckUtils]: 103: Hoare triple {20279#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20279#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:07,748 INFO L273 TraceCheckUtils]: 104: Hoare triple {20279#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20280#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,748 INFO L273 TraceCheckUtils]: 105: Hoare triple {20280#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20280#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,749 INFO L273 TraceCheckUtils]: 106: Hoare triple {20280#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20280#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:07,750 INFO L273 TraceCheckUtils]: 107: Hoare triple {20280#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20281#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:07,751 INFO L273 TraceCheckUtils]: 108: Hoare triple {20281#(<= main_~i~0 34)} assume !(~i~0 < 100000); {20246#false} is VALID [2018-11-23 12:07:07,751 INFO L273 TraceCheckUtils]: 109: Hoare triple {20246#false} havoc ~x~0;~x~0 := 0; {20246#false} is VALID [2018-11-23 12:07:07,751 INFO L273 TraceCheckUtils]: 110: Hoare triple {20246#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {20246#false} is VALID [2018-11-23 12:07:07,751 INFO L256 TraceCheckUtils]: 111: Hoare triple {20246#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {20246#false} is VALID [2018-11-23 12:07:07,751 INFO L273 TraceCheckUtils]: 112: Hoare triple {20246#false} ~cond := #in~cond; {20246#false} is VALID [2018-11-23 12:07:07,752 INFO L273 TraceCheckUtils]: 113: Hoare triple {20246#false} assume 0 == ~cond; {20246#false} is VALID [2018-11-23 12:07:07,752 INFO L273 TraceCheckUtils]: 114: Hoare triple {20246#false} assume !false; {20246#false} is VALID [2018-11-23 12:07:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:07,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:07,762 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 12:07:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:07:08,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:07:08,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:08,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:09,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {20245#true} call ULTIMATE.init(); {20245#true} is VALID [2018-11-23 12:07:09,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {20245#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20245#true} is VALID [2018-11-23 12:07:09,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {20245#true} assume true; {20245#true} is VALID [2018-11-23 12:07:09,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20245#true} {20245#true} #70#return; {20245#true} is VALID [2018-11-23 12:07:09,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {20245#true} call #t~ret7 := main(); {20245#true} is VALID [2018-11-23 12:07:09,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {20245#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {20300#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:09,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {20300#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20300#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:09,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {20300#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20300#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:09,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {20300#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20248#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:09,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {20248#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20248#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:09,148 INFO L273 TraceCheckUtils]: 10: Hoare triple {20248#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20248#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:09,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {20248#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20249#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:09,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {20249#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20249#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:09,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {20249#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20249#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:09,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {20249#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20250#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:09,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {20250#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20250#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:09,151 INFO L273 TraceCheckUtils]: 16: Hoare triple {20250#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20250#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:09,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {20250#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20251#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:09,153 INFO L273 TraceCheckUtils]: 18: Hoare triple {20251#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20251#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:09,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {20251#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20251#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:09,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {20251#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20252#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:09,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {20252#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20252#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:09,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {20252#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20252#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:09,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {20252#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20253#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:09,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {20253#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20253#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:09,166 INFO L273 TraceCheckUtils]: 25: Hoare triple {20253#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20253#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:09,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {20253#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20254#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:09,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {20254#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20254#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:09,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {20254#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20254#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:09,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {20254#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20255#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:09,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {20255#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20255#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:09,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {20255#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20255#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:09,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {20255#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20256#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:09,174 INFO L273 TraceCheckUtils]: 33: Hoare triple {20256#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20256#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:09,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {20256#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20256#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:09,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {20256#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20257#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:09,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {20257#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20257#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:09,178 INFO L273 TraceCheckUtils]: 37: Hoare triple {20257#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20257#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:09,178 INFO L273 TraceCheckUtils]: 38: Hoare triple {20257#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20258#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:09,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {20258#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20258#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:09,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {20258#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20258#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:09,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {20258#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20259#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:09,182 INFO L273 TraceCheckUtils]: 42: Hoare triple {20259#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20259#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:09,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {20259#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20259#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:09,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {20259#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20260#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:09,186 INFO L273 TraceCheckUtils]: 45: Hoare triple {20260#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20260#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:09,186 INFO L273 TraceCheckUtils]: 46: Hoare triple {20260#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20260#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:09,189 INFO L273 TraceCheckUtils]: 47: Hoare triple {20260#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20261#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:09,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {20261#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20261#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:09,191 INFO L273 TraceCheckUtils]: 49: Hoare triple {20261#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20261#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:09,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {20261#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20262#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:09,193 INFO L273 TraceCheckUtils]: 51: Hoare triple {20262#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20262#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:09,193 INFO L273 TraceCheckUtils]: 52: Hoare triple {20262#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20262#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:09,195 INFO L273 TraceCheckUtils]: 53: Hoare triple {20262#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20263#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:09,195 INFO L273 TraceCheckUtils]: 54: Hoare triple {20263#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20263#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:09,197 INFO L273 TraceCheckUtils]: 55: Hoare triple {20263#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20263#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:09,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {20263#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20264#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:09,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {20264#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20264#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:09,202 INFO L273 TraceCheckUtils]: 58: Hoare triple {20264#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20264#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:09,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {20264#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20265#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:09,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {20265#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20265#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:09,206 INFO L273 TraceCheckUtils]: 61: Hoare triple {20265#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20265#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:09,206 INFO L273 TraceCheckUtils]: 62: Hoare triple {20265#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20266#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:09,208 INFO L273 TraceCheckUtils]: 63: Hoare triple {20266#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20266#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:09,208 INFO L273 TraceCheckUtils]: 64: Hoare triple {20266#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20266#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:09,210 INFO L273 TraceCheckUtils]: 65: Hoare triple {20266#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20267#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:09,210 INFO L273 TraceCheckUtils]: 66: Hoare triple {20267#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20267#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:09,213 INFO L273 TraceCheckUtils]: 67: Hoare triple {20267#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20267#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:09,213 INFO L273 TraceCheckUtils]: 68: Hoare triple {20267#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20268#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:09,215 INFO L273 TraceCheckUtils]: 69: Hoare triple {20268#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20268#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:09,215 INFO L273 TraceCheckUtils]: 70: Hoare triple {20268#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20268#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:09,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {20268#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20269#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:09,217 INFO L273 TraceCheckUtils]: 72: Hoare triple {20269#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20269#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:09,219 INFO L273 TraceCheckUtils]: 73: Hoare triple {20269#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20269#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:09,219 INFO L273 TraceCheckUtils]: 74: Hoare triple {20269#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20270#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:09,221 INFO L273 TraceCheckUtils]: 75: Hoare triple {20270#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20270#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:09,221 INFO L273 TraceCheckUtils]: 76: Hoare triple {20270#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20270#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:09,224 INFO L273 TraceCheckUtils]: 77: Hoare triple {20270#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20271#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:09,224 INFO L273 TraceCheckUtils]: 78: Hoare triple {20271#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20271#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:09,226 INFO L273 TraceCheckUtils]: 79: Hoare triple {20271#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20271#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:09,226 INFO L273 TraceCheckUtils]: 80: Hoare triple {20271#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20272#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:09,228 INFO L273 TraceCheckUtils]: 81: Hoare triple {20272#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20272#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:09,228 INFO L273 TraceCheckUtils]: 82: Hoare triple {20272#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20272#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:09,230 INFO L273 TraceCheckUtils]: 83: Hoare triple {20272#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20273#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:09,230 INFO L273 TraceCheckUtils]: 84: Hoare triple {20273#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20273#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:09,232 INFO L273 TraceCheckUtils]: 85: Hoare triple {20273#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20273#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:09,232 INFO L273 TraceCheckUtils]: 86: Hoare triple {20273#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20274#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:09,234 INFO L273 TraceCheckUtils]: 87: Hoare triple {20274#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20274#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:09,234 INFO L273 TraceCheckUtils]: 88: Hoare triple {20274#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20274#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:09,236 INFO L273 TraceCheckUtils]: 89: Hoare triple {20274#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20275#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:09,236 INFO L273 TraceCheckUtils]: 90: Hoare triple {20275#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20275#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:09,238 INFO L273 TraceCheckUtils]: 91: Hoare triple {20275#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20275#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:09,238 INFO L273 TraceCheckUtils]: 92: Hoare triple {20275#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20276#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:09,240 INFO L273 TraceCheckUtils]: 93: Hoare triple {20276#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20276#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:09,240 INFO L273 TraceCheckUtils]: 94: Hoare triple {20276#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20276#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:09,243 INFO L273 TraceCheckUtils]: 95: Hoare triple {20276#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20277#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:09,243 INFO L273 TraceCheckUtils]: 96: Hoare triple {20277#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20277#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:09,245 INFO L273 TraceCheckUtils]: 97: Hoare triple {20277#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20277#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:09,245 INFO L273 TraceCheckUtils]: 98: Hoare triple {20277#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20278#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:09,247 INFO L273 TraceCheckUtils]: 99: Hoare triple {20278#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20278#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:09,247 INFO L273 TraceCheckUtils]: 100: Hoare triple {20278#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20278#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:09,249 INFO L273 TraceCheckUtils]: 101: Hoare triple {20278#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20279#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:09,249 INFO L273 TraceCheckUtils]: 102: Hoare triple {20279#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20279#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:09,252 INFO L273 TraceCheckUtils]: 103: Hoare triple {20279#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20279#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:09,252 INFO L273 TraceCheckUtils]: 104: Hoare triple {20279#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20280#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:09,254 INFO L273 TraceCheckUtils]: 105: Hoare triple {20280#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {20280#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:09,254 INFO L273 TraceCheckUtils]: 106: Hoare triple {20280#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {20280#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:09,256 INFO L273 TraceCheckUtils]: 107: Hoare triple {20280#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20281#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:09,256 INFO L273 TraceCheckUtils]: 108: Hoare triple {20281#(<= main_~i~0 34)} assume !(~i~0 < 100000); {20246#false} is VALID [2018-11-23 12:07:09,256 INFO L273 TraceCheckUtils]: 109: Hoare triple {20246#false} havoc ~x~0;~x~0 := 0; {20246#false} is VALID [2018-11-23 12:07:09,256 INFO L273 TraceCheckUtils]: 110: Hoare triple {20246#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {20246#false} is VALID [2018-11-23 12:07:09,256 INFO L256 TraceCheckUtils]: 111: Hoare triple {20246#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {20246#false} is VALID [2018-11-23 12:07:09,257 INFO L273 TraceCheckUtils]: 112: Hoare triple {20246#false} ~cond := #in~cond; {20246#false} is VALID [2018-11-23 12:07:09,257 INFO L273 TraceCheckUtils]: 113: Hoare triple {20246#false} assume 0 == ~cond; {20246#false} is VALID [2018-11-23 12:07:09,257 INFO L273 TraceCheckUtils]: 114: Hoare triple {20246#false} assume !false; {20246#false} is VALID [2018-11-23 12:07:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:09,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:09,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:07:09,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 12:07:09,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:09,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:07:09,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:09,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:07:09,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:07:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:07:09,467 INFO L87 Difference]: Start difference. First operand 125 states and 162 transitions. Second operand 38 states. [2018-11-23 12:07:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,635 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2018-11-23 12:07:10,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:07:10,635 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-23 12:07:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:07:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 188 transitions. [2018-11-23 12:07:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:07:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 188 transitions. [2018-11-23 12:07:10,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 188 transitions. [2018-11-23 12:07:10,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:10,847 INFO L225 Difference]: With dead ends: 146 [2018-11-23 12:07:10,847 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:07:10,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:07:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:07:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-11-23 12:07:10,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:10,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 128 states. [2018-11-23 12:07:10,949 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 128 states. [2018-11-23 12:07:10,949 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 128 states. [2018-11-23 12:07:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,951 INFO L93 Difference]: Finished difference Result 130 states and 169 transitions. [2018-11-23 12:07:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 169 transitions. [2018-11-23 12:07:10,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:10,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:10,952 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 130 states. [2018-11-23 12:07:10,952 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 130 states. [2018-11-23 12:07:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:10,954 INFO L93 Difference]: Finished difference Result 130 states and 169 transitions. [2018-11-23 12:07:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 169 transitions. [2018-11-23 12:07:10,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:10,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:10,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:10,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 12:07:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 166 transitions. [2018-11-23 12:07:10,957 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 166 transitions. Word has length 115 [2018-11-23 12:07:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:10,958 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 166 transitions. [2018-11-23 12:07:10,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:07:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2018-11-23 12:07:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:07:10,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:10,958 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:10,959 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:10,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:10,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1266775148, now seen corresponding path program 35 times [2018-11-23 12:07:10,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:10,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:10,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:10,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:10,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:12,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {21256#true} call ULTIMATE.init(); {21256#true} is VALID [2018-11-23 12:07:12,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {21256#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21256#true} is VALID [2018-11-23 12:07:12,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {21256#true} assume true; {21256#true} is VALID [2018-11-23 12:07:12,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21256#true} {21256#true} #70#return; {21256#true} is VALID [2018-11-23 12:07:12,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {21256#true} call #t~ret7 := main(); {21256#true} is VALID [2018-11-23 12:07:12,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {21256#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {21258#(= main_~i~0 0)} is VALID [2018-11-23 12:07:12,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {21258#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21258#(= main_~i~0 0)} is VALID [2018-11-23 12:07:12,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {21258#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21258#(= main_~i~0 0)} is VALID [2018-11-23 12:07:12,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {21258#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21259#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {21259#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21259#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {21259#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21259#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:12,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {21259#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21260#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {21260#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21260#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {21260#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21260#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:12,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {21260#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21261#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {21261#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21261#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {21261#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21261#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:12,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {21261#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21262#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {21262#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21262#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {21262#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21262#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:12,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {21262#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21263#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {21263#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21263#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {21263#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21263#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:12,327 INFO L273 TraceCheckUtils]: 23: Hoare triple {21263#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21264#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {21264#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21264#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {21264#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21264#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:12,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {21264#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {21265#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21265#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {21265#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21265#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:12,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {21265#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {21266#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21266#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {21266#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21266#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:12,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {21266#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21267#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {21267#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21267#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,334 INFO L273 TraceCheckUtils]: 34: Hoare triple {21267#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21267#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:12,335 INFO L273 TraceCheckUtils]: 35: Hoare triple {21267#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21268#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,336 INFO L273 TraceCheckUtils]: 36: Hoare triple {21268#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21268#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {21268#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21268#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:12,337 INFO L273 TraceCheckUtils]: 38: Hoare triple {21268#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21269#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,337 INFO L273 TraceCheckUtils]: 39: Hoare triple {21269#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21269#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,338 INFO L273 TraceCheckUtils]: 40: Hoare triple {21269#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21269#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:12,339 INFO L273 TraceCheckUtils]: 41: Hoare triple {21269#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21270#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,339 INFO L273 TraceCheckUtils]: 42: Hoare triple {21270#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21270#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {21270#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21270#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:12,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {21270#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21271#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,342 INFO L273 TraceCheckUtils]: 45: Hoare triple {21271#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21271#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,342 INFO L273 TraceCheckUtils]: 46: Hoare triple {21271#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21271#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:12,343 INFO L273 TraceCheckUtils]: 47: Hoare triple {21271#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21272#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,344 INFO L273 TraceCheckUtils]: 48: Hoare triple {21272#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21272#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,344 INFO L273 TraceCheckUtils]: 49: Hoare triple {21272#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21272#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:12,345 INFO L273 TraceCheckUtils]: 50: Hoare triple {21272#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21273#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,346 INFO L273 TraceCheckUtils]: 51: Hoare triple {21273#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21273#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,346 INFO L273 TraceCheckUtils]: 52: Hoare triple {21273#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21273#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:12,347 INFO L273 TraceCheckUtils]: 53: Hoare triple {21273#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21274#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,348 INFO L273 TraceCheckUtils]: 54: Hoare triple {21274#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21274#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,348 INFO L273 TraceCheckUtils]: 55: Hoare triple {21274#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21274#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:12,349 INFO L273 TraceCheckUtils]: 56: Hoare triple {21274#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21275#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,350 INFO L273 TraceCheckUtils]: 57: Hoare triple {21275#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21275#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {21275#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21275#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:12,351 INFO L273 TraceCheckUtils]: 59: Hoare triple {21275#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21276#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {21276#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21276#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,353 INFO L273 TraceCheckUtils]: 61: Hoare triple {21276#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21276#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:12,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {21276#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,354 INFO L273 TraceCheckUtils]: 63: Hoare triple {21277#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21277#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,355 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21277#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:12,355 INFO L273 TraceCheckUtils]: 65: Hoare triple {21277#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,356 INFO L273 TraceCheckUtils]: 66: Hoare triple {21278#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21278#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,357 INFO L273 TraceCheckUtils]: 67: Hoare triple {21278#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21278#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:12,358 INFO L273 TraceCheckUtils]: 68: Hoare triple {21278#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21279#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,358 INFO L273 TraceCheckUtils]: 69: Hoare triple {21279#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21279#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,359 INFO L273 TraceCheckUtils]: 70: Hoare triple {21279#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21279#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:12,360 INFO L273 TraceCheckUtils]: 71: Hoare triple {21279#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21280#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,360 INFO L273 TraceCheckUtils]: 72: Hoare triple {21280#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21280#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,361 INFO L273 TraceCheckUtils]: 73: Hoare triple {21280#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21280#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:12,362 INFO L273 TraceCheckUtils]: 74: Hoare triple {21280#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21281#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,362 INFO L273 TraceCheckUtils]: 75: Hoare triple {21281#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21281#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,363 INFO L273 TraceCheckUtils]: 76: Hoare triple {21281#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21281#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:12,364 INFO L273 TraceCheckUtils]: 77: Hoare triple {21281#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21282#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,364 INFO L273 TraceCheckUtils]: 78: Hoare triple {21282#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21282#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,365 INFO L273 TraceCheckUtils]: 79: Hoare triple {21282#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21282#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:12,366 INFO L273 TraceCheckUtils]: 80: Hoare triple {21282#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21283#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,366 INFO L273 TraceCheckUtils]: 81: Hoare triple {21283#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21283#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,367 INFO L273 TraceCheckUtils]: 82: Hoare triple {21283#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21283#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:12,368 INFO L273 TraceCheckUtils]: 83: Hoare triple {21283#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21284#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,369 INFO L273 TraceCheckUtils]: 84: Hoare triple {21284#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21284#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,369 INFO L273 TraceCheckUtils]: 85: Hoare triple {21284#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21284#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:12,370 INFO L273 TraceCheckUtils]: 86: Hoare triple {21284#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21285#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,371 INFO L273 TraceCheckUtils]: 87: Hoare triple {21285#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21285#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,371 INFO L273 TraceCheckUtils]: 88: Hoare triple {21285#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21285#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:12,372 INFO L273 TraceCheckUtils]: 89: Hoare triple {21285#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21286#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,373 INFO L273 TraceCheckUtils]: 90: Hoare triple {21286#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21286#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,373 INFO L273 TraceCheckUtils]: 91: Hoare triple {21286#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21286#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:12,374 INFO L273 TraceCheckUtils]: 92: Hoare triple {21286#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21287#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,374 INFO L273 TraceCheckUtils]: 93: Hoare triple {21287#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21287#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,375 INFO L273 TraceCheckUtils]: 94: Hoare triple {21287#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21287#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:12,376 INFO L273 TraceCheckUtils]: 95: Hoare triple {21287#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21288#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,376 INFO L273 TraceCheckUtils]: 96: Hoare triple {21288#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21288#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,377 INFO L273 TraceCheckUtils]: 97: Hoare triple {21288#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21288#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:12,378 INFO L273 TraceCheckUtils]: 98: Hoare triple {21288#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21289#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,378 INFO L273 TraceCheckUtils]: 99: Hoare triple {21289#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21289#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,379 INFO L273 TraceCheckUtils]: 100: Hoare triple {21289#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21289#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:12,380 INFO L273 TraceCheckUtils]: 101: Hoare triple {21289#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21290#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,380 INFO L273 TraceCheckUtils]: 102: Hoare triple {21290#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21290#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,381 INFO L273 TraceCheckUtils]: 103: Hoare triple {21290#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21290#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:12,382 INFO L273 TraceCheckUtils]: 104: Hoare triple {21290#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21291#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,382 INFO L273 TraceCheckUtils]: 105: Hoare triple {21291#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21291#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,383 INFO L273 TraceCheckUtils]: 106: Hoare triple {21291#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21291#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:12,384 INFO L273 TraceCheckUtils]: 107: Hoare triple {21291#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21292#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,384 INFO L273 TraceCheckUtils]: 108: Hoare triple {21292#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21292#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,385 INFO L273 TraceCheckUtils]: 109: Hoare triple {21292#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21292#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:12,386 INFO L273 TraceCheckUtils]: 110: Hoare triple {21292#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21293#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:12,387 INFO L273 TraceCheckUtils]: 111: Hoare triple {21293#(<= main_~i~0 35)} assume !(~i~0 < 100000); {21257#false} is VALID [2018-11-23 12:07:12,387 INFO L273 TraceCheckUtils]: 112: Hoare triple {21257#false} havoc ~x~0;~x~0 := 0; {21257#false} is VALID [2018-11-23 12:07:12,387 INFO L273 TraceCheckUtils]: 113: Hoare triple {21257#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {21257#false} is VALID [2018-11-23 12:07:12,387 INFO L256 TraceCheckUtils]: 114: Hoare triple {21257#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {21257#false} is VALID [2018-11-23 12:07:12,387 INFO L273 TraceCheckUtils]: 115: Hoare triple {21257#false} ~cond := #in~cond; {21257#false} is VALID [2018-11-23 12:07:12,387 INFO L273 TraceCheckUtils]: 116: Hoare triple {21257#false} assume 0 == ~cond; {21257#false} is VALID [2018-11-23 12:07:12,388 INFO L273 TraceCheckUtils]: 117: Hoare triple {21257#false} assume !false; {21257#false} is VALID [2018-11-23 12:07:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:12,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:12,400 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 12:07:12,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:07:13,835 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 12:07:13,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:13,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:14,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {21256#true} call ULTIMATE.init(); {21256#true} is VALID [2018-11-23 12:07:14,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {21256#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21256#true} is VALID [2018-11-23 12:07:14,204 INFO L273 TraceCheckUtils]: 2: Hoare triple {21256#true} assume true; {21256#true} is VALID [2018-11-23 12:07:14,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21256#true} {21256#true} #70#return; {21256#true} is VALID [2018-11-23 12:07:14,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {21256#true} call #t~ret7 := main(); {21256#true} is VALID [2018-11-23 12:07:14,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {21256#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {21312#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:14,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {21312#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21312#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:14,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {21312#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21312#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:14,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {21312#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21259#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:14,207 INFO L273 TraceCheckUtils]: 9: Hoare triple {21259#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21259#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:14,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {21259#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21259#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:14,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {21259#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21260#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:14,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {21260#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21260#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:14,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {21260#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21260#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:14,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {21260#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21261#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:14,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {21261#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21261#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:14,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {21261#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21261#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:14,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {21261#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21262#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:14,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {21262#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21262#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:14,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {21262#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21262#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:14,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {21262#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21263#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:14,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {21263#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21263#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:14,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {21263#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21263#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:14,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {21263#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21264#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:14,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {21264#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21264#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:14,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {21264#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21264#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:14,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {21264#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21265#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:14,219 INFO L273 TraceCheckUtils]: 27: Hoare triple {21265#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21265#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:14,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {21265#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21265#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:14,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {21265#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21266#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:14,221 INFO L273 TraceCheckUtils]: 30: Hoare triple {21266#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21266#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:14,222 INFO L273 TraceCheckUtils]: 31: Hoare triple {21266#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21266#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:14,222 INFO L273 TraceCheckUtils]: 32: Hoare triple {21266#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21267#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:14,223 INFO L273 TraceCheckUtils]: 33: Hoare triple {21267#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21267#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:14,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {21267#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21267#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:14,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {21267#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21268#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:14,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {21268#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21268#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:14,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {21268#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21268#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:14,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {21268#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21269#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:14,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {21269#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21269#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:14,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {21269#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21269#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:14,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {21269#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21270#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:14,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {21270#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21270#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:14,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {21270#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21270#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:14,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {21270#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21271#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:14,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {21271#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21271#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:14,231 INFO L273 TraceCheckUtils]: 46: Hoare triple {21271#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21271#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:14,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {21271#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21272#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:14,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {21272#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21272#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:14,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {21272#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21272#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:14,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {21272#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21273#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:14,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {21273#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21273#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:14,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {21273#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21273#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:14,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {21273#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21274#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:14,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {21274#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21274#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:14,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {21274#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21274#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:14,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {21274#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21275#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:14,239 INFO L273 TraceCheckUtils]: 57: Hoare triple {21275#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21275#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:14,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {21275#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21275#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:14,240 INFO L273 TraceCheckUtils]: 59: Hoare triple {21275#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21276#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:14,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {21276#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21276#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:14,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {21276#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21276#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:14,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {21276#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21277#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:14,243 INFO L273 TraceCheckUtils]: 63: Hoare triple {21277#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21277#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:14,243 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21277#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:14,244 INFO L273 TraceCheckUtils]: 65: Hoare triple {21277#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21278#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:14,245 INFO L273 TraceCheckUtils]: 66: Hoare triple {21278#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21278#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:14,245 INFO L273 TraceCheckUtils]: 67: Hoare triple {21278#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21278#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:14,246 INFO L273 TraceCheckUtils]: 68: Hoare triple {21278#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21279#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:14,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {21279#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21279#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:14,247 INFO L273 TraceCheckUtils]: 70: Hoare triple {21279#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21279#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:14,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {21279#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21280#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:14,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {21280#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21280#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:14,249 INFO L273 TraceCheckUtils]: 73: Hoare triple {21280#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21280#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:14,250 INFO L273 TraceCheckUtils]: 74: Hoare triple {21280#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21281#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:14,251 INFO L273 TraceCheckUtils]: 75: Hoare triple {21281#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21281#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:14,251 INFO L273 TraceCheckUtils]: 76: Hoare triple {21281#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21281#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:14,252 INFO L273 TraceCheckUtils]: 77: Hoare triple {21281#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21282#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:14,253 INFO L273 TraceCheckUtils]: 78: Hoare triple {21282#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21282#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:14,253 INFO L273 TraceCheckUtils]: 79: Hoare triple {21282#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21282#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:14,254 INFO L273 TraceCheckUtils]: 80: Hoare triple {21282#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21283#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:14,255 INFO L273 TraceCheckUtils]: 81: Hoare triple {21283#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21283#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:14,256 INFO L273 TraceCheckUtils]: 82: Hoare triple {21283#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21283#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:14,256 INFO L273 TraceCheckUtils]: 83: Hoare triple {21283#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21284#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:14,257 INFO L273 TraceCheckUtils]: 84: Hoare triple {21284#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21284#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:14,257 INFO L273 TraceCheckUtils]: 85: Hoare triple {21284#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21284#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:14,258 INFO L273 TraceCheckUtils]: 86: Hoare triple {21284#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21285#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:14,259 INFO L273 TraceCheckUtils]: 87: Hoare triple {21285#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21285#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:14,259 INFO L273 TraceCheckUtils]: 88: Hoare triple {21285#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21285#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:14,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {21285#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21286#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:14,261 INFO L273 TraceCheckUtils]: 90: Hoare triple {21286#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21286#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:14,261 INFO L273 TraceCheckUtils]: 91: Hoare triple {21286#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21286#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:14,262 INFO L273 TraceCheckUtils]: 92: Hoare triple {21286#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21287#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:14,263 INFO L273 TraceCheckUtils]: 93: Hoare triple {21287#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21287#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:14,263 INFO L273 TraceCheckUtils]: 94: Hoare triple {21287#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21287#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:14,264 INFO L273 TraceCheckUtils]: 95: Hoare triple {21287#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21288#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:14,265 INFO L273 TraceCheckUtils]: 96: Hoare triple {21288#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21288#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:14,265 INFO L273 TraceCheckUtils]: 97: Hoare triple {21288#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21288#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:14,266 INFO L273 TraceCheckUtils]: 98: Hoare triple {21288#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21289#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:14,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {21289#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21289#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:14,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {21289#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21289#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:14,268 INFO L273 TraceCheckUtils]: 101: Hoare triple {21289#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21290#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:14,269 INFO L273 TraceCheckUtils]: 102: Hoare triple {21290#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21290#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:14,269 INFO L273 TraceCheckUtils]: 103: Hoare triple {21290#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21290#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:14,270 INFO L273 TraceCheckUtils]: 104: Hoare triple {21290#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21291#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:14,271 INFO L273 TraceCheckUtils]: 105: Hoare triple {21291#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21291#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:14,271 INFO L273 TraceCheckUtils]: 106: Hoare triple {21291#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21291#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:14,272 INFO L273 TraceCheckUtils]: 107: Hoare triple {21291#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21292#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:14,273 INFO L273 TraceCheckUtils]: 108: Hoare triple {21292#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21292#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:14,273 INFO L273 TraceCheckUtils]: 109: Hoare triple {21292#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {21292#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:14,276 INFO L273 TraceCheckUtils]: 110: Hoare triple {21292#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21293#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:14,278 INFO L273 TraceCheckUtils]: 111: Hoare triple {21293#(<= main_~i~0 35)} assume !(~i~0 < 100000); {21257#false} is VALID [2018-11-23 12:07:14,278 INFO L273 TraceCheckUtils]: 112: Hoare triple {21257#false} havoc ~x~0;~x~0 := 0; {21257#false} is VALID [2018-11-23 12:07:14,278 INFO L273 TraceCheckUtils]: 113: Hoare triple {21257#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {21257#false} is VALID [2018-11-23 12:07:14,278 INFO L256 TraceCheckUtils]: 114: Hoare triple {21257#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {21257#false} is VALID [2018-11-23 12:07:14,279 INFO L273 TraceCheckUtils]: 115: Hoare triple {21257#false} ~cond := #in~cond; {21257#false} is VALID [2018-11-23 12:07:14,279 INFO L273 TraceCheckUtils]: 116: Hoare triple {21257#false} assume 0 == ~cond; {21257#false} is VALID [2018-11-23 12:07:14,279 INFO L273 TraceCheckUtils]: 117: Hoare triple {21257#false} assume !false; {21257#false} is VALID [2018-11-23 12:07:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:14,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:14,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:07:14,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 12:07:14,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:14,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:07:14,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:14,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:07:14,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:07:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:07:14,506 INFO L87 Difference]: Start difference. First operand 128 states and 166 transitions. Second operand 39 states. [2018-11-23 12:07:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:15,664 INFO L93 Difference]: Finished difference Result 149 states and 192 transitions. [2018-11-23 12:07:15,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:07:15,665 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-23 12:07:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:07:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 192 transitions. [2018-11-23 12:07:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:07:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 192 transitions. [2018-11-23 12:07:15,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 192 transitions. [2018-11-23 12:07:15,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:15,884 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:07:15,884 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:07:15,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:07:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:07:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:07:16,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:16,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:07:16,178 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:07:16,178 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:07:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:16,181 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2018-11-23 12:07:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2018-11-23 12:07:16,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:16,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:16,182 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:07:16,182 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:07:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:16,184 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2018-11-23 12:07:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2018-11-23 12:07:16,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:16,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:16,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:16,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:07:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 170 transitions. [2018-11-23 12:07:16,187 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 170 transitions. Word has length 118 [2018-11-23 12:07:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:16,187 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 170 transitions. [2018-11-23 12:07:16,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:07:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2018-11-23 12:07:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 12:07:16,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:16,188 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:16,189 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:16,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1363423161, now seen corresponding path program 36 times [2018-11-23 12:07:16,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:16,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:16,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:16,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:16,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:18,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {22291#true} call ULTIMATE.init(); {22291#true} is VALID [2018-11-23 12:07:18,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {22291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22291#true} is VALID [2018-11-23 12:07:18,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {22291#true} assume true; {22291#true} is VALID [2018-11-23 12:07:18,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22291#true} {22291#true} #70#return; {22291#true} is VALID [2018-11-23 12:07:18,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {22291#true} call #t~ret7 := main(); {22291#true} is VALID [2018-11-23 12:07:18,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {22291#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {22293#(= main_~i~0 0)} is VALID [2018-11-23 12:07:18,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {22293#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22293#(= main_~i~0 0)} is VALID [2018-11-23 12:07:18,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {22293#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22293#(= main_~i~0 0)} is VALID [2018-11-23 12:07:18,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {22293#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22294#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:18,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {22294#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22294#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:18,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {22294#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22294#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:18,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {22294#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22295#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:18,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {22295#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22295#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:18,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {22295#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22295#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:18,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {22295#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22296#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:18,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {22296#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22296#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:18,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {22296#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22296#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:18,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {22296#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22297#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:18,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {22297#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22297#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:18,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {22297#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22297#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:18,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {22297#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22298#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:18,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {22298#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22298#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:18,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {22298#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22298#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:18,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {22298#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22299#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:18,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {22299#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22299#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:18,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {22299#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22299#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:18,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {22299#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22300#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:18,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {22300#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22300#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:18,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {22300#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22300#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:18,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {22300#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22301#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:18,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {22301#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22301#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:18,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {22301#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22301#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:18,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {22301#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22302#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:18,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {22302#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22302#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:18,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {22302#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22302#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:18,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {22302#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22303#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:18,622 INFO L273 TraceCheckUtils]: 36: Hoare triple {22303#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22303#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:18,623 INFO L273 TraceCheckUtils]: 37: Hoare triple {22303#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22303#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:18,624 INFO L273 TraceCheckUtils]: 38: Hoare triple {22303#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22304#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:18,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {22304#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22304#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:18,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {22304#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22304#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:18,626 INFO L273 TraceCheckUtils]: 41: Hoare triple {22304#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22305#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:18,626 INFO L273 TraceCheckUtils]: 42: Hoare triple {22305#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22305#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:18,627 INFO L273 TraceCheckUtils]: 43: Hoare triple {22305#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22305#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:18,628 INFO L273 TraceCheckUtils]: 44: Hoare triple {22305#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22306#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:18,629 INFO L273 TraceCheckUtils]: 45: Hoare triple {22306#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22306#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:18,629 INFO L273 TraceCheckUtils]: 46: Hoare triple {22306#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22306#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:18,630 INFO L273 TraceCheckUtils]: 47: Hoare triple {22306#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22307#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:18,630 INFO L273 TraceCheckUtils]: 48: Hoare triple {22307#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22307#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:18,631 INFO L273 TraceCheckUtils]: 49: Hoare triple {22307#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22307#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:18,632 INFO L273 TraceCheckUtils]: 50: Hoare triple {22307#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22308#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:18,633 INFO L273 TraceCheckUtils]: 51: Hoare triple {22308#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22308#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:18,633 INFO L273 TraceCheckUtils]: 52: Hoare triple {22308#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22308#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:18,634 INFO L273 TraceCheckUtils]: 53: Hoare triple {22308#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22309#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:18,635 INFO L273 TraceCheckUtils]: 54: Hoare triple {22309#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22309#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:18,635 INFO L273 TraceCheckUtils]: 55: Hoare triple {22309#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22309#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:18,636 INFO L273 TraceCheckUtils]: 56: Hoare triple {22309#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22310#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:18,637 INFO L273 TraceCheckUtils]: 57: Hoare triple {22310#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22310#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:18,637 INFO L273 TraceCheckUtils]: 58: Hoare triple {22310#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22310#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:18,638 INFO L273 TraceCheckUtils]: 59: Hoare triple {22310#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22311#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:18,639 INFO L273 TraceCheckUtils]: 60: Hoare triple {22311#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22311#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:18,639 INFO L273 TraceCheckUtils]: 61: Hoare triple {22311#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22311#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:18,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {22311#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22312#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:18,641 INFO L273 TraceCheckUtils]: 63: Hoare triple {22312#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22312#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:18,641 INFO L273 TraceCheckUtils]: 64: Hoare triple {22312#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22312#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:18,642 INFO L273 TraceCheckUtils]: 65: Hoare triple {22312#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22313#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:18,643 INFO L273 TraceCheckUtils]: 66: Hoare triple {22313#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22313#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:18,643 INFO L273 TraceCheckUtils]: 67: Hoare triple {22313#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22313#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:18,644 INFO L273 TraceCheckUtils]: 68: Hoare triple {22313#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22314#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:18,645 INFO L273 TraceCheckUtils]: 69: Hoare triple {22314#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22314#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:18,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {22314#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22314#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:18,646 INFO L273 TraceCheckUtils]: 71: Hoare triple {22314#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22315#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:18,647 INFO L273 TraceCheckUtils]: 72: Hoare triple {22315#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22315#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:18,647 INFO L273 TraceCheckUtils]: 73: Hoare triple {22315#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22315#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:18,648 INFO L273 TraceCheckUtils]: 74: Hoare triple {22315#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22316#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:18,649 INFO L273 TraceCheckUtils]: 75: Hoare triple {22316#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22316#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:18,649 INFO L273 TraceCheckUtils]: 76: Hoare triple {22316#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22316#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:18,650 INFO L273 TraceCheckUtils]: 77: Hoare triple {22316#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22317#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:18,651 INFO L273 TraceCheckUtils]: 78: Hoare triple {22317#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22317#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:18,651 INFO L273 TraceCheckUtils]: 79: Hoare triple {22317#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22317#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:18,652 INFO L273 TraceCheckUtils]: 80: Hoare triple {22317#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22318#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:18,653 INFO L273 TraceCheckUtils]: 81: Hoare triple {22318#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22318#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:18,653 INFO L273 TraceCheckUtils]: 82: Hoare triple {22318#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22318#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:18,654 INFO L273 TraceCheckUtils]: 83: Hoare triple {22318#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22319#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:18,655 INFO L273 TraceCheckUtils]: 84: Hoare triple {22319#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22319#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:18,655 INFO L273 TraceCheckUtils]: 85: Hoare triple {22319#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22319#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:18,656 INFO L273 TraceCheckUtils]: 86: Hoare triple {22319#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22320#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:18,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {22320#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22320#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:18,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {22320#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22320#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:18,658 INFO L273 TraceCheckUtils]: 89: Hoare triple {22320#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22321#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:18,659 INFO L273 TraceCheckUtils]: 90: Hoare triple {22321#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22321#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:18,660 INFO L273 TraceCheckUtils]: 91: Hoare triple {22321#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22321#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:18,660 INFO L273 TraceCheckUtils]: 92: Hoare triple {22321#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22322#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:18,661 INFO L273 TraceCheckUtils]: 93: Hoare triple {22322#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22322#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:18,661 INFO L273 TraceCheckUtils]: 94: Hoare triple {22322#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22322#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:18,662 INFO L273 TraceCheckUtils]: 95: Hoare triple {22322#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22323#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:18,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {22323#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22323#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:18,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {22323#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22323#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:18,664 INFO L273 TraceCheckUtils]: 98: Hoare triple {22323#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22324#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:18,665 INFO L273 TraceCheckUtils]: 99: Hoare triple {22324#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22324#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:18,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {22324#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22324#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:18,666 INFO L273 TraceCheckUtils]: 101: Hoare triple {22324#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22325#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:18,667 INFO L273 TraceCheckUtils]: 102: Hoare triple {22325#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22325#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:18,667 INFO L273 TraceCheckUtils]: 103: Hoare triple {22325#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22325#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:18,668 INFO L273 TraceCheckUtils]: 104: Hoare triple {22325#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22326#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:18,669 INFO L273 TraceCheckUtils]: 105: Hoare triple {22326#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22326#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:18,669 INFO L273 TraceCheckUtils]: 106: Hoare triple {22326#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22326#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:18,670 INFO L273 TraceCheckUtils]: 107: Hoare triple {22326#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22327#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:18,671 INFO L273 TraceCheckUtils]: 108: Hoare triple {22327#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22327#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:18,672 INFO L273 TraceCheckUtils]: 109: Hoare triple {22327#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22327#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:18,672 INFO L273 TraceCheckUtils]: 110: Hoare triple {22327#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22328#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:18,673 INFO L273 TraceCheckUtils]: 111: Hoare triple {22328#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22328#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:18,674 INFO L273 TraceCheckUtils]: 112: Hoare triple {22328#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22328#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:18,674 INFO L273 TraceCheckUtils]: 113: Hoare triple {22328#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22329#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:18,675 INFO L273 TraceCheckUtils]: 114: Hoare triple {22329#(<= main_~i~0 36)} assume !(~i~0 < 100000); {22292#false} is VALID [2018-11-23 12:07:18,675 INFO L273 TraceCheckUtils]: 115: Hoare triple {22292#false} havoc ~x~0;~x~0 := 0; {22292#false} is VALID [2018-11-23 12:07:18,675 INFO L273 TraceCheckUtils]: 116: Hoare triple {22292#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {22292#false} is VALID [2018-11-23 12:07:18,676 INFO L256 TraceCheckUtils]: 117: Hoare triple {22292#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {22292#false} is VALID [2018-11-23 12:07:18,676 INFO L273 TraceCheckUtils]: 118: Hoare triple {22292#false} ~cond := #in~cond; {22292#false} is VALID [2018-11-23 12:07:18,676 INFO L273 TraceCheckUtils]: 119: Hoare triple {22292#false} assume 0 == ~cond; {22292#false} is VALID [2018-11-23 12:07:18,676 INFO L273 TraceCheckUtils]: 120: Hoare triple {22292#false} assume !false; {22292#false} is VALID [2018-11-23 12:07:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:18,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:18,688 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 12:07:18,698 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:07:30,457 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 12:07:30,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:30,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:31,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {22291#true} call ULTIMATE.init(); {22291#true} is VALID [2018-11-23 12:07:31,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {22291#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22291#true} is VALID [2018-11-23 12:07:31,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {22291#true} assume true; {22291#true} is VALID [2018-11-23 12:07:31,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22291#true} {22291#true} #70#return; {22291#true} is VALID [2018-11-23 12:07:31,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {22291#true} call #t~ret7 := main(); {22291#true} is VALID [2018-11-23 12:07:31,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {22291#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {22348#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:31,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {22348#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22348#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:31,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {22348#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22348#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:31,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {22348#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22294#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:31,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {22294#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22294#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:31,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {22294#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22294#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:31,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {22294#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22295#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:31,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {22295#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22295#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:31,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {22295#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22295#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:31,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {22295#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22296#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:31,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {22296#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22296#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:31,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {22296#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22296#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:31,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {22296#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22297#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:31,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {22297#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22297#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:31,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {22297#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22297#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:31,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {22297#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22298#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:31,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {22298#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22298#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:31,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {22298#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22298#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:31,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {22298#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22299#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:31,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {22299#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22299#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:31,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {22299#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22299#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:31,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {22299#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22300#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:31,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {22300#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22300#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:31,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {22300#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22300#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:31,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {22300#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22301#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:31,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {22301#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22301#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:31,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {22301#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22301#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:31,218 INFO L273 TraceCheckUtils]: 32: Hoare triple {22301#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22302#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:31,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {22302#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22302#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:31,219 INFO L273 TraceCheckUtils]: 34: Hoare triple {22302#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22302#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:31,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {22302#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22303#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:31,219 INFO L273 TraceCheckUtils]: 36: Hoare triple {22303#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22303#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:31,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {22303#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22303#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:31,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {22303#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22304#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:31,220 INFO L273 TraceCheckUtils]: 39: Hoare triple {22304#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22304#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:31,221 INFO L273 TraceCheckUtils]: 40: Hoare triple {22304#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22304#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:31,221 INFO L273 TraceCheckUtils]: 41: Hoare triple {22304#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22305#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:31,222 INFO L273 TraceCheckUtils]: 42: Hoare triple {22305#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22305#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:31,223 INFO L273 TraceCheckUtils]: 43: Hoare triple {22305#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22305#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:31,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {22305#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22306#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:31,224 INFO L273 TraceCheckUtils]: 45: Hoare triple {22306#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22306#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:31,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {22306#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22306#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:31,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {22306#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22307#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:31,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {22307#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22307#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:31,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {22307#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22307#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:31,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {22307#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22308#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:31,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {22308#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22308#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:31,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {22308#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22308#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:31,230 INFO L273 TraceCheckUtils]: 53: Hoare triple {22308#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22309#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:31,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {22309#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22309#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:31,231 INFO L273 TraceCheckUtils]: 55: Hoare triple {22309#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22309#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:31,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {22309#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22310#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:31,232 INFO L273 TraceCheckUtils]: 57: Hoare triple {22310#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22310#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:31,233 INFO L273 TraceCheckUtils]: 58: Hoare triple {22310#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22310#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:31,234 INFO L273 TraceCheckUtils]: 59: Hoare triple {22310#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22311#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:31,234 INFO L273 TraceCheckUtils]: 60: Hoare triple {22311#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22311#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:31,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {22311#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22311#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:31,236 INFO L273 TraceCheckUtils]: 62: Hoare triple {22311#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22312#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:31,236 INFO L273 TraceCheckUtils]: 63: Hoare triple {22312#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22312#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:31,237 INFO L273 TraceCheckUtils]: 64: Hoare triple {22312#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22312#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:31,238 INFO L273 TraceCheckUtils]: 65: Hoare triple {22312#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22313#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:31,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {22313#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22313#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:31,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {22313#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22313#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:31,240 INFO L273 TraceCheckUtils]: 68: Hoare triple {22313#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22314#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:31,240 INFO L273 TraceCheckUtils]: 69: Hoare triple {22314#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22314#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:31,241 INFO L273 TraceCheckUtils]: 70: Hoare triple {22314#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22314#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:31,242 INFO L273 TraceCheckUtils]: 71: Hoare triple {22314#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22315#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:31,242 INFO L273 TraceCheckUtils]: 72: Hoare triple {22315#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22315#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:31,243 INFO L273 TraceCheckUtils]: 73: Hoare triple {22315#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22315#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:31,244 INFO L273 TraceCheckUtils]: 74: Hoare triple {22315#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22316#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:31,244 INFO L273 TraceCheckUtils]: 75: Hoare triple {22316#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22316#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:31,245 INFO L273 TraceCheckUtils]: 76: Hoare triple {22316#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22316#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:31,246 INFO L273 TraceCheckUtils]: 77: Hoare triple {22316#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22317#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:31,246 INFO L273 TraceCheckUtils]: 78: Hoare triple {22317#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22317#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:31,247 INFO L273 TraceCheckUtils]: 79: Hoare triple {22317#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22317#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:31,248 INFO L273 TraceCheckUtils]: 80: Hoare triple {22317#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22318#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:31,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {22318#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22318#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:31,249 INFO L273 TraceCheckUtils]: 82: Hoare triple {22318#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22318#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:31,250 INFO L273 TraceCheckUtils]: 83: Hoare triple {22318#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22319#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:31,250 INFO L273 TraceCheckUtils]: 84: Hoare triple {22319#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22319#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:31,251 INFO L273 TraceCheckUtils]: 85: Hoare triple {22319#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22319#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:31,252 INFO L273 TraceCheckUtils]: 86: Hoare triple {22319#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22320#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:31,252 INFO L273 TraceCheckUtils]: 87: Hoare triple {22320#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22320#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:31,253 INFO L273 TraceCheckUtils]: 88: Hoare triple {22320#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22320#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:31,254 INFO L273 TraceCheckUtils]: 89: Hoare triple {22320#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22321#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:31,254 INFO L273 TraceCheckUtils]: 90: Hoare triple {22321#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22321#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:31,255 INFO L273 TraceCheckUtils]: 91: Hoare triple {22321#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22321#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:31,256 INFO L273 TraceCheckUtils]: 92: Hoare triple {22321#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22322#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:31,256 INFO L273 TraceCheckUtils]: 93: Hoare triple {22322#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22322#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:31,257 INFO L273 TraceCheckUtils]: 94: Hoare triple {22322#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22322#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:31,258 INFO L273 TraceCheckUtils]: 95: Hoare triple {22322#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22323#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:31,258 INFO L273 TraceCheckUtils]: 96: Hoare triple {22323#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22323#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:31,259 INFO L273 TraceCheckUtils]: 97: Hoare triple {22323#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22323#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:31,260 INFO L273 TraceCheckUtils]: 98: Hoare triple {22323#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22324#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:31,260 INFO L273 TraceCheckUtils]: 99: Hoare triple {22324#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22324#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:31,261 INFO L273 TraceCheckUtils]: 100: Hoare triple {22324#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22324#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:31,262 INFO L273 TraceCheckUtils]: 101: Hoare triple {22324#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22325#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:31,262 INFO L273 TraceCheckUtils]: 102: Hoare triple {22325#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22325#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:31,263 INFO L273 TraceCheckUtils]: 103: Hoare triple {22325#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22325#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:31,264 INFO L273 TraceCheckUtils]: 104: Hoare triple {22325#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22326#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:31,264 INFO L273 TraceCheckUtils]: 105: Hoare triple {22326#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22326#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:31,265 INFO L273 TraceCheckUtils]: 106: Hoare triple {22326#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22326#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:31,266 INFO L273 TraceCheckUtils]: 107: Hoare triple {22326#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22327#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:31,266 INFO L273 TraceCheckUtils]: 108: Hoare triple {22327#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22327#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:31,267 INFO L273 TraceCheckUtils]: 109: Hoare triple {22327#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22327#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:31,268 INFO L273 TraceCheckUtils]: 110: Hoare triple {22327#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22328#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:31,268 INFO L273 TraceCheckUtils]: 111: Hoare triple {22328#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22328#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:31,269 INFO L273 TraceCheckUtils]: 112: Hoare triple {22328#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {22328#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:31,270 INFO L273 TraceCheckUtils]: 113: Hoare triple {22328#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {22329#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:31,271 INFO L273 TraceCheckUtils]: 114: Hoare triple {22329#(<= main_~i~0 36)} assume !(~i~0 < 100000); {22292#false} is VALID [2018-11-23 12:07:31,271 INFO L273 TraceCheckUtils]: 115: Hoare triple {22292#false} havoc ~x~0;~x~0 := 0; {22292#false} is VALID [2018-11-23 12:07:31,271 INFO L273 TraceCheckUtils]: 116: Hoare triple {22292#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {22292#false} is VALID [2018-11-23 12:07:31,271 INFO L256 TraceCheckUtils]: 117: Hoare triple {22292#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {22292#false} is VALID [2018-11-23 12:07:31,271 INFO L273 TraceCheckUtils]: 118: Hoare triple {22292#false} ~cond := #in~cond; {22292#false} is VALID [2018-11-23 12:07:31,272 INFO L273 TraceCheckUtils]: 119: Hoare triple {22292#false} assume 0 == ~cond; {22292#false} is VALID [2018-11-23 12:07:31,272 INFO L273 TraceCheckUtils]: 120: Hoare triple {22292#false} assume !false; {22292#false} is VALID [2018-11-23 12:07:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:31,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:31,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:07:31,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 12:07:31,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:31,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:07:31,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:31,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:07:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:07:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:07:31,455 INFO L87 Difference]: Start difference. First operand 131 states and 170 transitions. Second operand 40 states. [2018-11-23 12:07:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,621 INFO L93 Difference]: Finished difference Result 152 states and 196 transitions. [2018-11-23 12:07:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:07:32,621 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-23 12:07:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:07:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 196 transitions. [2018-11-23 12:07:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:07:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 196 transitions. [2018-11-23 12:07:32,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 196 transitions. [2018-11-23 12:07:32,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:32,870 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:07:32,870 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 12:07:32,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:07:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 12:07:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-11-23 12:07:32,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:32,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 134 states. [2018-11-23 12:07:32,917 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 134 states. [2018-11-23 12:07:32,917 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 134 states. [2018-11-23 12:07:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,920 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2018-11-23 12:07:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 177 transitions. [2018-11-23 12:07:32,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,921 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 136 states. [2018-11-23 12:07:32,921 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 136 states. [2018-11-23 12:07:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:32,924 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2018-11-23 12:07:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 177 transitions. [2018-11-23 12:07:32,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:32,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:32,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:32,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 12:07:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 174 transitions. [2018-11-23 12:07:32,927 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 174 transitions. Word has length 121 [2018-11-23 12:07:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:32,927 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 174 transitions. [2018-11-23 12:07:32,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:07:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2018-11-23 12:07:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:07:32,928 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:32,928 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:32,928 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:32,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1318677172, now seen corresponding path program 37 times [2018-11-23 12:07:32,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:32,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:32,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:35,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {23350#true} call ULTIMATE.init(); {23350#true} is VALID [2018-11-23 12:07:35,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {23350#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23350#true} is VALID [2018-11-23 12:07:35,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {23350#true} assume true; {23350#true} is VALID [2018-11-23 12:07:35,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23350#true} {23350#true} #70#return; {23350#true} is VALID [2018-11-23 12:07:35,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {23350#true} call #t~ret7 := main(); {23350#true} is VALID [2018-11-23 12:07:35,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {23350#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {23352#(= main_~i~0 0)} is VALID [2018-11-23 12:07:35,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {23352#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23352#(= main_~i~0 0)} is VALID [2018-11-23 12:07:35,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {23352#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23352#(= main_~i~0 0)} is VALID [2018-11-23 12:07:35,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {23352#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23353#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,161 INFO L273 TraceCheckUtils]: 9: Hoare triple {23353#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23353#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {23353#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23353#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {23353#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23354#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {23354#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23354#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {23354#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23354#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {23354#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23355#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {23355#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23355#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {23355#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23355#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {23355#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23356#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {23356#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23356#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {23356#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23356#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {23356#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23357#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {23357#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23357#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,169 INFO L273 TraceCheckUtils]: 22: Hoare triple {23357#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23357#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,170 INFO L273 TraceCheckUtils]: 23: Hoare triple {23357#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23358#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {23358#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23358#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {23358#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23358#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {23358#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23359#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,173 INFO L273 TraceCheckUtils]: 27: Hoare triple {23359#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23359#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,173 INFO L273 TraceCheckUtils]: 28: Hoare triple {23359#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23359#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {23359#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23360#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,175 INFO L273 TraceCheckUtils]: 30: Hoare triple {23360#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23360#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,175 INFO L273 TraceCheckUtils]: 31: Hoare triple {23360#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23360#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,176 INFO L273 TraceCheckUtils]: 32: Hoare triple {23360#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23361#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,177 INFO L273 TraceCheckUtils]: 33: Hoare triple {23361#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23361#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,177 INFO L273 TraceCheckUtils]: 34: Hoare triple {23361#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23361#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,178 INFO L273 TraceCheckUtils]: 35: Hoare triple {23361#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23362#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {23362#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23362#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {23362#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23362#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,180 INFO L273 TraceCheckUtils]: 38: Hoare triple {23362#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23363#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {23363#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23363#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,182 INFO L273 TraceCheckUtils]: 40: Hoare triple {23363#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23363#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {23363#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23364#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {23364#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23364#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,183 INFO L273 TraceCheckUtils]: 43: Hoare triple {23364#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23364#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {23364#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23365#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,185 INFO L273 TraceCheckUtils]: 45: Hoare triple {23365#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23365#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,185 INFO L273 TraceCheckUtils]: 46: Hoare triple {23365#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23365#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {23365#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23366#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,187 INFO L273 TraceCheckUtils]: 48: Hoare triple {23366#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23366#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,187 INFO L273 TraceCheckUtils]: 49: Hoare triple {23366#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23366#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,188 INFO L273 TraceCheckUtils]: 50: Hoare triple {23366#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23367#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,189 INFO L273 TraceCheckUtils]: 51: Hoare triple {23367#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23367#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {23367#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23367#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,190 INFO L273 TraceCheckUtils]: 53: Hoare triple {23367#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23368#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,191 INFO L273 TraceCheckUtils]: 54: Hoare triple {23368#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23368#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,191 INFO L273 TraceCheckUtils]: 55: Hoare triple {23368#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23368#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,192 INFO L273 TraceCheckUtils]: 56: Hoare triple {23368#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23369#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,193 INFO L273 TraceCheckUtils]: 57: Hoare triple {23369#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23369#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,193 INFO L273 TraceCheckUtils]: 58: Hoare triple {23369#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23369#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,194 INFO L273 TraceCheckUtils]: 59: Hoare triple {23369#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23370#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {23370#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23370#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,195 INFO L273 TraceCheckUtils]: 61: Hoare triple {23370#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23370#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,196 INFO L273 TraceCheckUtils]: 62: Hoare triple {23370#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23371#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,196 INFO L273 TraceCheckUtils]: 63: Hoare triple {23371#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23371#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,197 INFO L273 TraceCheckUtils]: 64: Hoare triple {23371#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23371#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,198 INFO L273 TraceCheckUtils]: 65: Hoare triple {23371#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23372#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,198 INFO L273 TraceCheckUtils]: 66: Hoare triple {23372#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23372#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,199 INFO L273 TraceCheckUtils]: 67: Hoare triple {23372#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23372#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,200 INFO L273 TraceCheckUtils]: 68: Hoare triple {23372#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23373#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,200 INFO L273 TraceCheckUtils]: 69: Hoare triple {23373#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23373#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,201 INFO L273 TraceCheckUtils]: 70: Hoare triple {23373#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23373#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,202 INFO L273 TraceCheckUtils]: 71: Hoare triple {23373#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23374#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,202 INFO L273 TraceCheckUtils]: 72: Hoare triple {23374#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23374#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,203 INFO L273 TraceCheckUtils]: 73: Hoare triple {23374#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23374#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,204 INFO L273 TraceCheckUtils]: 74: Hoare triple {23374#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23375#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,204 INFO L273 TraceCheckUtils]: 75: Hoare triple {23375#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23375#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,205 INFO L273 TraceCheckUtils]: 76: Hoare triple {23375#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23375#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,206 INFO L273 TraceCheckUtils]: 77: Hoare triple {23375#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23376#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,206 INFO L273 TraceCheckUtils]: 78: Hoare triple {23376#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23376#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,207 INFO L273 TraceCheckUtils]: 79: Hoare triple {23376#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23376#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,208 INFO L273 TraceCheckUtils]: 80: Hoare triple {23376#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23377#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,208 INFO L273 TraceCheckUtils]: 81: Hoare triple {23377#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23377#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,209 INFO L273 TraceCheckUtils]: 82: Hoare triple {23377#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23377#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,210 INFO L273 TraceCheckUtils]: 83: Hoare triple {23377#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23378#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,210 INFO L273 TraceCheckUtils]: 84: Hoare triple {23378#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23378#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,211 INFO L273 TraceCheckUtils]: 85: Hoare triple {23378#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23378#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,212 INFO L273 TraceCheckUtils]: 86: Hoare triple {23378#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23379#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,212 INFO L273 TraceCheckUtils]: 87: Hoare triple {23379#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23379#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,213 INFO L273 TraceCheckUtils]: 88: Hoare triple {23379#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23379#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,214 INFO L273 TraceCheckUtils]: 89: Hoare triple {23379#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23380#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,214 INFO L273 TraceCheckUtils]: 90: Hoare triple {23380#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23380#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {23380#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23380#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,216 INFO L273 TraceCheckUtils]: 92: Hoare triple {23380#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23381#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,216 INFO L273 TraceCheckUtils]: 93: Hoare triple {23381#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23381#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,217 INFO L273 TraceCheckUtils]: 94: Hoare triple {23381#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23381#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,218 INFO L273 TraceCheckUtils]: 95: Hoare triple {23381#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23382#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,218 INFO L273 TraceCheckUtils]: 96: Hoare triple {23382#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23382#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {23382#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23382#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,220 INFO L273 TraceCheckUtils]: 98: Hoare triple {23382#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23383#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,220 INFO L273 TraceCheckUtils]: 99: Hoare triple {23383#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23383#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,221 INFO L273 TraceCheckUtils]: 100: Hoare triple {23383#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23383#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,222 INFO L273 TraceCheckUtils]: 101: Hoare triple {23383#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23384#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,222 INFO L273 TraceCheckUtils]: 102: Hoare triple {23384#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23384#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,223 INFO L273 TraceCheckUtils]: 103: Hoare triple {23384#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23384#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,224 INFO L273 TraceCheckUtils]: 104: Hoare triple {23384#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23385#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,224 INFO L273 TraceCheckUtils]: 105: Hoare triple {23385#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23385#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,225 INFO L273 TraceCheckUtils]: 106: Hoare triple {23385#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23385#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,226 INFO L273 TraceCheckUtils]: 107: Hoare triple {23385#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23386#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,226 INFO L273 TraceCheckUtils]: 108: Hoare triple {23386#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23386#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,227 INFO L273 TraceCheckUtils]: 109: Hoare triple {23386#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23386#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,228 INFO L273 TraceCheckUtils]: 110: Hoare triple {23386#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23387#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,228 INFO L273 TraceCheckUtils]: 111: Hoare triple {23387#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23387#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,229 INFO L273 TraceCheckUtils]: 112: Hoare triple {23387#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23387#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,230 INFO L273 TraceCheckUtils]: 113: Hoare triple {23387#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23388#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,230 INFO L273 TraceCheckUtils]: 114: Hoare triple {23388#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23388#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,231 INFO L273 TraceCheckUtils]: 115: Hoare triple {23388#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23388#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,232 INFO L273 TraceCheckUtils]: 116: Hoare triple {23388#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23389#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:35,233 INFO L273 TraceCheckUtils]: 117: Hoare triple {23389#(<= main_~i~0 37)} assume !(~i~0 < 100000); {23351#false} is VALID [2018-11-23 12:07:35,233 INFO L273 TraceCheckUtils]: 118: Hoare triple {23351#false} havoc ~x~0;~x~0 := 0; {23351#false} is VALID [2018-11-23 12:07:35,233 INFO L273 TraceCheckUtils]: 119: Hoare triple {23351#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {23351#false} is VALID [2018-11-23 12:07:35,233 INFO L256 TraceCheckUtils]: 120: Hoare triple {23351#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {23351#false} is VALID [2018-11-23 12:07:35,233 INFO L273 TraceCheckUtils]: 121: Hoare triple {23351#false} ~cond := #in~cond; {23351#false} is VALID [2018-11-23 12:07:35,233 INFO L273 TraceCheckUtils]: 122: Hoare triple {23351#false} assume 0 == ~cond; {23351#false} is VALID [2018-11-23 12:07:35,234 INFO L273 TraceCheckUtils]: 123: Hoare triple {23351#false} assume !false; {23351#false} is VALID [2018-11-23 12:07:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:35,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:35,246 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 12:07:35,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:35,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:35,774 INFO L256 TraceCheckUtils]: 0: Hoare triple {23350#true} call ULTIMATE.init(); {23350#true} is VALID [2018-11-23 12:07:35,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {23350#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23350#true} is VALID [2018-11-23 12:07:35,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {23350#true} assume true; {23350#true} is VALID [2018-11-23 12:07:35,775 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23350#true} {23350#true} #70#return; {23350#true} is VALID [2018-11-23 12:07:35,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {23350#true} call #t~ret7 := main(); {23350#true} is VALID [2018-11-23 12:07:35,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {23350#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {23408#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:35,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {23408#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23408#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:35,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {23408#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23408#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:35,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {23408#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23353#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {23353#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23353#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {23353#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23353#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:35,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {23353#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23354#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {23354#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23354#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {23354#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23354#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:35,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {23354#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23355#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {23355#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23355#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {23355#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23355#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:35,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {23355#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23356#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,784 INFO L273 TraceCheckUtils]: 18: Hoare triple {23356#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23356#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {23356#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23356#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:35,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {23356#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23357#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {23357#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23357#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {23357#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23357#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:35,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {23357#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23358#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {23358#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23358#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {23358#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23358#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:35,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {23358#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23359#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {23359#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23359#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {23359#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23359#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:35,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {23359#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23360#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {23360#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23360#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {23360#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23360#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:35,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {23360#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23361#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {23361#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23361#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {23361#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23361#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:35,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {23361#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23362#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {23362#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23362#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {23362#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23362#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:35,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {23362#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23363#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,798 INFO L273 TraceCheckUtils]: 39: Hoare triple {23363#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23363#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {23363#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23363#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:35,799 INFO L273 TraceCheckUtils]: 41: Hoare triple {23363#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23364#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {23364#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23364#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {23364#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23364#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:35,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {23364#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23365#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {23365#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23365#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,803 INFO L273 TraceCheckUtils]: 46: Hoare triple {23365#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23365#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:35,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {23365#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23366#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,804 INFO L273 TraceCheckUtils]: 48: Hoare triple {23366#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23366#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {23366#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23366#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:35,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {23366#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23367#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {23367#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23367#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,807 INFO L273 TraceCheckUtils]: 52: Hoare triple {23367#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23367#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:35,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {23367#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23368#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {23368#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23368#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,809 INFO L273 TraceCheckUtils]: 55: Hoare triple {23368#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23368#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:35,810 INFO L273 TraceCheckUtils]: 56: Hoare triple {23368#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23369#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,810 INFO L273 TraceCheckUtils]: 57: Hoare triple {23369#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23369#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,811 INFO L273 TraceCheckUtils]: 58: Hoare triple {23369#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23369#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:35,812 INFO L273 TraceCheckUtils]: 59: Hoare triple {23369#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23370#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,813 INFO L273 TraceCheckUtils]: 60: Hoare triple {23370#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23370#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,813 INFO L273 TraceCheckUtils]: 61: Hoare triple {23370#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23370#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:35,814 INFO L273 TraceCheckUtils]: 62: Hoare triple {23370#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23371#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,814 INFO L273 TraceCheckUtils]: 63: Hoare triple {23371#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23371#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,815 INFO L273 TraceCheckUtils]: 64: Hoare triple {23371#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23371#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:35,816 INFO L273 TraceCheckUtils]: 65: Hoare triple {23371#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23372#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,817 INFO L273 TraceCheckUtils]: 66: Hoare triple {23372#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23372#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,817 INFO L273 TraceCheckUtils]: 67: Hoare triple {23372#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23372#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:35,818 INFO L273 TraceCheckUtils]: 68: Hoare triple {23372#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23373#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,819 INFO L273 TraceCheckUtils]: 69: Hoare triple {23373#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23373#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,819 INFO L273 TraceCheckUtils]: 70: Hoare triple {23373#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23373#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:35,820 INFO L273 TraceCheckUtils]: 71: Hoare triple {23373#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23374#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,821 INFO L273 TraceCheckUtils]: 72: Hoare triple {23374#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23374#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,821 INFO L273 TraceCheckUtils]: 73: Hoare triple {23374#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23374#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:35,822 INFO L273 TraceCheckUtils]: 74: Hoare triple {23374#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23375#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,823 INFO L273 TraceCheckUtils]: 75: Hoare triple {23375#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23375#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,823 INFO L273 TraceCheckUtils]: 76: Hoare triple {23375#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23375#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:35,824 INFO L273 TraceCheckUtils]: 77: Hoare triple {23375#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23376#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,825 INFO L273 TraceCheckUtils]: 78: Hoare triple {23376#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23376#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,825 INFO L273 TraceCheckUtils]: 79: Hoare triple {23376#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23376#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:35,826 INFO L273 TraceCheckUtils]: 80: Hoare triple {23376#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23377#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,827 INFO L273 TraceCheckUtils]: 81: Hoare triple {23377#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23377#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,827 INFO L273 TraceCheckUtils]: 82: Hoare triple {23377#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23377#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:35,828 INFO L273 TraceCheckUtils]: 83: Hoare triple {23377#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23378#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,829 INFO L273 TraceCheckUtils]: 84: Hoare triple {23378#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23378#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,829 INFO L273 TraceCheckUtils]: 85: Hoare triple {23378#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23378#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:35,830 INFO L273 TraceCheckUtils]: 86: Hoare triple {23378#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23379#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,831 INFO L273 TraceCheckUtils]: 87: Hoare triple {23379#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23379#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,831 INFO L273 TraceCheckUtils]: 88: Hoare triple {23379#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23379#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:35,832 INFO L273 TraceCheckUtils]: 89: Hoare triple {23379#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23380#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,833 INFO L273 TraceCheckUtils]: 90: Hoare triple {23380#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23380#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,833 INFO L273 TraceCheckUtils]: 91: Hoare triple {23380#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23380#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:35,834 INFO L273 TraceCheckUtils]: 92: Hoare triple {23380#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23381#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,835 INFO L273 TraceCheckUtils]: 93: Hoare triple {23381#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23381#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,835 INFO L273 TraceCheckUtils]: 94: Hoare triple {23381#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23381#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:35,836 INFO L273 TraceCheckUtils]: 95: Hoare triple {23381#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23382#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,837 INFO L273 TraceCheckUtils]: 96: Hoare triple {23382#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23382#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,838 INFO L273 TraceCheckUtils]: 97: Hoare triple {23382#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23382#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:35,838 INFO L273 TraceCheckUtils]: 98: Hoare triple {23382#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23383#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,839 INFO L273 TraceCheckUtils]: 99: Hoare triple {23383#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23383#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,840 INFO L273 TraceCheckUtils]: 100: Hoare triple {23383#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23383#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:35,840 INFO L273 TraceCheckUtils]: 101: Hoare triple {23383#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23384#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,841 INFO L273 TraceCheckUtils]: 102: Hoare triple {23384#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23384#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,841 INFO L273 TraceCheckUtils]: 103: Hoare triple {23384#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23384#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:35,842 INFO L273 TraceCheckUtils]: 104: Hoare triple {23384#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23385#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,843 INFO L273 TraceCheckUtils]: 105: Hoare triple {23385#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23385#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,844 INFO L273 TraceCheckUtils]: 106: Hoare triple {23385#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23385#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:35,844 INFO L273 TraceCheckUtils]: 107: Hoare triple {23385#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23386#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,845 INFO L273 TraceCheckUtils]: 108: Hoare triple {23386#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23386#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,846 INFO L273 TraceCheckUtils]: 109: Hoare triple {23386#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23386#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:35,846 INFO L273 TraceCheckUtils]: 110: Hoare triple {23386#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23387#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,847 INFO L273 TraceCheckUtils]: 111: Hoare triple {23387#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23387#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,847 INFO L273 TraceCheckUtils]: 112: Hoare triple {23387#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23387#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:35,848 INFO L273 TraceCheckUtils]: 113: Hoare triple {23387#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23388#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,849 INFO L273 TraceCheckUtils]: 114: Hoare triple {23388#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {23388#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,850 INFO L273 TraceCheckUtils]: 115: Hoare triple {23388#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {23388#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:35,850 INFO L273 TraceCheckUtils]: 116: Hoare triple {23388#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23389#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:35,851 INFO L273 TraceCheckUtils]: 117: Hoare triple {23389#(<= main_~i~0 37)} assume !(~i~0 < 100000); {23351#false} is VALID [2018-11-23 12:07:35,851 INFO L273 TraceCheckUtils]: 118: Hoare triple {23351#false} havoc ~x~0;~x~0 := 0; {23351#false} is VALID [2018-11-23 12:07:35,852 INFO L273 TraceCheckUtils]: 119: Hoare triple {23351#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {23351#false} is VALID [2018-11-23 12:07:35,852 INFO L256 TraceCheckUtils]: 120: Hoare triple {23351#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {23351#false} is VALID [2018-11-23 12:07:35,852 INFO L273 TraceCheckUtils]: 121: Hoare triple {23351#false} ~cond := #in~cond; {23351#false} is VALID [2018-11-23 12:07:35,852 INFO L273 TraceCheckUtils]: 122: Hoare triple {23351#false} assume 0 == ~cond; {23351#false} is VALID [2018-11-23 12:07:35,852 INFO L273 TraceCheckUtils]: 123: Hoare triple {23351#false} assume !false; {23351#false} is VALID [2018-11-23 12:07:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:35,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:35,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:07:35,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 12:07:35,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:35,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:07:36,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:36,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:07:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:07:36,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:07:36,048 INFO L87 Difference]: Start difference. First operand 134 states and 174 transitions. Second operand 41 states. [2018-11-23 12:07:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:37,080 INFO L93 Difference]: Finished difference Result 155 states and 200 transitions. [2018-11-23 12:07:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:07:37,080 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-23 12:07:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:07:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 200 transitions. [2018-11-23 12:07:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:07:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 200 transitions. [2018-11-23 12:07:37,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 200 transitions. [2018-11-23 12:07:37,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:37,357 INFO L225 Difference]: With dead ends: 155 [2018-11-23 12:07:37,357 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 12:07:37,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:07:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 12:07:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-11-23 12:07:37,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:37,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 137 states. [2018-11-23 12:07:37,409 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 137 states. [2018-11-23 12:07:37,409 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 137 states. [2018-11-23 12:07:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:37,412 INFO L93 Difference]: Finished difference Result 139 states and 181 transitions. [2018-11-23 12:07:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2018-11-23 12:07:37,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:37,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:37,412 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 139 states. [2018-11-23 12:07:37,412 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 139 states. [2018-11-23 12:07:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:37,415 INFO L93 Difference]: Finished difference Result 139 states and 181 transitions. [2018-11-23 12:07:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2018-11-23 12:07:37,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:37,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:37,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:37,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-23 12:07:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 178 transitions. [2018-11-23 12:07:37,418 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 178 transitions. Word has length 124 [2018-11-23 12:07:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:37,418 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 178 transitions. [2018-11-23 12:07:37,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:07:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 178 transitions. [2018-11-23 12:07:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 12:07:37,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:37,419 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:37,419 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:37,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash 198122791, now seen corresponding path program 38 times [2018-11-23 12:07:37,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:37,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:37,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:07:37,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:38,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {24433#true} call ULTIMATE.init(); {24433#true} is VALID [2018-11-23 12:07:38,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {24433#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24433#true} is VALID [2018-11-23 12:07:38,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {24433#true} assume true; {24433#true} is VALID [2018-11-23 12:07:38,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24433#true} {24433#true} #70#return; {24433#true} is VALID [2018-11-23 12:07:38,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {24433#true} call #t~ret7 := main(); {24433#true} is VALID [2018-11-23 12:07:38,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {24433#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {24435#(= main_~i~0 0)} is VALID [2018-11-23 12:07:38,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {24435#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24435#(= main_~i~0 0)} is VALID [2018-11-23 12:07:38,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {24435#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24435#(= main_~i~0 0)} is VALID [2018-11-23 12:07:38,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {24435#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24436#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:38,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {24436#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24436#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:38,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {24436#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24436#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:38,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {24436#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24437#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:38,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {24437#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24437#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:38,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {24437#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24437#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:38,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {24437#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24438#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:38,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {24438#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24438#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:38,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {24438#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24438#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:38,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {24438#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24439#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:38,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {24439#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24439#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:38,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {24439#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24439#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:38,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {24439#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24440#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:38,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {24440#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24440#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:38,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {24440#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24440#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:38,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {24440#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24441#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:38,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {24441#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24441#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:38,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {24441#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24441#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:38,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {24441#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24442#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:38,805 INFO L273 TraceCheckUtils]: 27: Hoare triple {24442#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24442#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:38,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {24442#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24442#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:38,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {24442#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24443#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:38,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {24443#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24443#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:38,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {24443#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24443#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:38,809 INFO L273 TraceCheckUtils]: 32: Hoare triple {24443#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24444#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:38,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {24444#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24444#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:38,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {24444#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24444#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:38,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {24444#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24445#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:38,811 INFO L273 TraceCheckUtils]: 36: Hoare triple {24445#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24445#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:38,812 INFO L273 TraceCheckUtils]: 37: Hoare triple {24445#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24445#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:38,812 INFO L273 TraceCheckUtils]: 38: Hoare triple {24445#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24446#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:38,813 INFO L273 TraceCheckUtils]: 39: Hoare triple {24446#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24446#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:38,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {24446#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24446#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:38,815 INFO L273 TraceCheckUtils]: 41: Hoare triple {24446#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24447#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:38,815 INFO L273 TraceCheckUtils]: 42: Hoare triple {24447#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24447#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:38,816 INFO L273 TraceCheckUtils]: 43: Hoare triple {24447#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24447#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:38,816 INFO L273 TraceCheckUtils]: 44: Hoare triple {24447#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24448#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:38,817 INFO L273 TraceCheckUtils]: 45: Hoare triple {24448#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24448#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:38,818 INFO L273 TraceCheckUtils]: 46: Hoare triple {24448#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24448#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:38,818 INFO L273 TraceCheckUtils]: 47: Hoare triple {24448#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24449#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:38,819 INFO L273 TraceCheckUtils]: 48: Hoare triple {24449#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24449#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:38,820 INFO L273 TraceCheckUtils]: 49: Hoare triple {24449#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24449#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:38,820 INFO L273 TraceCheckUtils]: 50: Hoare triple {24449#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24450#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:38,821 INFO L273 TraceCheckUtils]: 51: Hoare triple {24450#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24450#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:38,822 INFO L273 TraceCheckUtils]: 52: Hoare triple {24450#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24450#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:38,822 INFO L273 TraceCheckUtils]: 53: Hoare triple {24450#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24451#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:38,823 INFO L273 TraceCheckUtils]: 54: Hoare triple {24451#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24451#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:38,823 INFO L273 TraceCheckUtils]: 55: Hoare triple {24451#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24451#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:38,824 INFO L273 TraceCheckUtils]: 56: Hoare triple {24451#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24452#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:38,825 INFO L273 TraceCheckUtils]: 57: Hoare triple {24452#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24452#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:38,825 INFO L273 TraceCheckUtils]: 58: Hoare triple {24452#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24452#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:38,826 INFO L273 TraceCheckUtils]: 59: Hoare triple {24452#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24453#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:38,826 INFO L273 TraceCheckUtils]: 60: Hoare triple {24453#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24453#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:38,827 INFO L273 TraceCheckUtils]: 61: Hoare triple {24453#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24453#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:38,828 INFO L273 TraceCheckUtils]: 62: Hoare triple {24453#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24454#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:38,828 INFO L273 TraceCheckUtils]: 63: Hoare triple {24454#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24454#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:38,829 INFO L273 TraceCheckUtils]: 64: Hoare triple {24454#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24454#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:38,830 INFO L273 TraceCheckUtils]: 65: Hoare triple {24454#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24455#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:38,830 INFO L273 TraceCheckUtils]: 66: Hoare triple {24455#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24455#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:38,831 INFO L273 TraceCheckUtils]: 67: Hoare triple {24455#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24455#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:38,832 INFO L273 TraceCheckUtils]: 68: Hoare triple {24455#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24456#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:38,832 INFO L273 TraceCheckUtils]: 69: Hoare triple {24456#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24456#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:38,833 INFO L273 TraceCheckUtils]: 70: Hoare triple {24456#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24456#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:38,833 INFO L273 TraceCheckUtils]: 71: Hoare triple {24456#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24457#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:38,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {24457#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24457#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:38,835 INFO L273 TraceCheckUtils]: 73: Hoare triple {24457#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24457#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:38,835 INFO L273 TraceCheckUtils]: 74: Hoare triple {24457#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24458#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:38,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {24458#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24458#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:38,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {24458#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24458#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:38,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {24458#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24459#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:38,838 INFO L273 TraceCheckUtils]: 78: Hoare triple {24459#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24459#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:38,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {24459#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24459#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:38,839 INFO L273 TraceCheckUtils]: 80: Hoare triple {24459#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24460#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:38,840 INFO L273 TraceCheckUtils]: 81: Hoare triple {24460#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24460#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:38,840 INFO L273 TraceCheckUtils]: 82: Hoare triple {24460#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24460#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:38,841 INFO L273 TraceCheckUtils]: 83: Hoare triple {24460#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24461#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:38,842 INFO L273 TraceCheckUtils]: 84: Hoare triple {24461#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24461#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:38,842 INFO L273 TraceCheckUtils]: 85: Hoare triple {24461#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24461#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:38,843 INFO L273 TraceCheckUtils]: 86: Hoare triple {24461#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24462#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:38,843 INFO L273 TraceCheckUtils]: 87: Hoare triple {24462#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24462#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:38,844 INFO L273 TraceCheckUtils]: 88: Hoare triple {24462#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24462#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:38,845 INFO L273 TraceCheckUtils]: 89: Hoare triple {24462#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24463#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:38,845 INFO L273 TraceCheckUtils]: 90: Hoare triple {24463#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24463#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:38,846 INFO L273 TraceCheckUtils]: 91: Hoare triple {24463#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24463#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:38,846 INFO L273 TraceCheckUtils]: 92: Hoare triple {24463#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24464#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:38,847 INFO L273 TraceCheckUtils]: 93: Hoare triple {24464#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24464#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:38,847 INFO L273 TraceCheckUtils]: 94: Hoare triple {24464#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24464#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:38,848 INFO L273 TraceCheckUtils]: 95: Hoare triple {24464#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24465#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:38,849 INFO L273 TraceCheckUtils]: 96: Hoare triple {24465#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24465#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:38,849 INFO L273 TraceCheckUtils]: 97: Hoare triple {24465#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24465#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:38,850 INFO L273 TraceCheckUtils]: 98: Hoare triple {24465#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24466#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:38,851 INFO L273 TraceCheckUtils]: 99: Hoare triple {24466#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24466#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:38,851 INFO L273 TraceCheckUtils]: 100: Hoare triple {24466#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24466#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:38,852 INFO L273 TraceCheckUtils]: 101: Hoare triple {24466#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24467#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:38,853 INFO L273 TraceCheckUtils]: 102: Hoare triple {24467#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24467#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:38,853 INFO L273 TraceCheckUtils]: 103: Hoare triple {24467#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24467#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:38,854 INFO L273 TraceCheckUtils]: 104: Hoare triple {24467#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24468#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:38,855 INFO L273 TraceCheckUtils]: 105: Hoare triple {24468#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24468#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:38,855 INFO L273 TraceCheckUtils]: 106: Hoare triple {24468#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24468#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:38,856 INFO L273 TraceCheckUtils]: 107: Hoare triple {24468#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24469#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:38,856 INFO L273 TraceCheckUtils]: 108: Hoare triple {24469#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24469#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:38,857 INFO L273 TraceCheckUtils]: 109: Hoare triple {24469#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24469#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:38,858 INFO L273 TraceCheckUtils]: 110: Hoare triple {24469#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24470#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:38,858 INFO L273 TraceCheckUtils]: 111: Hoare triple {24470#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24470#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:38,859 INFO L273 TraceCheckUtils]: 112: Hoare triple {24470#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24470#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:38,860 INFO L273 TraceCheckUtils]: 113: Hoare triple {24470#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24471#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:38,860 INFO L273 TraceCheckUtils]: 114: Hoare triple {24471#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24471#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:38,861 INFO L273 TraceCheckUtils]: 115: Hoare triple {24471#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24471#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:38,861 INFO L273 TraceCheckUtils]: 116: Hoare triple {24471#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24472#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:38,862 INFO L273 TraceCheckUtils]: 117: Hoare triple {24472#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24472#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:38,863 INFO L273 TraceCheckUtils]: 118: Hoare triple {24472#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24472#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:38,863 INFO L273 TraceCheckUtils]: 119: Hoare triple {24472#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24473#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:38,864 INFO L273 TraceCheckUtils]: 120: Hoare triple {24473#(<= main_~i~0 38)} assume !(~i~0 < 100000); {24434#false} is VALID [2018-11-23 12:07:38,864 INFO L273 TraceCheckUtils]: 121: Hoare triple {24434#false} havoc ~x~0;~x~0 := 0; {24434#false} is VALID [2018-11-23 12:07:38,864 INFO L273 TraceCheckUtils]: 122: Hoare triple {24434#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {24434#false} is VALID [2018-11-23 12:07:38,865 INFO L256 TraceCheckUtils]: 123: Hoare triple {24434#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {24434#false} is VALID [2018-11-23 12:07:38,865 INFO L273 TraceCheckUtils]: 124: Hoare triple {24434#false} ~cond := #in~cond; {24434#false} is VALID [2018-11-23 12:07:38,865 INFO L273 TraceCheckUtils]: 125: Hoare triple {24434#false} assume 0 == ~cond; {24434#false} is VALID [2018-11-23 12:07:38,865 INFO L273 TraceCheckUtils]: 126: Hoare triple {24434#false} assume !false; {24434#false} is VALID [2018-11-23 12:07:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:38,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:38,878 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 12:07:38,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:07:38,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:07:38,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:07:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:39,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:07:39,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {24433#true} call ULTIMATE.init(); {24433#true} is VALID [2018-11-23 12:07:39,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {24433#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24433#true} is VALID [2018-11-23 12:07:39,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {24433#true} assume true; {24433#true} is VALID [2018-11-23 12:07:39,594 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24433#true} {24433#true} #70#return; {24433#true} is VALID [2018-11-23 12:07:39,594 INFO L256 TraceCheckUtils]: 4: Hoare triple {24433#true} call #t~ret7 := main(); {24433#true} is VALID [2018-11-23 12:07:39,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {24433#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {24492#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:39,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {24492#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24492#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:39,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {24492#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24492#(<= main_~i~0 0)} is VALID [2018-11-23 12:07:39,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {24492#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24436#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {24436#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24436#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {24436#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24436#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:39,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {24436#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24437#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {24437#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24437#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {24437#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24437#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:39,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {24437#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24438#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {24438#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24438#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {24438#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24438#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:39,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {24438#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24439#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {24439#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24439#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {24439#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24439#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:39,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {24439#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24440#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {24440#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24440#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {24440#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24440#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:39,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {24440#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24441#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {24441#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24441#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {24441#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24441#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:39,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {24441#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24442#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {24442#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24442#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {24442#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24442#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:39,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {24442#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24443#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {24443#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24443#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {24443#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24443#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:39,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {24443#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24444#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {24444#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24444#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {24444#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24444#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:39,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {24444#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24445#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {24445#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24445#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {24445#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24445#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:39,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {24445#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24446#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {24446#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24446#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {24446#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24446#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:39,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {24446#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24447#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {24447#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24447#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,654 INFO L273 TraceCheckUtils]: 43: Hoare triple {24447#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24447#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:39,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {24447#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24448#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,664 INFO L273 TraceCheckUtils]: 45: Hoare triple {24448#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24448#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,665 INFO L273 TraceCheckUtils]: 46: Hoare triple {24448#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24448#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:39,665 INFO L273 TraceCheckUtils]: 47: Hoare triple {24448#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24449#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,666 INFO L273 TraceCheckUtils]: 48: Hoare triple {24449#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24449#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,666 INFO L273 TraceCheckUtils]: 49: Hoare triple {24449#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24449#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:39,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {24449#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24450#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,667 INFO L273 TraceCheckUtils]: 51: Hoare triple {24450#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24450#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,667 INFO L273 TraceCheckUtils]: 52: Hoare triple {24450#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24450#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:39,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {24450#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24451#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {24451#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24451#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,669 INFO L273 TraceCheckUtils]: 55: Hoare triple {24451#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24451#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:39,669 INFO L273 TraceCheckUtils]: 56: Hoare triple {24451#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24452#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,670 INFO L273 TraceCheckUtils]: 57: Hoare triple {24452#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24452#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,671 INFO L273 TraceCheckUtils]: 58: Hoare triple {24452#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24452#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:39,671 INFO L273 TraceCheckUtils]: 59: Hoare triple {24452#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24453#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,672 INFO L273 TraceCheckUtils]: 60: Hoare triple {24453#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24453#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,672 INFO L273 TraceCheckUtils]: 61: Hoare triple {24453#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24453#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:39,673 INFO L273 TraceCheckUtils]: 62: Hoare triple {24453#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24454#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,674 INFO L273 TraceCheckUtils]: 63: Hoare triple {24454#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24454#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,674 INFO L273 TraceCheckUtils]: 64: Hoare triple {24454#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24454#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:39,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {24454#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24455#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,676 INFO L273 TraceCheckUtils]: 66: Hoare triple {24455#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24455#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,676 INFO L273 TraceCheckUtils]: 67: Hoare triple {24455#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24455#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:39,677 INFO L273 TraceCheckUtils]: 68: Hoare triple {24455#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24456#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,677 INFO L273 TraceCheckUtils]: 69: Hoare triple {24456#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24456#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,678 INFO L273 TraceCheckUtils]: 70: Hoare triple {24456#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24456#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:39,679 INFO L273 TraceCheckUtils]: 71: Hoare triple {24456#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24457#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,679 INFO L273 TraceCheckUtils]: 72: Hoare triple {24457#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24457#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,680 INFO L273 TraceCheckUtils]: 73: Hoare triple {24457#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24457#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:39,681 INFO L273 TraceCheckUtils]: 74: Hoare triple {24457#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24458#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,682 INFO L273 TraceCheckUtils]: 75: Hoare triple {24458#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24458#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,682 INFO L273 TraceCheckUtils]: 76: Hoare triple {24458#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24458#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:39,683 INFO L273 TraceCheckUtils]: 77: Hoare triple {24458#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24459#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,684 INFO L273 TraceCheckUtils]: 78: Hoare triple {24459#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24459#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,684 INFO L273 TraceCheckUtils]: 79: Hoare triple {24459#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24459#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:39,685 INFO L273 TraceCheckUtils]: 80: Hoare triple {24459#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24460#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,685 INFO L273 TraceCheckUtils]: 81: Hoare triple {24460#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24460#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,686 INFO L273 TraceCheckUtils]: 82: Hoare triple {24460#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24460#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:39,687 INFO L273 TraceCheckUtils]: 83: Hoare triple {24460#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24461#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,687 INFO L273 TraceCheckUtils]: 84: Hoare triple {24461#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24461#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,688 INFO L273 TraceCheckUtils]: 85: Hoare triple {24461#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24461#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:39,689 INFO L273 TraceCheckUtils]: 86: Hoare triple {24461#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24462#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,689 INFO L273 TraceCheckUtils]: 87: Hoare triple {24462#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24462#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,690 INFO L273 TraceCheckUtils]: 88: Hoare triple {24462#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24462#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:39,691 INFO L273 TraceCheckUtils]: 89: Hoare triple {24462#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24463#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,691 INFO L273 TraceCheckUtils]: 90: Hoare triple {24463#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24463#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,692 INFO L273 TraceCheckUtils]: 91: Hoare triple {24463#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24463#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:39,693 INFO L273 TraceCheckUtils]: 92: Hoare triple {24463#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24464#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,693 INFO L273 TraceCheckUtils]: 93: Hoare triple {24464#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24464#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,694 INFO L273 TraceCheckUtils]: 94: Hoare triple {24464#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24464#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:39,695 INFO L273 TraceCheckUtils]: 95: Hoare triple {24464#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24465#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,695 INFO L273 TraceCheckUtils]: 96: Hoare triple {24465#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24465#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,696 INFO L273 TraceCheckUtils]: 97: Hoare triple {24465#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24465#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:39,697 INFO L273 TraceCheckUtils]: 98: Hoare triple {24465#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24466#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,698 INFO L273 TraceCheckUtils]: 99: Hoare triple {24466#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24466#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,698 INFO L273 TraceCheckUtils]: 100: Hoare triple {24466#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24466#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:39,699 INFO L273 TraceCheckUtils]: 101: Hoare triple {24466#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24467#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,700 INFO L273 TraceCheckUtils]: 102: Hoare triple {24467#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24467#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,700 INFO L273 TraceCheckUtils]: 103: Hoare triple {24467#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24467#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:39,701 INFO L273 TraceCheckUtils]: 104: Hoare triple {24467#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24468#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,702 INFO L273 TraceCheckUtils]: 105: Hoare triple {24468#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24468#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,702 INFO L273 TraceCheckUtils]: 106: Hoare triple {24468#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24468#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:39,703 INFO L273 TraceCheckUtils]: 107: Hoare triple {24468#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24469#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,704 INFO L273 TraceCheckUtils]: 108: Hoare triple {24469#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24469#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,704 INFO L273 TraceCheckUtils]: 109: Hoare triple {24469#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24469#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:39,705 INFO L273 TraceCheckUtils]: 110: Hoare triple {24469#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24470#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,705 INFO L273 TraceCheckUtils]: 111: Hoare triple {24470#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24470#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,706 INFO L273 TraceCheckUtils]: 112: Hoare triple {24470#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24470#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:39,707 INFO L273 TraceCheckUtils]: 113: Hoare triple {24470#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24471#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,707 INFO L273 TraceCheckUtils]: 114: Hoare triple {24471#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24471#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,708 INFO L273 TraceCheckUtils]: 115: Hoare triple {24471#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24471#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:39,709 INFO L273 TraceCheckUtils]: 116: Hoare triple {24471#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24472#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,709 INFO L273 TraceCheckUtils]: 117: Hoare triple {24472#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24472#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,710 INFO L273 TraceCheckUtils]: 118: Hoare triple {24472#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {24472#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:39,711 INFO L273 TraceCheckUtils]: 119: Hoare triple {24472#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24473#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:39,712 INFO L273 TraceCheckUtils]: 120: Hoare triple {24473#(<= main_~i~0 38)} assume !(~i~0 < 100000); {24434#false} is VALID [2018-11-23 12:07:39,712 INFO L273 TraceCheckUtils]: 121: Hoare triple {24434#false} havoc ~x~0;~x~0 := 0; {24434#false} is VALID [2018-11-23 12:07:39,712 INFO L273 TraceCheckUtils]: 122: Hoare triple {24434#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {24434#false} is VALID [2018-11-23 12:07:39,712 INFO L256 TraceCheckUtils]: 123: Hoare triple {24434#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {24434#false} is VALID [2018-11-23 12:07:39,712 INFO L273 TraceCheckUtils]: 124: Hoare triple {24434#false} ~cond := #in~cond; {24434#false} is VALID [2018-11-23 12:07:39,713 INFO L273 TraceCheckUtils]: 125: Hoare triple {24434#false} assume 0 == ~cond; {24434#false} is VALID [2018-11-23 12:07:39,713 INFO L273 TraceCheckUtils]: 126: Hoare triple {24434#false} assume !false; {24434#false} is VALID [2018-11-23 12:07:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:39,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:07:39,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:07:39,774 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 12:07:39,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:07:39,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:07:40,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:40,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:07:40,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:07:40,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:07:40,043 INFO L87 Difference]: Start difference. First operand 137 states and 178 transitions. Second operand 42 states. [2018-11-23 12:07:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:41,055 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2018-11-23 12:07:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:07:41,055 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-23 12:07:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:07:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:07:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 204 transitions. [2018-11-23 12:07:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:07:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 204 transitions. [2018-11-23 12:07:41,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 204 transitions. [2018-11-23 12:07:41,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:07:41,291 INFO L225 Difference]: With dead ends: 158 [2018-11-23 12:07:41,291 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 12:07:41,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:07:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 12:07:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-23 12:07:41,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:07:41,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-23 12:07:41,345 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-23 12:07:41,345 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-23 12:07:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:41,348 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2018-11-23 12:07:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2018-11-23 12:07:41,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:41,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:41,349 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-23 12:07:41,349 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-23 12:07:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:07:41,351 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2018-11-23 12:07:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2018-11-23 12:07:41,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:07:41,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:07:41,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:07:41,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:07:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 12:07:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2018-11-23 12:07:41,353 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 127 [2018-11-23 12:07:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:07:41,354 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2018-11-23 12:07:41,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:07:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 12:07:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:07:41,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:07:41,354 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:07:41,355 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:07:41,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:07:41,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1751617068, now seen corresponding path program 39 times [2018-11-23 12:07:41,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:07:41,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:07:41,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:41,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:07:41,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:07:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:07:43,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {25540#true} call ULTIMATE.init(); {25540#true} is VALID [2018-11-23 12:07:43,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {25540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25540#true} is VALID [2018-11-23 12:07:43,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {25540#true} assume true; {25540#true} is VALID [2018-11-23 12:07:43,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25540#true} {25540#true} #70#return; {25540#true} is VALID [2018-11-23 12:07:43,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {25540#true} call #t~ret7 := main(); {25540#true} is VALID [2018-11-23 12:07:43,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {25540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {25542#(= main_~i~0 0)} is VALID [2018-11-23 12:07:43,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {25542#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25542#(= main_~i~0 0)} is VALID [2018-11-23 12:07:43,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {25542#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25542#(= main_~i~0 0)} is VALID [2018-11-23 12:07:43,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {25542#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25543#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {25543#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25543#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {25543#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25543#(<= main_~i~0 1)} is VALID [2018-11-23 12:07:43,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {25543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25544#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {25544#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25544#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {25544#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25544#(<= main_~i~0 2)} is VALID [2018-11-23 12:07:43,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {25544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25545#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {25545#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25545#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {25545#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25545#(<= main_~i~0 3)} is VALID [2018-11-23 12:07:43,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {25545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25546#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {25546#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25546#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,200 INFO L273 TraceCheckUtils]: 19: Hoare triple {25546#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25546#(<= main_~i~0 4)} is VALID [2018-11-23 12:07:43,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {25546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25547#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {25547#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25547#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {25547#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25547#(<= main_~i~0 5)} is VALID [2018-11-23 12:07:43,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {25547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25548#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {25548#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25548#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {25548#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25548#(<= main_~i~0 6)} is VALID [2018-11-23 12:07:43,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {25548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25549#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {25549#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25549#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {25549#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25549#(<= main_~i~0 7)} is VALID [2018-11-23 12:07:43,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {25549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25550#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {25550#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25550#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {25550#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25550#(<= main_~i~0 8)} is VALID [2018-11-23 12:07:43,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {25550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25551#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,209 INFO L273 TraceCheckUtils]: 33: Hoare triple {25551#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25551#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,210 INFO L273 TraceCheckUtils]: 34: Hoare triple {25551#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25551#(<= main_~i~0 9)} is VALID [2018-11-23 12:07:43,211 INFO L273 TraceCheckUtils]: 35: Hoare triple {25551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25552#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {25552#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25552#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {25552#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25552#(<= main_~i~0 10)} is VALID [2018-11-23 12:07:43,213 INFO L273 TraceCheckUtils]: 38: Hoare triple {25552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25553#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,213 INFO L273 TraceCheckUtils]: 39: Hoare triple {25553#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25553#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,214 INFO L273 TraceCheckUtils]: 40: Hoare triple {25553#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25553#(<= main_~i~0 11)} is VALID [2018-11-23 12:07:43,214 INFO L273 TraceCheckUtils]: 41: Hoare triple {25553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25554#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,215 INFO L273 TraceCheckUtils]: 42: Hoare triple {25554#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25554#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,216 INFO L273 TraceCheckUtils]: 43: Hoare triple {25554#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25554#(<= main_~i~0 12)} is VALID [2018-11-23 12:07:43,217 INFO L273 TraceCheckUtils]: 44: Hoare triple {25554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25555#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {25555#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25555#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,219 INFO L273 TraceCheckUtils]: 46: Hoare triple {25555#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25555#(<= main_~i~0 13)} is VALID [2018-11-23 12:07:43,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {25555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25556#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,220 INFO L273 TraceCheckUtils]: 48: Hoare triple {25556#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25556#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,220 INFO L273 TraceCheckUtils]: 49: Hoare triple {25556#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25556#(<= main_~i~0 14)} is VALID [2018-11-23 12:07:43,221 INFO L273 TraceCheckUtils]: 50: Hoare triple {25556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25557#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,222 INFO L273 TraceCheckUtils]: 51: Hoare triple {25557#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25557#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,222 INFO L273 TraceCheckUtils]: 52: Hoare triple {25557#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25557#(<= main_~i~0 15)} is VALID [2018-11-23 12:07:43,223 INFO L273 TraceCheckUtils]: 53: Hoare triple {25557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25558#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,224 INFO L273 TraceCheckUtils]: 54: Hoare triple {25558#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25558#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,224 INFO L273 TraceCheckUtils]: 55: Hoare triple {25558#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25558#(<= main_~i~0 16)} is VALID [2018-11-23 12:07:43,225 INFO L273 TraceCheckUtils]: 56: Hoare triple {25558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25559#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,226 INFO L273 TraceCheckUtils]: 57: Hoare triple {25559#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25559#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,226 INFO L273 TraceCheckUtils]: 58: Hoare triple {25559#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25559#(<= main_~i~0 17)} is VALID [2018-11-23 12:07:43,227 INFO L273 TraceCheckUtils]: 59: Hoare triple {25559#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25560#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,228 INFO L273 TraceCheckUtils]: 60: Hoare triple {25560#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25560#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,228 INFO L273 TraceCheckUtils]: 61: Hoare triple {25560#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25560#(<= main_~i~0 18)} is VALID [2018-11-23 12:07:43,229 INFO L273 TraceCheckUtils]: 62: Hoare triple {25560#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25561#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,229 INFO L273 TraceCheckUtils]: 63: Hoare triple {25561#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25561#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {25561#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25561#(<= main_~i~0 19)} is VALID [2018-11-23 12:07:43,231 INFO L273 TraceCheckUtils]: 65: Hoare triple {25561#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25562#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,231 INFO L273 TraceCheckUtils]: 66: Hoare triple {25562#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25562#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,232 INFO L273 TraceCheckUtils]: 67: Hoare triple {25562#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25562#(<= main_~i~0 20)} is VALID [2018-11-23 12:07:43,233 INFO L273 TraceCheckUtils]: 68: Hoare triple {25562#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25563#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,233 INFO L273 TraceCheckUtils]: 69: Hoare triple {25563#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25563#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,234 INFO L273 TraceCheckUtils]: 70: Hoare triple {25563#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25563#(<= main_~i~0 21)} is VALID [2018-11-23 12:07:43,234 INFO L273 TraceCheckUtils]: 71: Hoare triple {25563#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25564#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,235 INFO L273 TraceCheckUtils]: 72: Hoare triple {25564#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25564#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,235 INFO L273 TraceCheckUtils]: 73: Hoare triple {25564#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25564#(<= main_~i~0 22)} is VALID [2018-11-23 12:07:43,236 INFO L273 TraceCheckUtils]: 74: Hoare triple {25564#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25565#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,237 INFO L273 TraceCheckUtils]: 75: Hoare triple {25565#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25565#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,237 INFO L273 TraceCheckUtils]: 76: Hoare triple {25565#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25565#(<= main_~i~0 23)} is VALID [2018-11-23 12:07:43,238 INFO L273 TraceCheckUtils]: 77: Hoare triple {25565#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25566#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,238 INFO L273 TraceCheckUtils]: 78: Hoare triple {25566#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25566#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,239 INFO L273 TraceCheckUtils]: 79: Hoare triple {25566#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25566#(<= main_~i~0 24)} is VALID [2018-11-23 12:07:43,240 INFO L273 TraceCheckUtils]: 80: Hoare triple {25566#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25567#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,240 INFO L273 TraceCheckUtils]: 81: Hoare triple {25567#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25567#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,241 INFO L273 TraceCheckUtils]: 82: Hoare triple {25567#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25567#(<= main_~i~0 25)} is VALID [2018-11-23 12:07:43,242 INFO L273 TraceCheckUtils]: 83: Hoare triple {25567#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25568#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,242 INFO L273 TraceCheckUtils]: 84: Hoare triple {25568#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25568#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,243 INFO L273 TraceCheckUtils]: 85: Hoare triple {25568#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25568#(<= main_~i~0 26)} is VALID [2018-11-23 12:07:43,244 INFO L273 TraceCheckUtils]: 86: Hoare triple {25568#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25569#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,244 INFO L273 TraceCheckUtils]: 87: Hoare triple {25569#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25569#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,245 INFO L273 TraceCheckUtils]: 88: Hoare triple {25569#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25569#(<= main_~i~0 27)} is VALID [2018-11-23 12:07:43,246 INFO L273 TraceCheckUtils]: 89: Hoare triple {25569#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25570#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,246 INFO L273 TraceCheckUtils]: 90: Hoare triple {25570#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25570#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,247 INFO L273 TraceCheckUtils]: 91: Hoare triple {25570#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25570#(<= main_~i~0 28)} is VALID [2018-11-23 12:07:43,248 INFO L273 TraceCheckUtils]: 92: Hoare triple {25570#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25571#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,248 INFO L273 TraceCheckUtils]: 93: Hoare triple {25571#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25571#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,249 INFO L273 TraceCheckUtils]: 94: Hoare triple {25571#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25571#(<= main_~i~0 29)} is VALID [2018-11-23 12:07:43,250 INFO L273 TraceCheckUtils]: 95: Hoare triple {25571#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25572#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,250 INFO L273 TraceCheckUtils]: 96: Hoare triple {25572#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25572#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,251 INFO L273 TraceCheckUtils]: 97: Hoare triple {25572#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25572#(<= main_~i~0 30)} is VALID [2018-11-23 12:07:43,252 INFO L273 TraceCheckUtils]: 98: Hoare triple {25572#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25573#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,252 INFO L273 TraceCheckUtils]: 99: Hoare triple {25573#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25573#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,253 INFO L273 TraceCheckUtils]: 100: Hoare triple {25573#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25573#(<= main_~i~0 31)} is VALID [2018-11-23 12:07:43,254 INFO L273 TraceCheckUtils]: 101: Hoare triple {25573#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25574#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,254 INFO L273 TraceCheckUtils]: 102: Hoare triple {25574#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25574#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,255 INFO L273 TraceCheckUtils]: 103: Hoare triple {25574#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25574#(<= main_~i~0 32)} is VALID [2018-11-23 12:07:43,255 INFO L273 TraceCheckUtils]: 104: Hoare triple {25574#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25575#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,256 INFO L273 TraceCheckUtils]: 105: Hoare triple {25575#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25575#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,257 INFO L273 TraceCheckUtils]: 106: Hoare triple {25575#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25575#(<= main_~i~0 33)} is VALID [2018-11-23 12:07:43,257 INFO L273 TraceCheckUtils]: 107: Hoare triple {25575#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25576#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,258 INFO L273 TraceCheckUtils]: 108: Hoare triple {25576#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25576#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,259 INFO L273 TraceCheckUtils]: 109: Hoare triple {25576#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25576#(<= main_~i~0 34)} is VALID [2018-11-23 12:07:43,259 INFO L273 TraceCheckUtils]: 110: Hoare triple {25576#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25577#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,260 INFO L273 TraceCheckUtils]: 111: Hoare triple {25577#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25577#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,261 INFO L273 TraceCheckUtils]: 112: Hoare triple {25577#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25577#(<= main_~i~0 35)} is VALID [2018-11-23 12:07:43,261 INFO L273 TraceCheckUtils]: 113: Hoare triple {25577#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25578#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,262 INFO L273 TraceCheckUtils]: 114: Hoare triple {25578#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25578#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,262 INFO L273 TraceCheckUtils]: 115: Hoare triple {25578#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25578#(<= main_~i~0 36)} is VALID [2018-11-23 12:07:43,263 INFO L273 TraceCheckUtils]: 116: Hoare triple {25578#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25579#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,264 INFO L273 TraceCheckUtils]: 117: Hoare triple {25579#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25579#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,264 INFO L273 TraceCheckUtils]: 118: Hoare triple {25579#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25579#(<= main_~i~0 37)} is VALID [2018-11-23 12:07:43,265 INFO L273 TraceCheckUtils]: 119: Hoare triple {25579#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25580#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,266 INFO L273 TraceCheckUtils]: 120: Hoare triple {25580#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25580#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,266 INFO L273 TraceCheckUtils]: 121: Hoare triple {25580#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25580#(<= main_~i~0 38)} is VALID [2018-11-23 12:07:43,267 INFO L273 TraceCheckUtils]: 122: Hoare triple {25580#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25581#(<= main_~i~0 39)} is VALID [2018-11-23 12:07:43,268 INFO L273 TraceCheckUtils]: 123: Hoare triple {25581#(<= main_~i~0 39)} assume !(~i~0 < 100000); {25541#false} is VALID [2018-11-23 12:07:43,268 INFO L273 TraceCheckUtils]: 124: Hoare triple {25541#false} havoc ~x~0;~x~0 := 0; {25541#false} is VALID [2018-11-23 12:07:43,268 INFO L273 TraceCheckUtils]: 125: Hoare triple {25541#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {25541#false} is VALID [2018-11-23 12:07:43,268 INFO L256 TraceCheckUtils]: 126: Hoare triple {25541#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {25541#false} is VALID [2018-11-23 12:07:43,269 INFO L273 TraceCheckUtils]: 127: Hoare triple {25541#false} ~cond := #in~cond; {25541#false} is VALID [2018-11-23 12:07:43,269 INFO L273 TraceCheckUtils]: 128: Hoare triple {25541#false} assume 0 == ~cond; {25541#false} is VALID [2018-11-23 12:07:43,269 INFO L273 TraceCheckUtils]: 129: Hoare triple {25541#false} assume !false; {25541#false} is VALID [2018-11-23 12:07:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:07:43,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:07:43,282 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 12:07:43,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:08:00,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 12:08:00,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:00,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:01,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {25540#true} call ULTIMATE.init(); {25540#true} is VALID [2018-11-23 12:08:01,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {25540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25540#true} is VALID [2018-11-23 12:08:01,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {25540#true} assume true; {25540#true} is VALID [2018-11-23 12:08:01,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25540#true} {25540#true} #70#return; {25540#true} is VALID [2018-11-23 12:08:01,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {25540#true} call #t~ret7 := main(); {25540#true} is VALID [2018-11-23 12:08:01,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {25540#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {25600#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:01,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {25600#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25600#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:01,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {25600#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25600#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:01,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {25600#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25543#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:01,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {25543#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25543#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:01,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {25543#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25543#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:01,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {25543#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25544#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:01,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {25544#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25544#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:01,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {25544#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25544#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:01,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {25544#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25545#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:01,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {25545#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25545#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:01,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {25545#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25545#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:01,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {25545#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25546#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:01,266 INFO L273 TraceCheckUtils]: 18: Hoare triple {25546#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25546#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:01,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {25546#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25546#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:01,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {25546#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25547#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:01,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {25547#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25547#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:01,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {25547#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25547#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:01,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {25547#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25548#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:01,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {25548#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25548#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:01,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {25548#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25548#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:01,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {25548#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25549#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:01,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {25549#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25549#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:01,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {25549#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25549#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:01,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {25549#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25550#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:01,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {25550#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25550#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:01,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {25550#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25550#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:01,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {25550#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25551#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:01,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {25551#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25551#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:01,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {25551#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25551#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:01,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {25551#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25552#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:01,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {25552#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25552#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:01,279 INFO L273 TraceCheckUtils]: 37: Hoare triple {25552#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25552#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:01,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {25552#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25553#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:01,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {25553#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25553#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:01,281 INFO L273 TraceCheckUtils]: 40: Hoare triple {25553#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25553#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:01,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {25553#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25554#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:01,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {25554#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25554#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:01,312 INFO L273 TraceCheckUtils]: 43: Hoare triple {25554#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25554#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:01,326 INFO L273 TraceCheckUtils]: 44: Hoare triple {25554#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25555#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:01,335 INFO L273 TraceCheckUtils]: 45: Hoare triple {25555#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25555#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:01,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {25555#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25555#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:01,336 INFO L273 TraceCheckUtils]: 47: Hoare triple {25555#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25556#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:01,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {25556#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25556#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:01,337 INFO L273 TraceCheckUtils]: 49: Hoare triple {25556#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25556#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:01,337 INFO L273 TraceCheckUtils]: 50: Hoare triple {25556#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25557#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:01,337 INFO L273 TraceCheckUtils]: 51: Hoare triple {25557#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25557#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:01,338 INFO L273 TraceCheckUtils]: 52: Hoare triple {25557#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25557#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:01,338 INFO L273 TraceCheckUtils]: 53: Hoare triple {25557#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25558#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:01,338 INFO L273 TraceCheckUtils]: 54: Hoare triple {25558#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25558#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:01,339 INFO L273 TraceCheckUtils]: 55: Hoare triple {25558#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25558#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:01,339 INFO L273 TraceCheckUtils]: 56: Hoare triple {25558#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25559#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:01,340 INFO L273 TraceCheckUtils]: 57: Hoare triple {25559#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25559#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:01,340 INFO L273 TraceCheckUtils]: 58: Hoare triple {25559#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25559#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:01,341 INFO L273 TraceCheckUtils]: 59: Hoare triple {25559#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25560#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:01,342 INFO L273 TraceCheckUtils]: 60: Hoare triple {25560#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25560#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:01,342 INFO L273 TraceCheckUtils]: 61: Hoare triple {25560#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25560#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:01,343 INFO L273 TraceCheckUtils]: 62: Hoare triple {25560#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25561#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:01,344 INFO L273 TraceCheckUtils]: 63: Hoare triple {25561#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25561#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:01,344 INFO L273 TraceCheckUtils]: 64: Hoare triple {25561#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25561#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:01,345 INFO L273 TraceCheckUtils]: 65: Hoare triple {25561#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25562#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:01,346 INFO L273 TraceCheckUtils]: 66: Hoare triple {25562#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25562#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:01,346 INFO L273 TraceCheckUtils]: 67: Hoare triple {25562#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25562#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:01,347 INFO L273 TraceCheckUtils]: 68: Hoare triple {25562#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25563#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:01,348 INFO L273 TraceCheckUtils]: 69: Hoare triple {25563#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25563#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:01,348 INFO L273 TraceCheckUtils]: 70: Hoare triple {25563#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25563#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:01,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {25563#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25564#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:01,350 INFO L273 TraceCheckUtils]: 72: Hoare triple {25564#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25564#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:01,350 INFO L273 TraceCheckUtils]: 73: Hoare triple {25564#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25564#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:01,351 INFO L273 TraceCheckUtils]: 74: Hoare triple {25564#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25565#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:01,352 INFO L273 TraceCheckUtils]: 75: Hoare triple {25565#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25565#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:01,352 INFO L273 TraceCheckUtils]: 76: Hoare triple {25565#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25565#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:01,353 INFO L273 TraceCheckUtils]: 77: Hoare triple {25565#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25566#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:01,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {25566#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25566#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:01,355 INFO L273 TraceCheckUtils]: 79: Hoare triple {25566#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25566#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:01,355 INFO L273 TraceCheckUtils]: 80: Hoare triple {25566#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25567#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:01,356 INFO L273 TraceCheckUtils]: 81: Hoare triple {25567#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25567#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:01,357 INFO L273 TraceCheckUtils]: 82: Hoare triple {25567#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25567#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:01,375 INFO L273 TraceCheckUtils]: 83: Hoare triple {25567#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25568#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:01,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {25568#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25568#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:01,397 INFO L273 TraceCheckUtils]: 85: Hoare triple {25568#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25568#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:01,406 INFO L273 TraceCheckUtils]: 86: Hoare triple {25568#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25569#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:01,412 INFO L273 TraceCheckUtils]: 87: Hoare triple {25569#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25569#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:01,413 INFO L273 TraceCheckUtils]: 88: Hoare triple {25569#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25569#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:01,417 INFO L273 TraceCheckUtils]: 89: Hoare triple {25569#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25570#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:01,417 INFO L273 TraceCheckUtils]: 90: Hoare triple {25570#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25570#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:01,417 INFO L273 TraceCheckUtils]: 91: Hoare triple {25570#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25570#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:01,418 INFO L273 TraceCheckUtils]: 92: Hoare triple {25570#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25571#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:01,418 INFO L273 TraceCheckUtils]: 93: Hoare triple {25571#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25571#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:01,419 INFO L273 TraceCheckUtils]: 94: Hoare triple {25571#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25571#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:01,419 INFO L273 TraceCheckUtils]: 95: Hoare triple {25571#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25572#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:01,420 INFO L273 TraceCheckUtils]: 96: Hoare triple {25572#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25572#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:01,420 INFO L273 TraceCheckUtils]: 97: Hoare triple {25572#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25572#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:01,420 INFO L273 TraceCheckUtils]: 98: Hoare triple {25572#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25573#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:01,421 INFO L273 TraceCheckUtils]: 99: Hoare triple {25573#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25573#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:01,421 INFO L273 TraceCheckUtils]: 100: Hoare triple {25573#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25573#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:01,422 INFO L273 TraceCheckUtils]: 101: Hoare triple {25573#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25574#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:01,422 INFO L273 TraceCheckUtils]: 102: Hoare triple {25574#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25574#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:01,423 INFO L273 TraceCheckUtils]: 103: Hoare triple {25574#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25574#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:01,424 INFO L273 TraceCheckUtils]: 104: Hoare triple {25574#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25575#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:01,426 INFO L273 TraceCheckUtils]: 105: Hoare triple {25575#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25575#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:01,426 INFO L273 TraceCheckUtils]: 106: Hoare triple {25575#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25575#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:01,427 INFO L273 TraceCheckUtils]: 107: Hoare triple {25575#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25576#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:01,428 INFO L273 TraceCheckUtils]: 108: Hoare triple {25576#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25576#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:01,428 INFO L273 TraceCheckUtils]: 109: Hoare triple {25576#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25576#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:01,429 INFO L273 TraceCheckUtils]: 110: Hoare triple {25576#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25577#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:01,429 INFO L273 TraceCheckUtils]: 111: Hoare triple {25577#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25577#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:01,430 INFO L273 TraceCheckUtils]: 112: Hoare triple {25577#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25577#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:01,431 INFO L273 TraceCheckUtils]: 113: Hoare triple {25577#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25578#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:01,432 INFO L273 TraceCheckUtils]: 114: Hoare triple {25578#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25578#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:01,432 INFO L273 TraceCheckUtils]: 115: Hoare triple {25578#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25578#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:01,433 INFO L273 TraceCheckUtils]: 116: Hoare triple {25578#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25579#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:01,434 INFO L273 TraceCheckUtils]: 117: Hoare triple {25579#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25579#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:01,434 INFO L273 TraceCheckUtils]: 118: Hoare triple {25579#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25579#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:01,435 INFO L273 TraceCheckUtils]: 119: Hoare triple {25579#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25580#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:01,435 INFO L273 TraceCheckUtils]: 120: Hoare triple {25580#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {25580#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:01,436 INFO L273 TraceCheckUtils]: 121: Hoare triple {25580#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {25580#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:01,437 INFO L273 TraceCheckUtils]: 122: Hoare triple {25580#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25581#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:01,438 INFO L273 TraceCheckUtils]: 123: Hoare triple {25581#(<= main_~i~0 39)} assume !(~i~0 < 100000); {25541#false} is VALID [2018-11-23 12:08:01,438 INFO L273 TraceCheckUtils]: 124: Hoare triple {25541#false} havoc ~x~0;~x~0 := 0; {25541#false} is VALID [2018-11-23 12:08:01,438 INFO L273 TraceCheckUtils]: 125: Hoare triple {25541#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {25541#false} is VALID [2018-11-23 12:08:01,438 INFO L256 TraceCheckUtils]: 126: Hoare triple {25541#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {25541#false} is VALID [2018-11-23 12:08:01,438 INFO L273 TraceCheckUtils]: 127: Hoare triple {25541#false} ~cond := #in~cond; {25541#false} is VALID [2018-11-23 12:08:01,439 INFO L273 TraceCheckUtils]: 128: Hoare triple {25541#false} assume 0 == ~cond; {25541#false} is VALID [2018-11-23 12:08:01,439 INFO L273 TraceCheckUtils]: 129: Hoare triple {25541#false} assume !false; {25541#false} is VALID [2018-11-23 12:08:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:01,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:01,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:08:01,475 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 12:08:01,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:01,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:08:01,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:01,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:08:01,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:08:01,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:08:01,633 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand 43 states. [2018-11-23 12:08:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:02,870 INFO L93 Difference]: Finished difference Result 161 states and 208 transitions. [2018-11-23 12:08:02,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:08:02,870 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-23 12:08:02,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:08:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 208 transitions. [2018-11-23 12:08:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:08:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 208 transitions. [2018-11-23 12:08:02,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 208 transitions. [2018-11-23 12:08:03,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:03,106 INFO L225 Difference]: With dead ends: 161 [2018-11-23 12:08:03,106 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:08:03,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:08:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:08:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:08:03,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:03,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:08:03,165 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:08:03,165 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:08:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:03,169 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2018-11-23 12:08:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2018-11-23 12:08:03,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:03,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:03,169 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:08:03,169 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:08:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:03,171 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2018-11-23 12:08:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2018-11-23 12:08:03,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:03,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:03,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:03,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:08:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2018-11-23 12:08:03,174 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 130 [2018-11-23 12:08:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:03,174 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2018-11-23 12:08:03,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:08:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2018-11-23 12:08:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 12:08:03,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:03,175 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:03,175 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:03,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:03,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1314045433, now seen corresponding path program 40 times [2018-11-23 12:08:03,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:03,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:03,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:03,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:04,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {26671#true} call ULTIMATE.init(); {26671#true} is VALID [2018-11-23 12:08:04,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {26671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26671#true} is VALID [2018-11-23 12:08:04,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {26671#true} assume true; {26671#true} is VALID [2018-11-23 12:08:04,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26671#true} {26671#true} #70#return; {26671#true} is VALID [2018-11-23 12:08:04,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {26671#true} call #t~ret7 := main(); {26671#true} is VALID [2018-11-23 12:08:04,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {26671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {26673#(= main_~i~0 0)} is VALID [2018-11-23 12:08:04,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {26673#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26673#(= main_~i~0 0)} is VALID [2018-11-23 12:08:04,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {26673#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26673#(= main_~i~0 0)} is VALID [2018-11-23 12:08:04,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {26673#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26674#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:04,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {26674#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26674#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:04,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {26674#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26674#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:04,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {26674#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26675#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:04,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {26675#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26675#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:04,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {26675#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26675#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:04,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {26675#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26676#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:04,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {26676#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26676#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:04,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {26676#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26676#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:04,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {26676#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26677#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:04,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {26677#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26677#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:04,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {26677#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26677#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:04,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {26677#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26678#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:04,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {26678#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26678#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:04,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {26678#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26678#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:04,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {26678#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26679#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:04,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {26679#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26679#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:04,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {26679#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26679#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:04,774 INFO L273 TraceCheckUtils]: 26: Hoare triple {26679#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26680#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:04,774 INFO L273 TraceCheckUtils]: 27: Hoare triple {26680#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26680#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:04,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {26680#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26680#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:04,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {26680#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26681#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:04,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {26681#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26681#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:04,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {26681#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26681#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:04,778 INFO L273 TraceCheckUtils]: 32: Hoare triple {26681#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26682#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:04,778 INFO L273 TraceCheckUtils]: 33: Hoare triple {26682#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26682#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:04,779 INFO L273 TraceCheckUtils]: 34: Hoare triple {26682#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26682#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:04,780 INFO L273 TraceCheckUtils]: 35: Hoare triple {26682#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26683#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:04,780 INFO L273 TraceCheckUtils]: 36: Hoare triple {26683#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26683#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:04,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {26683#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26683#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:04,782 INFO L273 TraceCheckUtils]: 38: Hoare triple {26683#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26684#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:04,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {26684#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26684#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:04,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {26684#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26684#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:04,784 INFO L273 TraceCheckUtils]: 41: Hoare triple {26684#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26685#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:04,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {26685#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26685#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:04,785 INFO L273 TraceCheckUtils]: 43: Hoare triple {26685#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26685#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:04,786 INFO L273 TraceCheckUtils]: 44: Hoare triple {26685#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26686#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:04,786 INFO L273 TraceCheckUtils]: 45: Hoare triple {26686#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26686#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:04,787 INFO L273 TraceCheckUtils]: 46: Hoare triple {26686#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26686#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:04,788 INFO L273 TraceCheckUtils]: 47: Hoare triple {26686#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26687#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:04,788 INFO L273 TraceCheckUtils]: 48: Hoare triple {26687#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26687#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:04,789 INFO L273 TraceCheckUtils]: 49: Hoare triple {26687#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26687#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:04,790 INFO L273 TraceCheckUtils]: 50: Hoare triple {26687#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26688#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:04,790 INFO L273 TraceCheckUtils]: 51: Hoare triple {26688#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26688#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:04,791 INFO L273 TraceCheckUtils]: 52: Hoare triple {26688#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26688#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:04,791 INFO L273 TraceCheckUtils]: 53: Hoare triple {26688#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26689#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:04,792 INFO L273 TraceCheckUtils]: 54: Hoare triple {26689#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26689#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:04,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {26689#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26689#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:04,794 INFO L273 TraceCheckUtils]: 56: Hoare triple {26689#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26690#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:04,794 INFO L273 TraceCheckUtils]: 57: Hoare triple {26690#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26690#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:04,795 INFO L273 TraceCheckUtils]: 58: Hoare triple {26690#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26690#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:04,796 INFO L273 TraceCheckUtils]: 59: Hoare triple {26690#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26691#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:04,796 INFO L273 TraceCheckUtils]: 60: Hoare triple {26691#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26691#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:04,797 INFO L273 TraceCheckUtils]: 61: Hoare triple {26691#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26691#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:04,798 INFO L273 TraceCheckUtils]: 62: Hoare triple {26691#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26692#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:04,798 INFO L273 TraceCheckUtils]: 63: Hoare triple {26692#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26692#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:04,799 INFO L273 TraceCheckUtils]: 64: Hoare triple {26692#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26692#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:04,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {26692#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26693#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:04,800 INFO L273 TraceCheckUtils]: 66: Hoare triple {26693#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26693#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:04,801 INFO L273 TraceCheckUtils]: 67: Hoare triple {26693#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26693#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:04,802 INFO L273 TraceCheckUtils]: 68: Hoare triple {26693#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26694#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:04,802 INFO L273 TraceCheckUtils]: 69: Hoare triple {26694#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26694#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:04,803 INFO L273 TraceCheckUtils]: 70: Hoare triple {26694#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26694#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:04,804 INFO L273 TraceCheckUtils]: 71: Hoare triple {26694#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26695#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:04,804 INFO L273 TraceCheckUtils]: 72: Hoare triple {26695#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26695#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:04,805 INFO L273 TraceCheckUtils]: 73: Hoare triple {26695#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26695#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:04,806 INFO L273 TraceCheckUtils]: 74: Hoare triple {26695#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26696#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:04,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {26696#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26696#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:04,807 INFO L273 TraceCheckUtils]: 76: Hoare triple {26696#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26696#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:04,808 INFO L273 TraceCheckUtils]: 77: Hoare triple {26696#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26697#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:04,808 INFO L273 TraceCheckUtils]: 78: Hoare triple {26697#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26697#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:04,809 INFO L273 TraceCheckUtils]: 79: Hoare triple {26697#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26697#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:04,810 INFO L273 TraceCheckUtils]: 80: Hoare triple {26697#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26698#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:04,810 INFO L273 TraceCheckUtils]: 81: Hoare triple {26698#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26698#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:04,811 INFO L273 TraceCheckUtils]: 82: Hoare triple {26698#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26698#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:04,812 INFO L273 TraceCheckUtils]: 83: Hoare triple {26698#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26699#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:04,812 INFO L273 TraceCheckUtils]: 84: Hoare triple {26699#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26699#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:04,813 INFO L273 TraceCheckUtils]: 85: Hoare triple {26699#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26699#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:04,814 INFO L273 TraceCheckUtils]: 86: Hoare triple {26699#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26700#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:04,814 INFO L273 TraceCheckUtils]: 87: Hoare triple {26700#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26700#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:04,815 INFO L273 TraceCheckUtils]: 88: Hoare triple {26700#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26700#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:04,816 INFO L273 TraceCheckUtils]: 89: Hoare triple {26700#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26701#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:04,816 INFO L273 TraceCheckUtils]: 90: Hoare triple {26701#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26701#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:04,817 INFO L273 TraceCheckUtils]: 91: Hoare triple {26701#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26701#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:04,818 INFO L273 TraceCheckUtils]: 92: Hoare triple {26701#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26702#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:04,818 INFO L273 TraceCheckUtils]: 93: Hoare triple {26702#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26702#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:04,819 INFO L273 TraceCheckUtils]: 94: Hoare triple {26702#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26702#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:04,820 INFO L273 TraceCheckUtils]: 95: Hoare triple {26702#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26703#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:04,821 INFO L273 TraceCheckUtils]: 96: Hoare triple {26703#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26703#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:04,821 INFO L273 TraceCheckUtils]: 97: Hoare triple {26703#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26703#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:04,822 INFO L273 TraceCheckUtils]: 98: Hoare triple {26703#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26704#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:04,823 INFO L273 TraceCheckUtils]: 99: Hoare triple {26704#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26704#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:04,823 INFO L273 TraceCheckUtils]: 100: Hoare triple {26704#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26704#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:04,824 INFO L273 TraceCheckUtils]: 101: Hoare triple {26704#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26705#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:04,825 INFO L273 TraceCheckUtils]: 102: Hoare triple {26705#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26705#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:04,825 INFO L273 TraceCheckUtils]: 103: Hoare triple {26705#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26705#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:04,826 INFO L273 TraceCheckUtils]: 104: Hoare triple {26705#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26706#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:04,827 INFO L273 TraceCheckUtils]: 105: Hoare triple {26706#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26706#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:04,827 INFO L273 TraceCheckUtils]: 106: Hoare triple {26706#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26706#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:04,828 INFO L273 TraceCheckUtils]: 107: Hoare triple {26706#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26707#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:04,829 INFO L273 TraceCheckUtils]: 108: Hoare triple {26707#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26707#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:04,829 INFO L273 TraceCheckUtils]: 109: Hoare triple {26707#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26707#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:04,830 INFO L273 TraceCheckUtils]: 110: Hoare triple {26707#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26708#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:04,831 INFO L273 TraceCheckUtils]: 111: Hoare triple {26708#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26708#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:04,831 INFO L273 TraceCheckUtils]: 112: Hoare triple {26708#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26708#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:04,832 INFO L273 TraceCheckUtils]: 113: Hoare triple {26708#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26709#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:04,833 INFO L273 TraceCheckUtils]: 114: Hoare triple {26709#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26709#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:04,833 INFO L273 TraceCheckUtils]: 115: Hoare triple {26709#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26709#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:04,834 INFO L273 TraceCheckUtils]: 116: Hoare triple {26709#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26710#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:04,835 INFO L273 TraceCheckUtils]: 117: Hoare triple {26710#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26710#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:04,835 INFO L273 TraceCheckUtils]: 118: Hoare triple {26710#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26710#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:04,836 INFO L273 TraceCheckUtils]: 119: Hoare triple {26710#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26711#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:04,837 INFO L273 TraceCheckUtils]: 120: Hoare triple {26711#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26711#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:04,837 INFO L273 TraceCheckUtils]: 121: Hoare triple {26711#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26711#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:04,838 INFO L273 TraceCheckUtils]: 122: Hoare triple {26711#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26712#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:04,839 INFO L273 TraceCheckUtils]: 123: Hoare triple {26712#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26712#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:04,839 INFO L273 TraceCheckUtils]: 124: Hoare triple {26712#(<= main_~i~0 39)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26712#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:04,840 INFO L273 TraceCheckUtils]: 125: Hoare triple {26712#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26713#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:04,841 INFO L273 TraceCheckUtils]: 126: Hoare triple {26713#(<= main_~i~0 40)} assume !(~i~0 < 100000); {26672#false} is VALID [2018-11-23 12:08:04,841 INFO L273 TraceCheckUtils]: 127: Hoare triple {26672#false} havoc ~x~0;~x~0 := 0; {26672#false} is VALID [2018-11-23 12:08:04,841 INFO L273 TraceCheckUtils]: 128: Hoare triple {26672#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {26672#false} is VALID [2018-11-23 12:08:04,842 INFO L256 TraceCheckUtils]: 129: Hoare triple {26672#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {26672#false} is VALID [2018-11-23 12:08:04,842 INFO L273 TraceCheckUtils]: 130: Hoare triple {26672#false} ~cond := #in~cond; {26672#false} is VALID [2018-11-23 12:08:04,842 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#false} assume 0 == ~cond; {26672#false} is VALID [2018-11-23 12:08:04,842 INFO L273 TraceCheckUtils]: 132: Hoare triple {26672#false} assume !false; {26672#false} is VALID [2018-11-23 12:08:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:04,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:04,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:04,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:08:07,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:08:07,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:07,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:08,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {26671#true} call ULTIMATE.init(); {26671#true} is VALID [2018-11-23 12:08:08,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {26671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26671#true} is VALID [2018-11-23 12:08:08,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {26671#true} assume true; {26671#true} is VALID [2018-11-23 12:08:08,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26671#true} {26671#true} #70#return; {26671#true} is VALID [2018-11-23 12:08:08,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {26671#true} call #t~ret7 := main(); {26671#true} is VALID [2018-11-23 12:08:08,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {26671#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {26732#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:08,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {26732#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26732#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:08,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {26732#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26732#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:08,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {26732#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26674#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:08,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {26674#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26674#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:08,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {26674#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26674#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:08,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {26674#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26675#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:08,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {26675#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26675#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:08,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {26675#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26675#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:08,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {26675#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26676#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:08,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {26676#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26676#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:08,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {26676#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26676#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:08,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {26676#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26677#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:08,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {26677#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26677#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:08,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {26677#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26677#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:08,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {26677#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26678#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:08,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {26678#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26678#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:08,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {26678#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26678#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:08,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {26678#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26679#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:08,300 INFO L273 TraceCheckUtils]: 24: Hoare triple {26679#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26679#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:08,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {26679#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26679#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:08,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {26679#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26680#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:08,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {26680#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26680#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:08,303 INFO L273 TraceCheckUtils]: 28: Hoare triple {26680#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26680#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:08,303 INFO L273 TraceCheckUtils]: 29: Hoare triple {26680#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26681#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:08,304 INFO L273 TraceCheckUtils]: 30: Hoare triple {26681#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26681#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:08,304 INFO L273 TraceCheckUtils]: 31: Hoare triple {26681#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26681#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:08,305 INFO L273 TraceCheckUtils]: 32: Hoare triple {26681#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26682#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:08,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {26682#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26682#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:08,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {26682#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26682#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:08,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {26682#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26683#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:08,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {26683#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26683#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:08,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {26683#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26683#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:08,309 INFO L273 TraceCheckUtils]: 38: Hoare triple {26683#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26684#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:08,309 INFO L273 TraceCheckUtils]: 39: Hoare triple {26684#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26684#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:08,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {26684#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26684#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:08,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {26684#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26685#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:08,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {26685#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26685#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:08,312 INFO L273 TraceCheckUtils]: 43: Hoare triple {26685#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26685#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:08,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {26685#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26686#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:08,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {26686#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26686#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:08,314 INFO L273 TraceCheckUtils]: 46: Hoare triple {26686#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26686#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:08,315 INFO L273 TraceCheckUtils]: 47: Hoare triple {26686#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26687#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:08,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {26687#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26687#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:08,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {26687#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26687#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:08,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {26687#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26688#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:08,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {26688#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26688#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:08,318 INFO L273 TraceCheckUtils]: 52: Hoare triple {26688#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26688#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:08,319 INFO L273 TraceCheckUtils]: 53: Hoare triple {26688#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26689#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:08,319 INFO L273 TraceCheckUtils]: 54: Hoare triple {26689#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26689#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:08,320 INFO L273 TraceCheckUtils]: 55: Hoare triple {26689#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26689#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:08,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {26689#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26690#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:08,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {26690#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26690#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:08,322 INFO L273 TraceCheckUtils]: 58: Hoare triple {26690#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26690#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:08,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {26690#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26691#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:08,323 INFO L273 TraceCheckUtils]: 60: Hoare triple {26691#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26691#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:08,324 INFO L273 TraceCheckUtils]: 61: Hoare triple {26691#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26691#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:08,324 INFO L273 TraceCheckUtils]: 62: Hoare triple {26691#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26692#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:08,325 INFO L273 TraceCheckUtils]: 63: Hoare triple {26692#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26692#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:08,325 INFO L273 TraceCheckUtils]: 64: Hoare triple {26692#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26692#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:08,326 INFO L273 TraceCheckUtils]: 65: Hoare triple {26692#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26693#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:08,327 INFO L273 TraceCheckUtils]: 66: Hoare triple {26693#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26693#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:08,327 INFO L273 TraceCheckUtils]: 67: Hoare triple {26693#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26693#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:08,328 INFO L273 TraceCheckUtils]: 68: Hoare triple {26693#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26694#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:08,329 INFO L273 TraceCheckUtils]: 69: Hoare triple {26694#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26694#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:08,329 INFO L273 TraceCheckUtils]: 70: Hoare triple {26694#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26694#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:08,330 INFO L273 TraceCheckUtils]: 71: Hoare triple {26694#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26695#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:08,331 INFO L273 TraceCheckUtils]: 72: Hoare triple {26695#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26695#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:08,331 INFO L273 TraceCheckUtils]: 73: Hoare triple {26695#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26695#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:08,332 INFO L273 TraceCheckUtils]: 74: Hoare triple {26695#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26696#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:08,332 INFO L273 TraceCheckUtils]: 75: Hoare triple {26696#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26696#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:08,333 INFO L273 TraceCheckUtils]: 76: Hoare triple {26696#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26696#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:08,334 INFO L273 TraceCheckUtils]: 77: Hoare triple {26696#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26697#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:08,334 INFO L273 TraceCheckUtils]: 78: Hoare triple {26697#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26697#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:08,335 INFO L273 TraceCheckUtils]: 79: Hoare triple {26697#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26697#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:08,336 INFO L273 TraceCheckUtils]: 80: Hoare triple {26697#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26698#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:08,336 INFO L273 TraceCheckUtils]: 81: Hoare triple {26698#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26698#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:08,337 INFO L273 TraceCheckUtils]: 82: Hoare triple {26698#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26698#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:08,338 INFO L273 TraceCheckUtils]: 83: Hoare triple {26698#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26699#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:08,338 INFO L273 TraceCheckUtils]: 84: Hoare triple {26699#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26699#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:08,339 INFO L273 TraceCheckUtils]: 85: Hoare triple {26699#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26699#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:08,339 INFO L273 TraceCheckUtils]: 86: Hoare triple {26699#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26700#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:08,340 INFO L273 TraceCheckUtils]: 87: Hoare triple {26700#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26700#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:08,341 INFO L273 TraceCheckUtils]: 88: Hoare triple {26700#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26700#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:08,341 INFO L273 TraceCheckUtils]: 89: Hoare triple {26700#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26701#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:08,342 INFO L273 TraceCheckUtils]: 90: Hoare triple {26701#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26701#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:08,342 INFO L273 TraceCheckUtils]: 91: Hoare triple {26701#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26701#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:08,343 INFO L273 TraceCheckUtils]: 92: Hoare triple {26701#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26702#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:08,344 INFO L273 TraceCheckUtils]: 93: Hoare triple {26702#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26702#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:08,344 INFO L273 TraceCheckUtils]: 94: Hoare triple {26702#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26702#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:08,345 INFO L273 TraceCheckUtils]: 95: Hoare triple {26702#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26703#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:08,346 INFO L273 TraceCheckUtils]: 96: Hoare triple {26703#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26703#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:08,346 INFO L273 TraceCheckUtils]: 97: Hoare triple {26703#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26703#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:08,347 INFO L273 TraceCheckUtils]: 98: Hoare triple {26703#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26704#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:08,347 INFO L273 TraceCheckUtils]: 99: Hoare triple {26704#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26704#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:08,348 INFO L273 TraceCheckUtils]: 100: Hoare triple {26704#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26704#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:08,349 INFO L273 TraceCheckUtils]: 101: Hoare triple {26704#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26705#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:08,349 INFO L273 TraceCheckUtils]: 102: Hoare triple {26705#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26705#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:08,350 INFO L273 TraceCheckUtils]: 103: Hoare triple {26705#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26705#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:08,351 INFO L273 TraceCheckUtils]: 104: Hoare triple {26705#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26706#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:08,351 INFO L273 TraceCheckUtils]: 105: Hoare triple {26706#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26706#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:08,352 INFO L273 TraceCheckUtils]: 106: Hoare triple {26706#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26706#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:08,353 INFO L273 TraceCheckUtils]: 107: Hoare triple {26706#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26707#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:08,353 INFO L273 TraceCheckUtils]: 108: Hoare triple {26707#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26707#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:08,354 INFO L273 TraceCheckUtils]: 109: Hoare triple {26707#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26707#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:08,354 INFO L273 TraceCheckUtils]: 110: Hoare triple {26707#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26708#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:08,355 INFO L273 TraceCheckUtils]: 111: Hoare triple {26708#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26708#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:08,356 INFO L273 TraceCheckUtils]: 112: Hoare triple {26708#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26708#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:08,356 INFO L273 TraceCheckUtils]: 113: Hoare triple {26708#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26709#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:08,357 INFO L273 TraceCheckUtils]: 114: Hoare triple {26709#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26709#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:08,358 INFO L273 TraceCheckUtils]: 115: Hoare triple {26709#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26709#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:08,358 INFO L273 TraceCheckUtils]: 116: Hoare triple {26709#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26710#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:08,359 INFO L273 TraceCheckUtils]: 117: Hoare triple {26710#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26710#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:08,359 INFO L273 TraceCheckUtils]: 118: Hoare triple {26710#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26710#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:08,360 INFO L273 TraceCheckUtils]: 119: Hoare triple {26710#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26711#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:08,361 INFO L273 TraceCheckUtils]: 120: Hoare triple {26711#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26711#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:08,361 INFO L273 TraceCheckUtils]: 121: Hoare triple {26711#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26711#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:08,362 INFO L273 TraceCheckUtils]: 122: Hoare triple {26711#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26712#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:08,363 INFO L273 TraceCheckUtils]: 123: Hoare triple {26712#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26712#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:08,363 INFO L273 TraceCheckUtils]: 124: Hoare triple {26712#(<= main_~i~0 39)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {26712#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:08,364 INFO L273 TraceCheckUtils]: 125: Hoare triple {26712#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26713#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:08,365 INFO L273 TraceCheckUtils]: 126: Hoare triple {26713#(<= main_~i~0 40)} assume !(~i~0 < 100000); {26672#false} is VALID [2018-11-23 12:08:08,365 INFO L273 TraceCheckUtils]: 127: Hoare triple {26672#false} havoc ~x~0;~x~0 := 0; {26672#false} is VALID [2018-11-23 12:08:08,365 INFO L273 TraceCheckUtils]: 128: Hoare triple {26672#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {26672#false} is VALID [2018-11-23 12:08:08,365 INFO L256 TraceCheckUtils]: 129: Hoare triple {26672#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {26672#false} is VALID [2018-11-23 12:08:08,365 INFO L273 TraceCheckUtils]: 130: Hoare triple {26672#false} ~cond := #in~cond; {26672#false} is VALID [2018-11-23 12:08:08,365 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#false} assume 0 == ~cond; {26672#false} is VALID [2018-11-23 12:08:08,366 INFO L273 TraceCheckUtils]: 132: Hoare triple {26672#false} assume !false; {26672#false} is VALID [2018-11-23 12:08:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:08,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:08,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:08:08,401 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 12:08:08,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:08,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:08:08,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:08,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:08:08,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:08:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:08:08,560 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand 44 states. [2018-11-23 12:08:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:09,558 INFO L93 Difference]: Finished difference Result 164 states and 212 transitions. [2018-11-23 12:08:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:08:09,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-23 12:08:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:08:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 212 transitions. [2018-11-23 12:08:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:08:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 212 transitions. [2018-11-23 12:08:09,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 212 transitions. [2018-11-23 12:08:09,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:09,801 INFO L225 Difference]: With dead ends: 164 [2018-11-23 12:08:09,801 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:08:09,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:08:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:08:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-23 12:08:09,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:09,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-23 12:08:09,859 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-23 12:08:09,859 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-23 12:08:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:09,862 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2018-11-23 12:08:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2018-11-23 12:08:09,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:09,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:09,863 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-23 12:08:09,863 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-23 12:08:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:09,866 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2018-11-23 12:08:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 193 transitions. [2018-11-23 12:08:09,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:09,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:09,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:09,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:08:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-11-23 12:08:09,869 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 133 [2018-11-23 12:08:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:09,870 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-11-23 12:08:09,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:08:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-11-23 12:08:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:08:09,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:09,871 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:09,871 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:09,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -843210508, now seen corresponding path program 41 times [2018-11-23 12:08:09,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:09,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:09,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:09,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:11,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {27826#true} call ULTIMATE.init(); {27826#true} is VALID [2018-11-23 12:08:11,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {27826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27826#true} is VALID [2018-11-23 12:08:11,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {27826#true} assume true; {27826#true} is VALID [2018-11-23 12:08:11,689 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27826#true} {27826#true} #70#return; {27826#true} is VALID [2018-11-23 12:08:11,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {27826#true} call #t~ret7 := main(); {27826#true} is VALID [2018-11-23 12:08:11,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {27826#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {27828#(= main_~i~0 0)} is VALID [2018-11-23 12:08:11,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {27828#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27828#(= main_~i~0 0)} is VALID [2018-11-23 12:08:11,691 INFO L273 TraceCheckUtils]: 7: Hoare triple {27828#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27828#(= main_~i~0 0)} is VALID [2018-11-23 12:08:11,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {27828#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27829#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {27829#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27829#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {27829#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27829#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:11,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {27829#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27830#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {27830#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27830#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {27830#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27830#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:11,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {27830#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27831#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {27831#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27831#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {27831#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27831#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:11,698 INFO L273 TraceCheckUtils]: 17: Hoare triple {27831#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27832#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {27832#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27832#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {27832#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27832#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:11,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {27832#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27833#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {27833#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27833#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,702 INFO L273 TraceCheckUtils]: 22: Hoare triple {27833#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27833#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:11,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {27833#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27834#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {27834#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27834#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {27834#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27834#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:11,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {27834#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27835#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {27835#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27835#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {27835#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27835#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:11,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {27835#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27836#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {27836#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27836#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,708 INFO L273 TraceCheckUtils]: 31: Hoare triple {27836#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27836#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:11,708 INFO L273 TraceCheckUtils]: 32: Hoare triple {27836#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27837#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,709 INFO L273 TraceCheckUtils]: 33: Hoare triple {27837#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27837#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {27837#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27837#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:11,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {27837#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27838#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,711 INFO L273 TraceCheckUtils]: 36: Hoare triple {27838#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27838#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,712 INFO L273 TraceCheckUtils]: 37: Hoare triple {27838#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27838#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:11,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {27838#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27839#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:11,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {27839#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27839#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:11,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {27839#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27839#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:11,714 INFO L273 TraceCheckUtils]: 41: Hoare triple {27839#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27840#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:11,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {27840#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27840#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:11,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {27840#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27840#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:11,716 INFO L273 TraceCheckUtils]: 44: Hoare triple {27840#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27841#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:11,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {27841#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27841#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:11,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {27841#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27841#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:11,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {27841#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27842#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:11,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {27842#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27842#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:11,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {27842#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27842#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:11,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {27842#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27843#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:11,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {27843#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27843#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:11,722 INFO L273 TraceCheckUtils]: 52: Hoare triple {27843#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27843#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:11,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {27843#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27844#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:11,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {27844#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27844#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:11,724 INFO L273 TraceCheckUtils]: 55: Hoare triple {27844#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27844#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:11,725 INFO L273 TraceCheckUtils]: 56: Hoare triple {27844#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27845#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:11,725 INFO L273 TraceCheckUtils]: 57: Hoare triple {27845#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27845#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:11,726 INFO L273 TraceCheckUtils]: 58: Hoare triple {27845#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27845#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:11,727 INFO L273 TraceCheckUtils]: 59: Hoare triple {27845#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27846#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:11,727 INFO L273 TraceCheckUtils]: 60: Hoare triple {27846#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27846#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:11,728 INFO L273 TraceCheckUtils]: 61: Hoare triple {27846#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27846#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:11,729 INFO L273 TraceCheckUtils]: 62: Hoare triple {27846#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27847#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:11,729 INFO L273 TraceCheckUtils]: 63: Hoare triple {27847#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27847#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:11,730 INFO L273 TraceCheckUtils]: 64: Hoare triple {27847#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27847#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:11,731 INFO L273 TraceCheckUtils]: 65: Hoare triple {27847#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27848#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:11,731 INFO L273 TraceCheckUtils]: 66: Hoare triple {27848#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27848#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:11,732 INFO L273 TraceCheckUtils]: 67: Hoare triple {27848#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27848#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:11,733 INFO L273 TraceCheckUtils]: 68: Hoare triple {27848#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27849#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:11,733 INFO L273 TraceCheckUtils]: 69: Hoare triple {27849#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27849#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:11,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {27849#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27849#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:11,735 INFO L273 TraceCheckUtils]: 71: Hoare triple {27849#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27850#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:11,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {27850#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27850#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:11,736 INFO L273 TraceCheckUtils]: 73: Hoare triple {27850#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27850#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:11,737 INFO L273 TraceCheckUtils]: 74: Hoare triple {27850#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27851#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:11,737 INFO L273 TraceCheckUtils]: 75: Hoare triple {27851#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27851#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:11,738 INFO L273 TraceCheckUtils]: 76: Hoare triple {27851#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27851#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:11,739 INFO L273 TraceCheckUtils]: 77: Hoare triple {27851#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27852#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:11,739 INFO L273 TraceCheckUtils]: 78: Hoare triple {27852#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27852#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:11,740 INFO L273 TraceCheckUtils]: 79: Hoare triple {27852#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27852#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:11,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {27852#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27853#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:11,741 INFO L273 TraceCheckUtils]: 81: Hoare triple {27853#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27853#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:11,742 INFO L273 TraceCheckUtils]: 82: Hoare triple {27853#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27853#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:11,743 INFO L273 TraceCheckUtils]: 83: Hoare triple {27853#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27854#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:11,743 INFO L273 TraceCheckUtils]: 84: Hoare triple {27854#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27854#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:11,744 INFO L273 TraceCheckUtils]: 85: Hoare triple {27854#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27854#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:11,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {27854#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27855#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:11,745 INFO L273 TraceCheckUtils]: 87: Hoare triple {27855#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27855#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:11,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {27855#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27855#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:11,747 INFO L273 TraceCheckUtils]: 89: Hoare triple {27855#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27856#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:11,747 INFO L273 TraceCheckUtils]: 90: Hoare triple {27856#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27856#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:11,748 INFO L273 TraceCheckUtils]: 91: Hoare triple {27856#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27856#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:11,749 INFO L273 TraceCheckUtils]: 92: Hoare triple {27856#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27857#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:11,749 INFO L273 TraceCheckUtils]: 93: Hoare triple {27857#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27857#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:11,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {27857#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27857#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:11,751 INFO L273 TraceCheckUtils]: 95: Hoare triple {27857#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27858#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:11,751 INFO L273 TraceCheckUtils]: 96: Hoare triple {27858#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27858#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:11,752 INFO L273 TraceCheckUtils]: 97: Hoare triple {27858#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27858#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:11,753 INFO L273 TraceCheckUtils]: 98: Hoare triple {27858#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27859#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:11,753 INFO L273 TraceCheckUtils]: 99: Hoare triple {27859#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27859#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:11,754 INFO L273 TraceCheckUtils]: 100: Hoare triple {27859#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27859#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:11,755 INFO L273 TraceCheckUtils]: 101: Hoare triple {27859#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27860#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:11,755 INFO L273 TraceCheckUtils]: 102: Hoare triple {27860#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27860#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:11,756 INFO L273 TraceCheckUtils]: 103: Hoare triple {27860#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27860#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:11,757 INFO L273 TraceCheckUtils]: 104: Hoare triple {27860#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27861#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:11,757 INFO L273 TraceCheckUtils]: 105: Hoare triple {27861#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27861#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:11,758 INFO L273 TraceCheckUtils]: 106: Hoare triple {27861#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27861#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:11,759 INFO L273 TraceCheckUtils]: 107: Hoare triple {27861#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27862#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:11,759 INFO L273 TraceCheckUtils]: 108: Hoare triple {27862#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27862#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:11,760 INFO L273 TraceCheckUtils]: 109: Hoare triple {27862#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27862#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:11,761 INFO L273 TraceCheckUtils]: 110: Hoare triple {27862#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27863#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:11,762 INFO L273 TraceCheckUtils]: 111: Hoare triple {27863#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27863#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:11,762 INFO L273 TraceCheckUtils]: 112: Hoare triple {27863#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27863#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:11,763 INFO L273 TraceCheckUtils]: 113: Hoare triple {27863#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27864#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:11,764 INFO L273 TraceCheckUtils]: 114: Hoare triple {27864#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27864#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:11,764 INFO L273 TraceCheckUtils]: 115: Hoare triple {27864#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27864#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:11,765 INFO L273 TraceCheckUtils]: 116: Hoare triple {27864#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27865#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:11,765 INFO L273 TraceCheckUtils]: 117: Hoare triple {27865#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27865#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:11,766 INFO L273 TraceCheckUtils]: 118: Hoare triple {27865#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27865#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:11,767 INFO L273 TraceCheckUtils]: 119: Hoare triple {27865#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27866#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:11,768 INFO L273 TraceCheckUtils]: 120: Hoare triple {27866#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27866#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:11,768 INFO L273 TraceCheckUtils]: 121: Hoare triple {27866#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27866#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:11,769 INFO L273 TraceCheckUtils]: 122: Hoare triple {27866#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27867#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:11,770 INFO L273 TraceCheckUtils]: 123: Hoare triple {27867#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27867#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:11,770 INFO L273 TraceCheckUtils]: 124: Hoare triple {27867#(<= main_~i~0 39)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27867#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:11,771 INFO L273 TraceCheckUtils]: 125: Hoare triple {27867#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27868#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:11,772 INFO L273 TraceCheckUtils]: 126: Hoare triple {27868#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27868#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:11,772 INFO L273 TraceCheckUtils]: 127: Hoare triple {27868#(<= main_~i~0 40)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27868#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:11,773 INFO L273 TraceCheckUtils]: 128: Hoare triple {27868#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27869#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:11,774 INFO L273 TraceCheckUtils]: 129: Hoare triple {27869#(<= main_~i~0 41)} assume !(~i~0 < 100000); {27827#false} is VALID [2018-11-23 12:08:11,774 INFO L273 TraceCheckUtils]: 130: Hoare triple {27827#false} havoc ~x~0;~x~0 := 0; {27827#false} is VALID [2018-11-23 12:08:11,774 INFO L273 TraceCheckUtils]: 131: Hoare triple {27827#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {27827#false} is VALID [2018-11-23 12:08:11,774 INFO L256 TraceCheckUtils]: 132: Hoare triple {27827#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {27827#false} is VALID [2018-11-23 12:08:11,775 INFO L273 TraceCheckUtils]: 133: Hoare triple {27827#false} ~cond := #in~cond; {27827#false} is VALID [2018-11-23 12:08:11,775 INFO L273 TraceCheckUtils]: 134: Hoare triple {27827#false} assume 0 == ~cond; {27827#false} is VALID [2018-11-23 12:08:11,775 INFO L273 TraceCheckUtils]: 135: Hoare triple {27827#false} assume !false; {27827#false} is VALID [2018-11-23 12:08:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:11,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:11,789 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:11,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:08:22,685 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 12:08:22,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:08:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:22,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:08:23,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {27826#true} call ULTIMATE.init(); {27826#true} is VALID [2018-11-23 12:08:23,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {27826#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27826#true} is VALID [2018-11-23 12:08:23,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {27826#true} assume true; {27826#true} is VALID [2018-11-23 12:08:23,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27826#true} {27826#true} #70#return; {27826#true} is VALID [2018-11-23 12:08:23,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {27826#true} call #t~ret7 := main(); {27826#true} is VALID [2018-11-23 12:08:23,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {27826#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {27888#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:23,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {27888#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27888#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:23,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {27888#(<= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27888#(<= main_~i~0 0)} is VALID [2018-11-23 12:08:23,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {27888#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27829#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:23,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {27829#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27829#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:23,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {27829#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27829#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:23,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {27829#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27830#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:23,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {27830#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27830#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:23,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {27830#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27830#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:23,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {27830#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27831#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:23,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {27831#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27831#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:23,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {27831#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27831#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:23,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {27831#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27832#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:23,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {27832#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27832#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:23,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {27832#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27832#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:23,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {27832#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27833#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:23,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {27833#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27833#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:23,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {27833#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27833#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:23,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {27833#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27834#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:23,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {27834#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27834#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:23,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {27834#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27834#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:23,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {27834#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27835#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:23,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {27835#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27835#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:23,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {27835#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27835#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:23,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {27835#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27836#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:23,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {27836#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27836#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:23,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {27836#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27836#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:23,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {27836#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27837#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:23,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {27837#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27837#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:23,190 INFO L273 TraceCheckUtils]: 34: Hoare triple {27837#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27837#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:23,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {27837#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27838#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:23,191 INFO L273 TraceCheckUtils]: 36: Hoare triple {27838#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27838#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:23,192 INFO L273 TraceCheckUtils]: 37: Hoare triple {27838#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27838#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:23,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {27838#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27839#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:23,193 INFO L273 TraceCheckUtils]: 39: Hoare triple {27839#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27839#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:23,194 INFO L273 TraceCheckUtils]: 40: Hoare triple {27839#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27839#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:23,195 INFO L273 TraceCheckUtils]: 41: Hoare triple {27839#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27840#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:23,195 INFO L273 TraceCheckUtils]: 42: Hoare triple {27840#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27840#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:23,196 INFO L273 TraceCheckUtils]: 43: Hoare triple {27840#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27840#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:23,197 INFO L273 TraceCheckUtils]: 44: Hoare triple {27840#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27841#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:23,197 INFO L273 TraceCheckUtils]: 45: Hoare triple {27841#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27841#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:23,198 INFO L273 TraceCheckUtils]: 46: Hoare triple {27841#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27841#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:23,199 INFO L273 TraceCheckUtils]: 47: Hoare triple {27841#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27842#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:23,199 INFO L273 TraceCheckUtils]: 48: Hoare triple {27842#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27842#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:23,200 INFO L273 TraceCheckUtils]: 49: Hoare triple {27842#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27842#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:23,201 INFO L273 TraceCheckUtils]: 50: Hoare triple {27842#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27843#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:23,201 INFO L273 TraceCheckUtils]: 51: Hoare triple {27843#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27843#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:23,202 INFO L273 TraceCheckUtils]: 52: Hoare triple {27843#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27843#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:23,203 INFO L273 TraceCheckUtils]: 53: Hoare triple {27843#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27844#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:23,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {27844#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27844#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:23,204 INFO L273 TraceCheckUtils]: 55: Hoare triple {27844#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27844#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:23,205 INFO L273 TraceCheckUtils]: 56: Hoare triple {27844#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27845#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:23,206 INFO L273 TraceCheckUtils]: 57: Hoare triple {27845#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27845#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:23,206 INFO L273 TraceCheckUtils]: 58: Hoare triple {27845#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27845#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:23,207 INFO L273 TraceCheckUtils]: 59: Hoare triple {27845#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27846#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:23,208 INFO L273 TraceCheckUtils]: 60: Hoare triple {27846#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27846#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:23,208 INFO L273 TraceCheckUtils]: 61: Hoare triple {27846#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27846#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:23,209 INFO L273 TraceCheckUtils]: 62: Hoare triple {27846#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27847#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:23,210 INFO L273 TraceCheckUtils]: 63: Hoare triple {27847#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27847#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:23,210 INFO L273 TraceCheckUtils]: 64: Hoare triple {27847#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27847#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:23,211 INFO L273 TraceCheckUtils]: 65: Hoare triple {27847#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27848#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:23,212 INFO L273 TraceCheckUtils]: 66: Hoare triple {27848#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27848#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:23,212 INFO L273 TraceCheckUtils]: 67: Hoare triple {27848#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27848#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:23,213 INFO L273 TraceCheckUtils]: 68: Hoare triple {27848#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27849#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:23,214 INFO L273 TraceCheckUtils]: 69: Hoare triple {27849#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27849#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:23,214 INFO L273 TraceCheckUtils]: 70: Hoare triple {27849#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27849#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:23,215 INFO L273 TraceCheckUtils]: 71: Hoare triple {27849#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27850#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:23,216 INFO L273 TraceCheckUtils]: 72: Hoare triple {27850#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27850#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:23,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {27850#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27850#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:23,217 INFO L273 TraceCheckUtils]: 74: Hoare triple {27850#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27851#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:23,218 INFO L273 TraceCheckUtils]: 75: Hoare triple {27851#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27851#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:23,218 INFO L273 TraceCheckUtils]: 76: Hoare triple {27851#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27851#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:23,219 INFO L273 TraceCheckUtils]: 77: Hoare triple {27851#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27852#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:23,220 INFO L273 TraceCheckUtils]: 78: Hoare triple {27852#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27852#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:23,220 INFO L273 TraceCheckUtils]: 79: Hoare triple {27852#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27852#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:23,221 INFO L273 TraceCheckUtils]: 80: Hoare triple {27852#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27853#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:23,222 INFO L273 TraceCheckUtils]: 81: Hoare triple {27853#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27853#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:23,222 INFO L273 TraceCheckUtils]: 82: Hoare triple {27853#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27853#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:23,223 INFO L273 TraceCheckUtils]: 83: Hoare triple {27853#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27854#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:23,224 INFO L273 TraceCheckUtils]: 84: Hoare triple {27854#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27854#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:23,224 INFO L273 TraceCheckUtils]: 85: Hoare triple {27854#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27854#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:23,225 INFO L273 TraceCheckUtils]: 86: Hoare triple {27854#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27855#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:23,226 INFO L273 TraceCheckUtils]: 87: Hoare triple {27855#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27855#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:23,226 INFO L273 TraceCheckUtils]: 88: Hoare triple {27855#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27855#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:23,227 INFO L273 TraceCheckUtils]: 89: Hoare triple {27855#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27856#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:23,228 INFO L273 TraceCheckUtils]: 90: Hoare triple {27856#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27856#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:23,229 INFO L273 TraceCheckUtils]: 91: Hoare triple {27856#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27856#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:23,229 INFO L273 TraceCheckUtils]: 92: Hoare triple {27856#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27857#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:23,230 INFO L273 TraceCheckUtils]: 93: Hoare triple {27857#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27857#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:23,231 INFO L273 TraceCheckUtils]: 94: Hoare triple {27857#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27857#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:23,231 INFO L273 TraceCheckUtils]: 95: Hoare triple {27857#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27858#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:23,232 INFO L273 TraceCheckUtils]: 96: Hoare triple {27858#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27858#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:23,233 INFO L273 TraceCheckUtils]: 97: Hoare triple {27858#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27858#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:23,233 INFO L273 TraceCheckUtils]: 98: Hoare triple {27858#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27859#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:23,234 INFO L273 TraceCheckUtils]: 99: Hoare triple {27859#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27859#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:23,235 INFO L273 TraceCheckUtils]: 100: Hoare triple {27859#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27859#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:23,235 INFO L273 TraceCheckUtils]: 101: Hoare triple {27859#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27860#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:23,236 INFO L273 TraceCheckUtils]: 102: Hoare triple {27860#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27860#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:23,245 INFO L273 TraceCheckUtils]: 103: Hoare triple {27860#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27860#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:23,245 INFO L273 TraceCheckUtils]: 104: Hoare triple {27860#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27861#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:23,246 INFO L273 TraceCheckUtils]: 105: Hoare triple {27861#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27861#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:23,250 INFO L273 TraceCheckUtils]: 106: Hoare triple {27861#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27861#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:23,250 INFO L273 TraceCheckUtils]: 107: Hoare triple {27861#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27862#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:23,251 INFO L273 TraceCheckUtils]: 108: Hoare triple {27862#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27862#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:23,251 INFO L273 TraceCheckUtils]: 109: Hoare triple {27862#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27862#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:23,251 INFO L273 TraceCheckUtils]: 110: Hoare triple {27862#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27863#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:23,252 INFO L273 TraceCheckUtils]: 111: Hoare triple {27863#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27863#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:23,252 INFO L273 TraceCheckUtils]: 112: Hoare triple {27863#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27863#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:23,253 INFO L273 TraceCheckUtils]: 113: Hoare triple {27863#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27864#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:23,253 INFO L273 TraceCheckUtils]: 114: Hoare triple {27864#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27864#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:23,254 INFO L273 TraceCheckUtils]: 115: Hoare triple {27864#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27864#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:23,255 INFO L273 TraceCheckUtils]: 116: Hoare triple {27864#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27865#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:23,255 INFO L273 TraceCheckUtils]: 117: Hoare triple {27865#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27865#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:23,256 INFO L273 TraceCheckUtils]: 118: Hoare triple {27865#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27865#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:23,257 INFO L273 TraceCheckUtils]: 119: Hoare triple {27865#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27866#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:23,257 INFO L273 TraceCheckUtils]: 120: Hoare triple {27866#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27866#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:23,258 INFO L273 TraceCheckUtils]: 121: Hoare triple {27866#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27866#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:23,259 INFO L273 TraceCheckUtils]: 122: Hoare triple {27866#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27867#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:23,259 INFO L273 TraceCheckUtils]: 123: Hoare triple {27867#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27867#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:23,260 INFO L273 TraceCheckUtils]: 124: Hoare triple {27867#(<= main_~i~0 39)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27867#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:23,261 INFO L273 TraceCheckUtils]: 125: Hoare triple {27867#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27868#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:23,261 INFO L273 TraceCheckUtils]: 126: Hoare triple {27868#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27868#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:23,262 INFO L273 TraceCheckUtils]: 127: Hoare triple {27868#(<= main_~i~0 40)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {27868#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:23,263 INFO L273 TraceCheckUtils]: 128: Hoare triple {27868#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27869#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:23,264 INFO L273 TraceCheckUtils]: 129: Hoare triple {27869#(<= main_~i~0 41)} assume !(~i~0 < 100000); {27827#false} is VALID [2018-11-23 12:08:23,264 INFO L273 TraceCheckUtils]: 130: Hoare triple {27827#false} havoc ~x~0;~x~0 := 0; {27827#false} is VALID [2018-11-23 12:08:23,264 INFO L273 TraceCheckUtils]: 131: Hoare triple {27827#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {27827#false} is VALID [2018-11-23 12:08:23,264 INFO L256 TraceCheckUtils]: 132: Hoare triple {27827#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {27827#false} is VALID [2018-11-23 12:08:23,264 INFO L273 TraceCheckUtils]: 133: Hoare triple {27827#false} ~cond := #in~cond; {27827#false} is VALID [2018-11-23 12:08:23,265 INFO L273 TraceCheckUtils]: 134: Hoare triple {27827#false} assume 0 == ~cond; {27827#false} is VALID [2018-11-23 12:08:23,265 INFO L273 TraceCheckUtils]: 135: Hoare triple {27827#false} assume !false; {27827#false} is VALID [2018-11-23 12:08:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:08:23,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 12:08:23,304 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 12:08:23,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:08:23,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:08:23,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:23,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:08:23,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:08:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:08:23,481 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 45 states. [2018-11-23 12:08:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:24,617 INFO L93 Difference]: Finished difference Result 167 states and 216 transitions. [2018-11-23 12:08:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:08:24,617 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-23 12:08:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:08:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:08:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 216 transitions. [2018-11-23 12:08:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:08:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 216 transitions. [2018-11-23 12:08:24,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 216 transitions. [2018-11-23 12:08:24,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:08:24,870 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:08:24,870 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 12:08:24,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:08:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 12:08:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-23 12:08:24,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:08:24,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 149 states. [2018-11-23 12:08:24,931 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 149 states. [2018-11-23 12:08:24,931 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 149 states. [2018-11-23 12:08:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:24,935 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2018-11-23 12:08:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2018-11-23 12:08:24,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:24,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:24,936 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 151 states. [2018-11-23 12:08:24,936 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 151 states. [2018-11-23 12:08:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:08:24,938 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2018-11-23 12:08:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2018-11-23 12:08:24,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:08:24,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:08:24,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:08:24,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:08:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-23 12:08:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2018-11-23 12:08:24,940 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 136 [2018-11-23 12:08:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:08:24,941 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2018-11-23 12:08:24,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:08:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-23 12:08:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-23 12:08:24,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:08:24,941 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:08:24,941 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:08:24,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:08:24,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1563148569, now seen corresponding path program 42 times [2018-11-23 12:08:24,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:08:24,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:08:24,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:24,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:08:24,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:08:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:08:26,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {29005#true} call ULTIMATE.init(); {29005#true} is VALID [2018-11-23 12:08:26,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {29005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29005#true} is VALID [2018-11-23 12:08:26,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {29005#true} assume true; {29005#true} is VALID [2018-11-23 12:08:26,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29005#true} {29005#true} #70#return; {29005#true} is VALID [2018-11-23 12:08:26,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {29005#true} call #t~ret7 := main(); {29005#true} is VALID [2018-11-23 12:08:26,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {29005#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(400000);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(400000);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(400000);havoc ~i~0;~j~0 := 0;~i~0 := 0; {29007#(= main_~i~0 0)} is VALID [2018-11-23 12:08:26,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {29007#(= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29007#(= main_~i~0 0)} is VALID [2018-11-23 12:08:26,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {29007#(= main_~i~0 0)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29007#(= main_~i~0 0)} is VALID [2018-11-23 12:08:26,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {29007#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29008#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:26,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {29008#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29008#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:26,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {29008#(<= main_~i~0 1)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29008#(<= main_~i~0 1)} is VALID [2018-11-23 12:08:26,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {29008#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29009#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:26,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {29009#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29009#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:26,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {29009#(<= main_~i~0 2)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29009#(<= main_~i~0 2)} is VALID [2018-11-23 12:08:26,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {29009#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29010#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:26,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {29010#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29010#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:26,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {29010#(<= main_~i~0 3)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29010#(<= main_~i~0 3)} is VALID [2018-11-23 12:08:26,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {29010#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29011#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:26,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {29011#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29011#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:26,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {29011#(<= main_~i~0 4)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29011#(<= main_~i~0 4)} is VALID [2018-11-23 12:08:26,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {29011#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29012#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:26,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {29012#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29012#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:26,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {29012#(<= main_~i~0 5)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29012#(<= main_~i~0 5)} is VALID [2018-11-23 12:08:26,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {29012#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29013#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:26,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {29013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29013#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:26,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {29013#(<= main_~i~0 6)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29013#(<= main_~i~0 6)} is VALID [2018-11-23 12:08:26,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {29013#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29014#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:26,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {29014#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29014#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:26,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {29014#(<= main_~i~0 7)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29014#(<= main_~i~0 7)} is VALID [2018-11-23 12:08:26,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {29014#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29015#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:26,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {29015#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29015#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:26,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {29015#(<= main_~i~0 8)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29015#(<= main_~i~0 8)} is VALID [2018-11-23 12:08:26,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {29015#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29016#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:26,929 INFO L273 TraceCheckUtils]: 33: Hoare triple {29016#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29016#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:26,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {29016#(<= main_~i~0 9)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29016#(<= main_~i~0 9)} is VALID [2018-11-23 12:08:26,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {29016#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29017#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:26,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {29017#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29017#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:26,932 INFO L273 TraceCheckUtils]: 37: Hoare triple {29017#(<= main_~i~0 10)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29017#(<= main_~i~0 10)} is VALID [2018-11-23 12:08:26,932 INFO L273 TraceCheckUtils]: 38: Hoare triple {29017#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29018#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:26,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {29018#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29018#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:26,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {29018#(<= main_~i~0 11)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29018#(<= main_~i~0 11)} is VALID [2018-11-23 12:08:26,935 INFO L273 TraceCheckUtils]: 41: Hoare triple {29018#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29019#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:26,935 INFO L273 TraceCheckUtils]: 42: Hoare triple {29019#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29019#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:26,936 INFO L273 TraceCheckUtils]: 43: Hoare triple {29019#(<= main_~i~0 12)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29019#(<= main_~i~0 12)} is VALID [2018-11-23 12:08:26,937 INFO L273 TraceCheckUtils]: 44: Hoare triple {29019#(<= main_~i~0 12)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29020#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:26,937 INFO L273 TraceCheckUtils]: 45: Hoare triple {29020#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29020#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:26,938 INFO L273 TraceCheckUtils]: 46: Hoare triple {29020#(<= main_~i~0 13)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29020#(<= main_~i~0 13)} is VALID [2018-11-23 12:08:26,939 INFO L273 TraceCheckUtils]: 47: Hoare triple {29020#(<= main_~i~0 13)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29021#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:26,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {29021#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29021#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:26,940 INFO L273 TraceCheckUtils]: 49: Hoare triple {29021#(<= main_~i~0 14)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29021#(<= main_~i~0 14)} is VALID [2018-11-23 12:08:26,940 INFO L273 TraceCheckUtils]: 50: Hoare triple {29021#(<= main_~i~0 14)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29022#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:26,941 INFO L273 TraceCheckUtils]: 51: Hoare triple {29022#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29022#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:26,942 INFO L273 TraceCheckUtils]: 52: Hoare triple {29022#(<= main_~i~0 15)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29022#(<= main_~i~0 15)} is VALID [2018-11-23 12:08:26,942 INFO L273 TraceCheckUtils]: 53: Hoare triple {29022#(<= main_~i~0 15)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29023#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:26,943 INFO L273 TraceCheckUtils]: 54: Hoare triple {29023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29023#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:26,944 INFO L273 TraceCheckUtils]: 55: Hoare triple {29023#(<= main_~i~0 16)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29023#(<= main_~i~0 16)} is VALID [2018-11-23 12:08:26,944 INFO L273 TraceCheckUtils]: 56: Hoare triple {29023#(<= main_~i~0 16)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29024#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:26,945 INFO L273 TraceCheckUtils]: 57: Hoare triple {29024#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29024#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:26,946 INFO L273 TraceCheckUtils]: 58: Hoare triple {29024#(<= main_~i~0 17)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29024#(<= main_~i~0 17)} is VALID [2018-11-23 12:08:26,947 INFO L273 TraceCheckUtils]: 59: Hoare triple {29024#(<= main_~i~0 17)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29025#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:26,947 INFO L273 TraceCheckUtils]: 60: Hoare triple {29025#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29025#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:26,948 INFO L273 TraceCheckUtils]: 61: Hoare triple {29025#(<= main_~i~0 18)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29025#(<= main_~i~0 18)} is VALID [2018-11-23 12:08:26,949 INFO L273 TraceCheckUtils]: 62: Hoare triple {29025#(<= main_~i~0 18)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29026#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:26,949 INFO L273 TraceCheckUtils]: 63: Hoare triple {29026#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29026#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:26,950 INFO L273 TraceCheckUtils]: 64: Hoare triple {29026#(<= main_~i~0 19)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29026#(<= main_~i~0 19)} is VALID [2018-11-23 12:08:26,951 INFO L273 TraceCheckUtils]: 65: Hoare triple {29026#(<= main_~i~0 19)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29027#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:26,951 INFO L273 TraceCheckUtils]: 66: Hoare triple {29027#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29027#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:26,952 INFO L273 TraceCheckUtils]: 67: Hoare triple {29027#(<= main_~i~0 20)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29027#(<= main_~i~0 20)} is VALID [2018-11-23 12:08:26,953 INFO L273 TraceCheckUtils]: 68: Hoare triple {29027#(<= main_~i~0 20)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29028#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:26,953 INFO L273 TraceCheckUtils]: 69: Hoare triple {29028#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29028#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:26,954 INFO L273 TraceCheckUtils]: 70: Hoare triple {29028#(<= main_~i~0 21)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29028#(<= main_~i~0 21)} is VALID [2018-11-23 12:08:26,955 INFO L273 TraceCheckUtils]: 71: Hoare triple {29028#(<= main_~i~0 21)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29029#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:26,955 INFO L273 TraceCheckUtils]: 72: Hoare triple {29029#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29029#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:26,956 INFO L273 TraceCheckUtils]: 73: Hoare triple {29029#(<= main_~i~0 22)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29029#(<= main_~i~0 22)} is VALID [2018-11-23 12:08:26,957 INFO L273 TraceCheckUtils]: 74: Hoare triple {29029#(<= main_~i~0 22)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29030#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:26,957 INFO L273 TraceCheckUtils]: 75: Hoare triple {29030#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29030#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:26,958 INFO L273 TraceCheckUtils]: 76: Hoare triple {29030#(<= main_~i~0 23)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29030#(<= main_~i~0 23)} is VALID [2018-11-23 12:08:26,959 INFO L273 TraceCheckUtils]: 77: Hoare triple {29030#(<= main_~i~0 23)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29031#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:26,959 INFO L273 TraceCheckUtils]: 78: Hoare triple {29031#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29031#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:26,960 INFO L273 TraceCheckUtils]: 79: Hoare triple {29031#(<= main_~i~0 24)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29031#(<= main_~i~0 24)} is VALID [2018-11-23 12:08:26,961 INFO L273 TraceCheckUtils]: 80: Hoare triple {29031#(<= main_~i~0 24)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29032#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:26,961 INFO L273 TraceCheckUtils]: 81: Hoare triple {29032#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29032#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:26,962 INFO L273 TraceCheckUtils]: 82: Hoare triple {29032#(<= main_~i~0 25)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29032#(<= main_~i~0 25)} is VALID [2018-11-23 12:08:26,963 INFO L273 TraceCheckUtils]: 83: Hoare triple {29032#(<= main_~i~0 25)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29033#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:26,964 INFO L273 TraceCheckUtils]: 84: Hoare triple {29033#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29033#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:26,964 INFO L273 TraceCheckUtils]: 85: Hoare triple {29033#(<= main_~i~0 26)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29033#(<= main_~i~0 26)} is VALID [2018-11-23 12:08:26,965 INFO L273 TraceCheckUtils]: 86: Hoare triple {29033#(<= main_~i~0 26)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29034#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:26,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {29034#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29034#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:26,966 INFO L273 TraceCheckUtils]: 88: Hoare triple {29034#(<= main_~i~0 27)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29034#(<= main_~i~0 27)} is VALID [2018-11-23 12:08:26,967 INFO L273 TraceCheckUtils]: 89: Hoare triple {29034#(<= main_~i~0 27)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29035#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:26,968 INFO L273 TraceCheckUtils]: 90: Hoare triple {29035#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29035#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:26,969 INFO L273 TraceCheckUtils]: 91: Hoare triple {29035#(<= main_~i~0 28)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29035#(<= main_~i~0 28)} is VALID [2018-11-23 12:08:26,969 INFO L273 TraceCheckUtils]: 92: Hoare triple {29035#(<= main_~i~0 28)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29036#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:26,970 INFO L273 TraceCheckUtils]: 93: Hoare triple {29036#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29036#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:26,970 INFO L273 TraceCheckUtils]: 94: Hoare triple {29036#(<= main_~i~0 29)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29036#(<= main_~i~0 29)} is VALID [2018-11-23 12:08:26,971 INFO L273 TraceCheckUtils]: 95: Hoare triple {29036#(<= main_~i~0 29)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29037#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:26,972 INFO L273 TraceCheckUtils]: 96: Hoare triple {29037#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29037#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:26,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {29037#(<= main_~i~0 30)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29037#(<= main_~i~0 30)} is VALID [2018-11-23 12:08:26,973 INFO L273 TraceCheckUtils]: 98: Hoare triple {29037#(<= main_~i~0 30)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29038#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:26,974 INFO L273 TraceCheckUtils]: 99: Hoare triple {29038#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29038#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:26,975 INFO L273 TraceCheckUtils]: 100: Hoare triple {29038#(<= main_~i~0 31)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29038#(<= main_~i~0 31)} is VALID [2018-11-23 12:08:26,975 INFO L273 TraceCheckUtils]: 101: Hoare triple {29038#(<= main_~i~0 31)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29039#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:26,976 INFO L273 TraceCheckUtils]: 102: Hoare triple {29039#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29039#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:26,977 INFO L273 TraceCheckUtils]: 103: Hoare triple {29039#(<= main_~i~0 32)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29039#(<= main_~i~0 32)} is VALID [2018-11-23 12:08:26,977 INFO L273 TraceCheckUtils]: 104: Hoare triple {29039#(<= main_~i~0 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29040#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:26,978 INFO L273 TraceCheckUtils]: 105: Hoare triple {29040#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29040#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:26,979 INFO L273 TraceCheckUtils]: 106: Hoare triple {29040#(<= main_~i~0 33)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29040#(<= main_~i~0 33)} is VALID [2018-11-23 12:08:26,979 INFO L273 TraceCheckUtils]: 107: Hoare triple {29040#(<= main_~i~0 33)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29041#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:26,980 INFO L273 TraceCheckUtils]: 108: Hoare triple {29041#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29041#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:26,981 INFO L273 TraceCheckUtils]: 109: Hoare triple {29041#(<= main_~i~0 34)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29041#(<= main_~i~0 34)} is VALID [2018-11-23 12:08:26,981 INFO L273 TraceCheckUtils]: 110: Hoare triple {29041#(<= main_~i~0 34)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29042#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:26,982 INFO L273 TraceCheckUtils]: 111: Hoare triple {29042#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29042#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:26,983 INFO L273 TraceCheckUtils]: 112: Hoare triple {29042#(<= main_~i~0 35)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29042#(<= main_~i~0 35)} is VALID [2018-11-23 12:08:26,983 INFO L273 TraceCheckUtils]: 113: Hoare triple {29042#(<= main_~i~0 35)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29043#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:26,984 INFO L273 TraceCheckUtils]: 114: Hoare triple {29043#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29043#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:26,985 INFO L273 TraceCheckUtils]: 115: Hoare triple {29043#(<= main_~i~0 36)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29043#(<= main_~i~0 36)} is VALID [2018-11-23 12:08:26,985 INFO L273 TraceCheckUtils]: 116: Hoare triple {29043#(<= main_~i~0 36)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29044#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:26,986 INFO L273 TraceCheckUtils]: 117: Hoare triple {29044#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29044#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:26,987 INFO L273 TraceCheckUtils]: 118: Hoare triple {29044#(<= main_~i~0 37)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29044#(<= main_~i~0 37)} is VALID [2018-11-23 12:08:26,987 INFO L273 TraceCheckUtils]: 119: Hoare triple {29044#(<= main_~i~0 37)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29045#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:26,988 INFO L273 TraceCheckUtils]: 120: Hoare triple {29045#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29045#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:26,989 INFO L273 TraceCheckUtils]: 121: Hoare triple {29045#(<= main_~i~0 38)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29045#(<= main_~i~0 38)} is VALID [2018-11-23 12:08:26,989 INFO L273 TraceCheckUtils]: 122: Hoare triple {29045#(<= main_~i~0 38)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29046#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:26,990 INFO L273 TraceCheckUtils]: 123: Hoare triple {29046#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29046#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:26,991 INFO L273 TraceCheckUtils]: 124: Hoare triple {29046#(<= main_~i~0 39)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29046#(<= main_~i~0 39)} is VALID [2018-11-23 12:08:26,991 INFO L273 TraceCheckUtils]: 125: Hoare triple {29046#(<= main_~i~0 39)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29047#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:26,992 INFO L273 TraceCheckUtils]: 126: Hoare triple {29047#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29047#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:26,993 INFO L273 TraceCheckUtils]: 127: Hoare triple {29047#(<= main_~i~0 40)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29047#(<= main_~i~0 40)} is VALID [2018-11-23 12:08:26,994 INFO L273 TraceCheckUtils]: 128: Hoare triple {29047#(<= main_~i~0 40)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29048#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:26,994 INFO L273 TraceCheckUtils]: 129: Hoare triple {29048#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);call #t~mem2 := read~int(~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29048#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:26,995 INFO L273 TraceCheckUtils]: 130: Hoare triple {29048#(<= main_~i~0 41)} assume #t~mem1 == #t~mem2;havoc #t~mem1;havoc #t~mem2;call write~int(~i~0, ~#C~0.base, ~#C~0.offset + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {29048#(<= main_~i~0 41)} is VALID [2018-11-23 12:08:26,996 INFO L273 TraceCheckUtils]: 131: Hoare triple {29048#(<= main_~i~0 41)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29049#(<= main_~i~0 42)} is VALID [2018-11-23 12:08:26,996 INFO L273 TraceCheckUtils]: 132: Hoare triple {29049#(<= main_~i~0 42)} assume !(~i~0 < 100000); {29006#false} is VALID [2018-11-23 12:08:26,996 INFO L273 TraceCheckUtils]: 133: Hoare triple {29006#false} havoc ~x~0;~x~0 := 0; {29006#false} is VALID [2018-11-23 12:08:26,997 INFO L273 TraceCheckUtils]: 134: Hoare triple {29006#false} assume !!(~x~0 < ~j~0);call #t~mem4 := read~int(~#C~0.base, ~#C~0.offset + 4 * ~x~0, 4); {29006#false} is VALID [2018-11-23 12:08:26,997 INFO L256 TraceCheckUtils]: 135: Hoare triple {29006#false} call __VERIFIER_assert((if #t~mem4 <= ~x~0 + ~i~0 - ~j~0 then 1 else 0)); {29006#false} is VALID [2018-11-23 12:08:26,997 INFO L273 TraceCheckUtils]: 136: Hoare triple {29006#false} ~cond := #in~cond; {29006#false} is VALID [2018-11-23 12:08:26,997 INFO L273 TraceCheckUtils]: 137: Hoare triple {29006#false} assume 0 == ~cond; {29006#false} is VALID [2018-11-23 12:08:26,997 INFO L273 TraceCheckUtils]: 138: Hoare triple {29006#false} assume !false; {29006#false} is VALID [2018-11-23 12:08:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:08:27,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:08:27,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:08:27,022 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE