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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy9_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:39:36,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:39:36,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:39:36,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:39:36,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:39:36,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:39:36,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:39:36,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:39:36,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:39:36,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:39:36,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:39:36,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:39:36,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:39:36,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:39:36,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:39:36,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:39:36,067 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:39:36,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:39:36,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:39:36,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:39:36,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:39:36,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:39:36,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:39:36,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:39:36,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:39:36,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:39:36,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:39:36,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:39:36,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:39:36,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:39:36,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:39:36,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:39:36,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:39:36,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:39:36,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:39:36,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:39:36,085 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:39:36,101 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:39:36,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:39:36,102 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:39:36,102 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:39:36,103 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:39:36,103 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:39:36,103 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:39:36,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:39:36,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:39:36,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:39:36,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:39:36,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:39:36,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:39:36,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:39:36,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:39:36,105 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:39:36,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:39:36,105 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:39:36,105 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:39:36,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:39:36,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:39:36,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:39:36,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:39:36,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:39:36,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:39:36,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:39:36,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:39:36,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:39:36,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:39:36,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:39:36,108 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:39:36,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:39:36,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:39:36,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:39:36,180 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:39:36,181 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:39:36,182 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy9_false-unreach-call_ground.i [2018-11-14 18:39:36,244 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c062376/33954d94adbf462abb79f635186a7ffa/FLAG481cbb1ee [2018-11-14 18:39:36,738 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:39:36,739 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy9_false-unreach-call_ground.i [2018-11-14 18:39:36,751 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c062376/33954d94adbf462abb79f635186a7ffa/FLAG481cbb1ee [2018-11-14 18:39:36,782 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c062376/33954d94adbf462abb79f635186a7ffa [2018-11-14 18:39:36,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:39:36,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:39:36,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:39:36,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:39:36,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:39:36,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:39:36" (1/1) ... [2018-11-14 18:39:36,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38263162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:36, skipping insertion in model container [2018-11-14 18:39:36,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:39:36" (1/1) ... [2018-11-14 18:39:36,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:39:36,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:39:37,099 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:39:37,104 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:39:37,174 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:39:37,204 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:39:37,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37 WrapperNode [2018-11-14 18:39:37,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:39:37,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:39:37,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:39:37,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:39:37,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (1/1) ... [2018-11-14 18:39:37,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (1/1) ... [2018-11-14 18:39:37,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (1/1) ... [2018-11-14 18:39:37,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (1/1) ... [2018-11-14 18:39:37,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (1/1) ... [2018-11-14 18:39:37,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (1/1) ... [2018-11-14 18:39:37,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (1/1) ... [2018-11-14 18:39:37,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:39:37,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:39:37,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:39:37,298 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:39:37,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (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-14 18:39:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:39:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:39:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:39:37,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:39:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:39:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:39:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:39:37,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:39:37,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:39:37,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:39:37,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:39:37,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:39:37,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:39:37,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:39:37,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:39:38,696 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:39:38,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:39:38 BoogieIcfgContainer [2018-11-14 18:39:38,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:39:38,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:39:38,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:39:38,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:39:38,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:39:36" (1/3) ... [2018-11-14 18:39:38,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae4ef6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:39:38, skipping insertion in model container [2018-11-14 18:39:38,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:39:37" (2/3) ... [2018-11-14 18:39:38,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae4ef6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:39:38, skipping insertion in model container [2018-11-14 18:39:38,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:39:38" (3/3) ... [2018-11-14 18:39:38,706 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy9_false-unreach-call_ground.i [2018-11-14 18:39:38,716 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:39:38,724 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:39:38,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:39:38,775 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:39:38,775 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:39:38,776 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:39:38,776 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:39:38,776 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:39:38,777 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:39:38,777 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:39:38,777 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:39:38,778 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:39:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-11-14 18:39:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:39:38,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:38,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:38,811 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:38,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2102163447, now seen corresponding path program 1 times [2018-11-14 18:39:38,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:38,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:38,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:38,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:39,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {65#true} is VALID [2018-11-14 18:39:39,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {65#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {65#true} is VALID [2018-11-14 18:39:39,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2018-11-14 18:39:39,033 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #186#return; {65#true} is VALID [2018-11-14 18:39:39,033 INFO L256 TraceCheckUtils]: 4: Hoare triple {65#true} call #t~ret24 := main(); {65#true} is VALID [2018-11-14 18:39:39,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {65#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {65#true} is VALID [2018-11-14 18:39:39,050 INFO L273 TraceCheckUtils]: 6: Hoare triple {65#true} assume !true; {66#false} is VALID [2018-11-14 18:39:39,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {66#false} havoc ~i~0;~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,052 INFO L273 TraceCheckUtils]: 11: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,055 INFO L273 TraceCheckUtils]: 19: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {66#false} ~i~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,056 INFO L273 TraceCheckUtils]: 24: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-14 18:39:39,057 INFO L273 TraceCheckUtils]: 25: Hoare triple {66#false} havoc ~x~0;~x~0 := 0; {66#false} is VALID [2018-11-14 18:39:39,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-14 18:39:39,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {66#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {66#false} is VALID [2018-11-14 18:39:39,058 INFO L256 TraceCheckUtils]: 28: Hoare triple {66#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {66#false} is VALID [2018-11-14 18:39:39,058 INFO L273 TraceCheckUtils]: 29: Hoare triple {66#false} ~cond := #in~cond; {66#false} is VALID [2018-11-14 18:39:39,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {66#false} assume ~cond == 0; {66#false} is VALID [2018-11-14 18:39:39,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {66#false} assume !false; {66#false} is VALID [2018-11-14 18:39:39,065 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-14 18:39:39,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:39:39,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:39:39,074 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:39:39,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:39,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:39:39,256 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-14 18:39:39,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:39:39,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:39:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:39:39,268 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-11-14 18:39:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:39,518 INFO L93 Difference]: Finished difference Result 115 states and 158 transitions. [2018-11-14 18:39:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:39:39,518 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:39:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:39:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-14 18:39:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:39:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-14 18:39:39,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 158 transitions. [2018-11-14 18:39:40,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:40,254 INFO L225 Difference]: With dead ends: 115 [2018-11-14 18:39:40,254 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 18:39:40,258 INFO L604 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-14 18:39:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 18:39:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-14 18:39:40,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:40,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-14 18:39:40,323 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 18:39:40,323 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 18:39:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:40,330 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 18:39:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 18:39:40,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:40,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:40,332 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-14 18:39:40,332 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-14 18:39:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:40,339 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-14 18:39:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 18:39:40,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:40,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:40,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:40,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 18:39:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-11-14 18:39:40,350 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 32 [2018-11-14 18:39:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:40,350 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-14 18:39:40,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:39:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-14 18:39:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:39:40,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:40,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:40,353 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:40,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash -55002290, now seen corresponding path program 1 times [2018-11-14 18:39:40,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:40,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:40,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:40,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:40,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-14 18:39:40,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {401#true} is VALID [2018-11-14 18:39:40,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-14 18:39:40,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} #186#return; {401#true} is VALID [2018-11-14 18:39:40,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {401#true} call #t~ret24 := main(); {401#true} is VALID [2018-11-14 18:39:40,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {403#(= main_~a~0 0)} is VALID [2018-11-14 18:39:40,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(= main_~a~0 0)} assume true; {403#(= main_~a~0 0)} is VALID [2018-11-14 18:39:40,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(= main_~a~0 0)} assume !(~a~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {402#false} havoc ~i~0;~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,489 INFO L273 TraceCheckUtils]: 23: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,490 INFO L273 TraceCheckUtils]: 28: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,491 INFO L273 TraceCheckUtils]: 30: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {402#false} ~i~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,492 INFO L273 TraceCheckUtils]: 33: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {402#false} assume !(~i~0 < 100000); {402#false} is VALID [2018-11-14 18:39:40,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {402#false} havoc ~x~0;~x~0 := 0; {402#false} is VALID [2018-11-14 18:39:40,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-14 18:39:40,494 INFO L273 TraceCheckUtils]: 37: Hoare triple {402#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {402#false} is VALID [2018-11-14 18:39:40,494 INFO L256 TraceCheckUtils]: 38: Hoare triple {402#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {402#false} is VALID [2018-11-14 18:39:40,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {402#false} ~cond := #in~cond; {402#false} is VALID [2018-11-14 18:39:40,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {402#false} assume ~cond == 0; {402#false} is VALID [2018-11-14 18:39:40,495 INFO L273 TraceCheckUtils]: 41: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-14 18:39:40,498 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-14 18:39:40,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:39:40,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:39:40,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 18:39:40,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:40,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:39:40,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:40,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:39:40,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:39:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:39:40,636 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 3 states. [2018-11-14 18:39:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:40,890 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2018-11-14 18:39:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:39:40,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 18:39:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:39:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 18:39:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:39:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 18:39:40,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-14 18:39:41,188 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-14 18:39:41,191 INFO L225 Difference]: With dead ends: 108 [2018-11-14 18:39:41,191 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:39:41,193 INFO L604 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-14 18:39:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:39:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-14 18:39:41,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:41,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-14 18:39:41,234 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-14 18:39:41,235 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-14 18:39:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:41,239 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 18:39:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-14 18:39:41,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:41,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:41,241 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-14 18:39:41,241 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-14 18:39:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:41,245 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 18:39:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-11-14 18:39:41,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:41,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:41,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:41,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:39:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-14 18:39:41,251 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 42 [2018-11-14 18:39:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:41,252 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-14 18:39:41,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:39:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-14 18:39:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:39:41,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:41,254 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:41,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:41,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:41,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1427077725, now seen corresponding path program 1 times [2018-11-14 18:39:41,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:41,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:41,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:41,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:41,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:41,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {741#true} call ULTIMATE.init(); {741#true} is VALID [2018-11-14 18:39:41,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {741#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {741#true} is VALID [2018-11-14 18:39:41,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-14 18:39:41,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {741#true} {741#true} #186#return; {741#true} is VALID [2018-11-14 18:39:41,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {741#true} call #t~ret24 := main(); {741#true} is VALID [2018-11-14 18:39:41,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {741#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {741#true} is VALID [2018-11-14 18:39:41,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-14 18:39:41,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {741#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {741#true} is VALID [2018-11-14 18:39:41,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {741#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {741#true} is VALID [2018-11-14 18:39:41,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {741#true} assume true; {741#true} is VALID [2018-11-14 18:39:41,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {741#true} assume !(~a~0 < 100000); {741#true} is VALID [2018-11-14 18:39:41,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {741#true} havoc ~i~0;~i~0 := 0; {743#(= main_~i~0 0)} is VALID [2018-11-14 18:39:41,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {743#(= main_~i~0 0)} assume true; {743#(= main_~i~0 0)} is VALID [2018-11-14 18:39:41,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {743#(= main_~i~0 0)} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,372 INFO L273 TraceCheckUtils]: 22: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,376 INFO L273 TraceCheckUtils]: 34: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {742#false} ~i~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {742#false} assume !(~i~0 < 100000); {742#false} is VALID [2018-11-14 18:39:41,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {742#false} havoc ~x~0;~x~0 := 0; {742#false} is VALID [2018-11-14 18:39:41,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {742#false} assume true; {742#false} is VALID [2018-11-14 18:39:41,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {742#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {742#false} is VALID [2018-11-14 18:39:41,378 INFO L256 TraceCheckUtils]: 41: Hoare triple {742#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {742#false} is VALID [2018-11-14 18:39:41,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {742#false} ~cond := #in~cond; {742#false} is VALID [2018-11-14 18:39:41,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {742#false} assume ~cond == 0; {742#false} is VALID [2018-11-14 18:39:41,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {742#false} assume !false; {742#false} is VALID [2018-11-14 18:39:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:39:41,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:39:41,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:39:41,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-14 18:39:41,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:41,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:39:41,508 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-14 18:39:41,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:39:41,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:39:41,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:39:41,510 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 3 states. [2018-11-14 18:39:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:41,817 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2018-11-14 18:39:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:39:41,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-14 18:39:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:39:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-14 18:39:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:39:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-14 18:39:41,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-14 18:39:42,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:42,028 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:39:42,028 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 18:39:42,029 INFO L604 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-14 18:39:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 18:39:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-11-14 18:39:42,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:42,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 77 states. [2018-11-14 18:39:42,142 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 77 states. [2018-11-14 18:39:42,143 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 77 states. [2018-11-14 18:39:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:42,147 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 18:39:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-11-14 18:39:42,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:42,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:42,149 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 86 states. [2018-11-14 18:39:42,149 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 86 states. [2018-11-14 18:39:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:42,154 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 18:39:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-11-14 18:39:42,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:42,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:42,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:42,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:39:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-14 18:39:42,160 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 45 [2018-11-14 18:39:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:42,160 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-14 18:39:42,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:39:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-14 18:39:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 18:39:42,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:42,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:42,163 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:42,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:42,163 INFO L82 PathProgramCache]: Analyzing trace with hash 870895647, now seen corresponding path program 1 times [2018-11-14 18:39:42,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:42,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:42,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:42,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:42,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-14 18:39:42,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-14 18:39:42,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-14 18:39:42,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #186#return; {1190#true} is VALID [2018-11-14 18:39:42,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret24 := main(); {1190#true} is VALID [2018-11-14 18:39:42,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1192#(= main_~a~0 0)} is VALID [2018-11-14 18:39:42,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {1192#(= main_~a~0 0)} assume true; {1192#(= main_~a~0 0)} is VALID [2018-11-14 18:39:42,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {1192#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1192#(= main_~a~0 0)} is VALID [2018-11-14 18:39:42,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {1192#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:42,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {1193#(<= main_~a~0 1)} assume true; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:42,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {1193#(<= main_~a~0 1)} assume !(~a~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} havoc ~i~0;~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1191#false} is VALID [2018-11-14 18:39:42,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1191#false} is VALID [2018-11-14 18:39:42,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,335 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1191#false} is VALID [2018-11-14 18:39:42,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {1191#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1191#false} is VALID [2018-11-14 18:39:42,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,337 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1191#false} is VALID [2018-11-14 18:39:42,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {1191#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1191#false} is VALID [2018-11-14 18:39:42,338 INFO L273 TraceCheckUtils]: 27: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1191#false} is VALID [2018-11-14 18:39:42,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {1191#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1191#false} is VALID [2018-11-14 18:39:42,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,340 INFO L273 TraceCheckUtils]: 35: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1191#false} is VALID [2018-11-14 18:39:42,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {1191#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1191#false} is VALID [2018-11-14 18:39:42,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,341 INFO L273 TraceCheckUtils]: 40: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,342 INFO L273 TraceCheckUtils]: 41: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,342 INFO L273 TraceCheckUtils]: 43: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {1191#false} is VALID [2018-11-14 18:39:42,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {1191#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {1191#false} is VALID [2018-11-14 18:39:42,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,343 INFO L273 TraceCheckUtils]: 47: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,344 INFO L273 TraceCheckUtils]: 48: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,344 INFO L273 TraceCheckUtils]: 49: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {1191#false} is VALID [2018-11-14 18:39:42,344 INFO L273 TraceCheckUtils]: 50: Hoare triple {1191#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {1191#false} is VALID [2018-11-14 18:39:42,345 INFO L273 TraceCheckUtils]: 51: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,345 INFO L273 TraceCheckUtils]: 52: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,345 INFO L273 TraceCheckUtils]: 53: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,345 INFO L273 TraceCheckUtils]: 54: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,346 INFO L273 TraceCheckUtils]: 55: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {1191#false} is VALID [2018-11-14 18:39:42,346 INFO L273 TraceCheckUtils]: 56: Hoare triple {1191#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1191#false} is VALID [2018-11-14 18:39:42,346 INFO L273 TraceCheckUtils]: 57: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,347 INFO L273 TraceCheckUtils]: 58: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,347 INFO L273 TraceCheckUtils]: 59: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,347 INFO L273 TraceCheckUtils]: 60: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,347 INFO L273 TraceCheckUtils]: 61: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {1191#false} is VALID [2018-11-14 18:39:42,348 INFO L273 TraceCheckUtils]: 62: Hoare triple {1191#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {1191#false} is VALID [2018-11-14 18:39:42,348 INFO L273 TraceCheckUtils]: 63: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,348 INFO L273 TraceCheckUtils]: 65: Hoare triple {1191#false} havoc ~x~0;~x~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,349 INFO L273 TraceCheckUtils]: 66: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,349 INFO L273 TraceCheckUtils]: 67: Hoare triple {1191#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1191#false} is VALID [2018-11-14 18:39:42,349 INFO L256 TraceCheckUtils]: 68: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {1191#false} is VALID [2018-11-14 18:39:42,350 INFO L273 TraceCheckUtils]: 69: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-14 18:39:42,350 INFO L273 TraceCheckUtils]: 70: Hoare triple {1191#false} assume ~cond == 0; {1191#false} is VALID [2018-11-14 18:39:42,350 INFO L273 TraceCheckUtils]: 71: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-14 18:39:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:39:42,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:42,358 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-14 18:39:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:42,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:42,866 INFO L256 TraceCheckUtils]: 0: Hoare triple {1190#true} call ULTIMATE.init(); {1190#true} is VALID [2018-11-14 18:39:42,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {1190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1190#true} is VALID [2018-11-14 18:39:42,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {1190#true} assume true; {1190#true} is VALID [2018-11-14 18:39:42,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} #186#return; {1190#true} is VALID [2018-11-14 18:39:42,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {1190#true} call #t~ret24 := main(); {1190#true} is VALID [2018-11-14 18:39:42,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {1190#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1212#(<= main_~a~0 0)} is VALID [2018-11-14 18:39:42,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {1212#(<= main_~a~0 0)} assume true; {1212#(<= main_~a~0 0)} is VALID [2018-11-14 18:39:42,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {1212#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1212#(<= main_~a~0 0)} is VALID [2018-11-14 18:39:42,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {1212#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:42,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {1193#(<= main_~a~0 1)} assume true; {1193#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:42,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {1193#(<= main_~a~0 1)} assume !(~a~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {1191#false} havoc ~i~0;~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1191#false} is VALID [2018-11-14 18:39:42,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {1191#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1191#false} is VALID [2018-11-14 18:39:42,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1191#false} is VALID [2018-11-14 18:39:42,877 INFO L273 TraceCheckUtils]: 20: Hoare triple {1191#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1191#false} is VALID [2018-11-14 18:39:42,877 INFO L273 TraceCheckUtils]: 21: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,878 INFO L273 TraceCheckUtils]: 23: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1191#false} is VALID [2018-11-14 18:39:42,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {1191#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1191#false} is VALID [2018-11-14 18:39:42,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1191#false} is VALID [2018-11-14 18:39:42,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {1191#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1191#false} is VALID [2018-11-14 18:39:42,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,882 INFO L273 TraceCheckUtils]: 37: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1191#false} is VALID [2018-11-14 18:39:42,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {1191#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1191#false} is VALID [2018-11-14 18:39:42,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,883 INFO L273 TraceCheckUtils]: 40: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,883 INFO L273 TraceCheckUtils]: 42: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,883 INFO L273 TraceCheckUtils]: 43: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {1191#false} is VALID [2018-11-14 18:39:42,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {1191#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {1191#false} is VALID [2018-11-14 18:39:42,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,884 INFO L273 TraceCheckUtils]: 47: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {1191#false} is VALID [2018-11-14 18:39:42,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {1191#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {1191#false} is VALID [2018-11-14 18:39:42,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,886 INFO L273 TraceCheckUtils]: 53: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,886 INFO L273 TraceCheckUtils]: 54: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,887 INFO L273 TraceCheckUtils]: 55: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {1191#false} is VALID [2018-11-14 18:39:42,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {1191#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1191#false} is VALID [2018-11-14 18:39:42,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {1191#false} ~i~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {1191#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {1191#false} is VALID [2018-11-14 18:39:42,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {1191#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {1191#false} is VALID [2018-11-14 18:39:42,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,889 INFO L273 TraceCheckUtils]: 64: Hoare triple {1191#false} assume !(~i~0 < 100000); {1191#false} is VALID [2018-11-14 18:39:42,889 INFO L273 TraceCheckUtils]: 65: Hoare triple {1191#false} havoc ~x~0;~x~0 := 0; {1191#false} is VALID [2018-11-14 18:39:42,889 INFO L273 TraceCheckUtils]: 66: Hoare triple {1191#false} assume true; {1191#false} is VALID [2018-11-14 18:39:42,890 INFO L273 TraceCheckUtils]: 67: Hoare triple {1191#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1191#false} is VALID [2018-11-14 18:39:42,890 INFO L256 TraceCheckUtils]: 68: Hoare triple {1191#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {1191#false} is VALID [2018-11-14 18:39:42,890 INFO L273 TraceCheckUtils]: 69: Hoare triple {1191#false} ~cond := #in~cond; {1191#false} is VALID [2018-11-14 18:39:42,891 INFO L273 TraceCheckUtils]: 70: Hoare triple {1191#false} assume ~cond == 0; {1191#false} is VALID [2018-11-14 18:39:42,891 INFO L273 TraceCheckUtils]: 71: Hoare triple {1191#false} assume !false; {1191#false} is VALID [2018-11-14 18:39:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:39:42,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:42,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:39:42,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-14 18:39:42,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:42,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:39:43,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:43,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:39:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:39:43,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:39:43,121 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2018-11-14 18:39:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:43,388 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2018-11-14 18:39:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:39:43,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-11-14 18:39:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:39:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2018-11-14 18:39:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:39:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2018-11-14 18:39:43,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2018-11-14 18:39:43,672 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-14 18:39:43,675 INFO L225 Difference]: With dead ends: 147 [2018-11-14 18:39:43,675 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 18:39:43,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-14 18:39:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 18:39:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-14 18:39:43,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:43,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-14 18:39:43,773 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-14 18:39:43,773 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-14 18:39:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:43,778 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-14 18:39:43,778 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-14 18:39:43,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:43,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:43,779 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-14 18:39:43,780 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-14 18:39:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:43,784 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-14 18:39:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-14 18:39:43,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:43,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:43,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:43,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:39:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-14 18:39:43,789 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 72 [2018-11-14 18:39:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:43,789 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-14 18:39:43,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:39:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-14 18:39:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 18:39:43,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:43,792 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:43,792 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:43,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:43,793 INFO L82 PathProgramCache]: Analyzing trace with hash 120428468, now seen corresponding path program 2 times [2018-11-14 18:39:43,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:43,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:43,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:43,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:39:43,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:43,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1876#true} is VALID [2018-11-14 18:39:43,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1876#true} is VALID [2018-11-14 18:39:43,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:43,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #186#return; {1876#true} is VALID [2018-11-14 18:39:43,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret24 := main(); {1876#true} is VALID [2018-11-14 18:39:43,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {1876#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1878#(= main_~a~0 0)} is VALID [2018-11-14 18:39:43,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {1878#(= main_~a~0 0)} assume true; {1878#(= main_~a~0 0)} is VALID [2018-11-14 18:39:43,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {1878#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1878#(= main_~a~0 0)} is VALID [2018-11-14 18:39:43,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {1878#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1879#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:43,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {1879#(<= main_~a~0 1)} assume true; {1879#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:44,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {1879#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1879#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:44,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {1879#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1880#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:44,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {1880#(<= main_~a~0 2)} assume true; {1880#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:44,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {1880#(<= main_~a~0 2)} assume !(~a~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {1877#false} havoc ~i~0;~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1877#false} is VALID [2018-11-14 18:39:44,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {1877#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1877#false} is VALID [2018-11-14 18:39:44,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1877#false} is VALID [2018-11-14 18:39:44,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {1877#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1877#false} is VALID [2018-11-14 18:39:44,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,013 INFO L273 TraceCheckUtils]: 26: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,013 INFO L273 TraceCheckUtils]: 27: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,013 INFO L273 TraceCheckUtils]: 28: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1877#false} is VALID [2018-11-14 18:39:44,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {1877#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1877#false} is VALID [2018-11-14 18:39:44,014 INFO L273 TraceCheckUtils]: 30: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,014 INFO L273 TraceCheckUtils]: 31: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,014 INFO L273 TraceCheckUtils]: 32: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,014 INFO L273 TraceCheckUtils]: 33: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1877#false} is VALID [2018-11-14 18:39:44,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {1877#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1877#false} is VALID [2018-11-14 18:39:44,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,015 INFO L273 TraceCheckUtils]: 37: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,015 INFO L273 TraceCheckUtils]: 38: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1877#false} is VALID [2018-11-14 18:39:44,016 INFO L273 TraceCheckUtils]: 41: Hoare triple {1877#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1877#false} is VALID [2018-11-14 18:39:44,016 INFO L273 TraceCheckUtils]: 42: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,017 INFO L273 TraceCheckUtils]: 43: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,017 INFO L273 TraceCheckUtils]: 44: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,017 INFO L273 TraceCheckUtils]: 45: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,017 INFO L273 TraceCheckUtils]: 46: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {1877#false} is VALID [2018-11-14 18:39:44,018 INFO L273 TraceCheckUtils]: 47: Hoare triple {1877#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {1877#false} is VALID [2018-11-14 18:39:44,018 INFO L273 TraceCheckUtils]: 48: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,018 INFO L273 TraceCheckUtils]: 49: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,018 INFO L273 TraceCheckUtils]: 50: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,019 INFO L273 TraceCheckUtils]: 51: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,019 INFO L273 TraceCheckUtils]: 52: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {1877#false} is VALID [2018-11-14 18:39:44,019 INFO L273 TraceCheckUtils]: 53: Hoare triple {1877#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {1877#false} is VALID [2018-11-14 18:39:44,019 INFO L273 TraceCheckUtils]: 54: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,020 INFO L273 TraceCheckUtils]: 56: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,020 INFO L273 TraceCheckUtils]: 57: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {1877#false} is VALID [2018-11-14 18:39:44,020 INFO L273 TraceCheckUtils]: 59: Hoare triple {1877#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1877#false} is VALID [2018-11-14 18:39:44,020 INFO L273 TraceCheckUtils]: 60: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,020 INFO L273 TraceCheckUtils]: 61: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {1877#false} ~i~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,021 INFO L273 TraceCheckUtils]: 63: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,021 INFO L273 TraceCheckUtils]: 64: Hoare triple {1877#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {1877#false} is VALID [2018-11-14 18:39:44,021 INFO L273 TraceCheckUtils]: 65: Hoare triple {1877#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {1877#false} is VALID [2018-11-14 18:39:44,021 INFO L273 TraceCheckUtils]: 66: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,022 INFO L273 TraceCheckUtils]: 67: Hoare triple {1877#false} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,022 INFO L273 TraceCheckUtils]: 68: Hoare triple {1877#false} havoc ~x~0;~x~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,022 INFO L273 TraceCheckUtils]: 70: Hoare triple {1877#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1877#false} is VALID [2018-11-14 18:39:44,022 INFO L256 TraceCheckUtils]: 71: Hoare triple {1877#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {1877#false} is VALID [2018-11-14 18:39:44,023 INFO L273 TraceCheckUtils]: 72: Hoare triple {1877#false} ~cond := #in~cond; {1877#false} is VALID [2018-11-14 18:39:44,023 INFO L273 TraceCheckUtils]: 73: Hoare triple {1877#false} assume ~cond == 0; {1877#false} is VALID [2018-11-14 18:39:44,023 INFO L273 TraceCheckUtils]: 74: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2018-11-14 18:39:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:39:44,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:44,029 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-14 18:39:44,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:39:44,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:39:44,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:44,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:44,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {1876#true} call ULTIMATE.init(); {1876#true} is VALID [2018-11-14 18:39:44,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {1876#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1876#true} is VALID [2018-11-14 18:39:44,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1876#true} {1876#true} #186#return; {1876#true} is VALID [2018-11-14 18:39:44,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {1876#true} call #t~ret24 := main(); {1876#true} is VALID [2018-11-14 18:39:44,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {1876#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {1876#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1876#true} is VALID [2018-11-14 18:39:44,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {1876#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1876#true} is VALID [2018-11-14 18:39:44,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {1876#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {1876#true} is VALID [2018-11-14 18:39:44,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {1876#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {1876#true} is VALID [2018-11-14 18:39:44,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {1876#true} assume !(~a~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {1876#true} havoc ~i~0;~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {1876#true} is VALID [2018-11-14 18:39:44,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {1876#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {1876#true} is VALID [2018-11-14 18:39:44,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {1876#true} is VALID [2018-11-14 18:39:44,461 INFO L273 TraceCheckUtils]: 23: Hoare triple {1876#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {1876#true} is VALID [2018-11-14 18:39:44,461 INFO L273 TraceCheckUtils]: 24: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,461 INFO L273 TraceCheckUtils]: 25: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,462 INFO L273 TraceCheckUtils]: 26: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,462 INFO L273 TraceCheckUtils]: 27: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {1876#true} is VALID [2018-11-14 18:39:44,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {1876#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1876#true} is VALID [2018-11-14 18:39:44,463 INFO L273 TraceCheckUtils]: 30: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,463 INFO L273 TraceCheckUtils]: 31: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,463 INFO L273 TraceCheckUtils]: 32: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,463 INFO L273 TraceCheckUtils]: 33: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {1876#true} is VALID [2018-11-14 18:39:44,464 INFO L273 TraceCheckUtils]: 35: Hoare triple {1876#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {1876#true} is VALID [2018-11-14 18:39:44,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,465 INFO L273 TraceCheckUtils]: 39: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,465 INFO L273 TraceCheckUtils]: 40: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {1876#true} is VALID [2018-11-14 18:39:44,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {1876#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {1876#true} is VALID [2018-11-14 18:39:44,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,466 INFO L273 TraceCheckUtils]: 43: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,466 INFO L273 TraceCheckUtils]: 44: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,466 INFO L273 TraceCheckUtils]: 45: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {1876#true} is VALID [2018-11-14 18:39:44,467 INFO L273 TraceCheckUtils]: 47: Hoare triple {1876#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {1876#true} is VALID [2018-11-14 18:39:44,467 INFO L273 TraceCheckUtils]: 48: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,468 INFO L273 TraceCheckUtils]: 49: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,468 INFO L273 TraceCheckUtils]: 50: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,468 INFO L273 TraceCheckUtils]: 51: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {1876#true} is VALID [2018-11-14 18:39:44,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {1876#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {1876#true} is VALID [2018-11-14 18:39:44,469 INFO L273 TraceCheckUtils]: 54: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,469 INFO L273 TraceCheckUtils]: 55: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,469 INFO L273 TraceCheckUtils]: 56: Hoare triple {1876#true} ~i~0 := 0; {1876#true} is VALID [2018-11-14 18:39:44,470 INFO L273 TraceCheckUtils]: 57: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {1876#true} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {1876#true} is VALID [2018-11-14 18:39:44,470 INFO L273 TraceCheckUtils]: 59: Hoare triple {1876#true} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1876#true} is VALID [2018-11-14 18:39:44,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {1876#true} assume true; {1876#true} is VALID [2018-11-14 18:39:44,471 INFO L273 TraceCheckUtils]: 61: Hoare triple {1876#true} assume !(~i~0 < 100000); {1876#true} is VALID [2018-11-14 18:39:44,472 INFO L273 TraceCheckUtils]: 62: Hoare triple {1876#true} ~i~0 := 0; {2070#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:44,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {2070#(<= main_~i~0 0)} assume true; {2070#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:44,474 INFO L273 TraceCheckUtils]: 64: Hoare triple {2070#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {2070#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:44,474 INFO L273 TraceCheckUtils]: 65: Hoare triple {2070#(<= main_~i~0 0)} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {2080#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:44,476 INFO L273 TraceCheckUtils]: 66: Hoare triple {2080#(<= main_~i~0 1)} assume true; {2080#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:44,476 INFO L273 TraceCheckUtils]: 67: Hoare triple {2080#(<= main_~i~0 1)} assume !(~i~0 < 100000); {1877#false} is VALID [2018-11-14 18:39:44,477 INFO L273 TraceCheckUtils]: 68: Hoare triple {1877#false} havoc ~x~0;~x~0 := 0; {1877#false} is VALID [2018-11-14 18:39:44,477 INFO L273 TraceCheckUtils]: 69: Hoare triple {1877#false} assume true; {1877#false} is VALID [2018-11-14 18:39:44,477 INFO L273 TraceCheckUtils]: 70: Hoare triple {1877#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {1877#false} is VALID [2018-11-14 18:39:44,477 INFO L256 TraceCheckUtils]: 71: Hoare triple {1877#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {1877#false} is VALID [2018-11-14 18:39:44,477 INFO L273 TraceCheckUtils]: 72: Hoare triple {1877#false} ~cond := #in~cond; {1877#false} is VALID [2018-11-14 18:39:44,478 INFO L273 TraceCheckUtils]: 73: Hoare triple {1877#false} assume ~cond == 0; {1877#false} is VALID [2018-11-14 18:39:44,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {1877#false} assume !false; {1877#false} is VALID [2018-11-14 18:39:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 18:39:44,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-14 18:39:44,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-14 18:39:44,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:44,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:39:44,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:44,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:39:44,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:39:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:39:44,695 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 7 states. [2018-11-14 18:39:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:45,597 INFO L93 Difference]: Finished difference Result 186 states and 215 transitions. [2018-11-14 18:39:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:39:45,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-11-14 18:39:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:39:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2018-11-14 18:39:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:39:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2018-11-14 18:39:45,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 197 transitions. [2018-11-14 18:39:45,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:45,887 INFO L225 Difference]: With dead ends: 186 [2018-11-14 18:39:45,888 INFO L226 Difference]: Without dead ends: 120 [2018-11-14 18:39:45,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:39:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-14 18:39:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2018-11-14 18:39:46,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:46,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 110 states. [2018-11-14 18:39:46,108 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 110 states. [2018-11-14 18:39:46,108 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 110 states. [2018-11-14 18:39:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:46,113 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-11-14 18:39:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-11-14 18:39:46,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:46,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:46,114 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 120 states. [2018-11-14 18:39:46,114 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 120 states. [2018-11-14 18:39:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:46,118 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-11-14 18:39:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-11-14 18:39:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:46,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:46,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:46,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 18:39:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-11-14 18:39:46,123 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 75 [2018-11-14 18:39:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:46,124 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-11-14 18:39:46,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:39:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-11-14 18:39:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 18:39:46,125 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:46,126 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:46,126 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:46,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1353183933, now seen corresponding path program 3 times [2018-11-14 18:39:46,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:46,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:46,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:46,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:46,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:46,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2018-11-14 18:39:46,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {2740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2740#true} is VALID [2018-11-14 18:39:46,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #186#return; {2740#true} is VALID [2018-11-14 18:39:46,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret24 := main(); {2740#true} is VALID [2018-11-14 18:39:46,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {2740#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2742#(= main_~a~0 0)} is VALID [2018-11-14 18:39:46,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {2742#(= main_~a~0 0)} assume true; {2742#(= main_~a~0 0)} is VALID [2018-11-14 18:39:46,336 INFO L273 TraceCheckUtils]: 7: Hoare triple {2742#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2742#(= main_~a~0 0)} is VALID [2018-11-14 18:39:46,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {2742#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2743#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:46,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {2743#(<= main_~a~0 1)} assume true; {2743#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:46,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {2743#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2743#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:46,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {2743#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2744#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:46,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {2744#(<= main_~a~0 2)} assume true; {2744#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:46,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {2744#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2744#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:46,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {2744#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2745#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:46,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {2745#(<= main_~a~0 3)} assume true; {2745#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:46,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {2745#(<= main_~a~0 3)} assume !(~a~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {2741#false} havoc ~i~0;~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2741#false} is VALID [2018-11-14 18:39:46,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {2741#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2741#false} is VALID [2018-11-14 18:39:46,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2741#false} is VALID [2018-11-14 18:39:46,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {2741#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2741#false} is VALID [2018-11-14 18:39:46,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2741#false} is VALID [2018-11-14 18:39:46,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {2741#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2741#false} is VALID [2018-11-14 18:39:46,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2741#false} is VALID [2018-11-14 18:39:46,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {2741#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2741#false} is VALID [2018-11-14 18:39:46,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,348 INFO L273 TraceCheckUtils]: 35: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,349 INFO L273 TraceCheckUtils]: 36: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,349 INFO L273 TraceCheckUtils]: 37: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2741#false} is VALID [2018-11-14 18:39:46,349 INFO L273 TraceCheckUtils]: 38: Hoare triple {2741#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2741#false} is VALID [2018-11-14 18:39:46,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,349 INFO L273 TraceCheckUtils]: 40: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2741#false} is VALID [2018-11-14 18:39:46,349 INFO L273 TraceCheckUtils]: 41: Hoare triple {2741#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2741#false} is VALID [2018-11-14 18:39:46,349 INFO L273 TraceCheckUtils]: 42: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,350 INFO L273 TraceCheckUtils]: 43: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,350 INFO L273 TraceCheckUtils]: 44: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,350 INFO L273 TraceCheckUtils]: 45: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2741#false} is VALID [2018-11-14 18:39:46,350 INFO L273 TraceCheckUtils]: 47: Hoare triple {2741#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2741#false} is VALID [2018-11-14 18:39:46,350 INFO L273 TraceCheckUtils]: 48: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,350 INFO L273 TraceCheckUtils]: 49: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2741#false} is VALID [2018-11-14 18:39:46,351 INFO L273 TraceCheckUtils]: 50: Hoare triple {2741#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2741#false} is VALID [2018-11-14 18:39:46,351 INFO L273 TraceCheckUtils]: 51: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,351 INFO L273 TraceCheckUtils]: 54: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,351 INFO L273 TraceCheckUtils]: 55: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2741#false} is VALID [2018-11-14 18:39:46,351 INFO L273 TraceCheckUtils]: 56: Hoare triple {2741#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2741#false} is VALID [2018-11-14 18:39:46,352 INFO L273 TraceCheckUtils]: 57: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2741#false} is VALID [2018-11-14 18:39:46,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {2741#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2741#false} is VALID [2018-11-14 18:39:46,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,352 INFO L273 TraceCheckUtils]: 62: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,352 INFO L273 TraceCheckUtils]: 63: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 64: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 65: Hoare triple {2741#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 66: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 67: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 68: Hoare triple {2741#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 69: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 70: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,353 INFO L273 TraceCheckUtils]: 71: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,354 INFO L273 TraceCheckUtils]: 72: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,354 INFO L273 TraceCheckUtils]: 73: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {2741#false} is VALID [2018-11-14 18:39:46,354 INFO L273 TraceCheckUtils]: 74: Hoare triple {2741#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {2741#false} is VALID [2018-11-14 18:39:46,354 INFO L273 TraceCheckUtils]: 75: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,354 INFO L273 TraceCheckUtils]: 76: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {2741#false} is VALID [2018-11-14 18:39:46,354 INFO L273 TraceCheckUtils]: 77: Hoare triple {2741#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {2741#false} is VALID [2018-11-14 18:39:46,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,355 INFO L273 TraceCheckUtils]: 79: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,355 INFO L273 TraceCheckUtils]: 80: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {2741#false} is VALID [2018-11-14 18:39:46,355 INFO L273 TraceCheckUtils]: 83: Hoare triple {2741#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2741#false} is VALID [2018-11-14 18:39:46,355 INFO L273 TraceCheckUtils]: 84: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,356 INFO L273 TraceCheckUtils]: 85: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {2741#false} is VALID [2018-11-14 18:39:46,356 INFO L273 TraceCheckUtils]: 86: Hoare triple {2741#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2741#false} is VALID [2018-11-14 18:39:46,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,356 INFO L273 TraceCheckUtils]: 88: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,356 INFO L273 TraceCheckUtils]: 89: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,357 INFO L273 TraceCheckUtils]: 90: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,357 INFO L273 TraceCheckUtils]: 91: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {2741#false} is VALID [2018-11-14 18:39:46,357 INFO L273 TraceCheckUtils]: 92: Hoare triple {2741#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {2741#false} is VALID [2018-11-14 18:39:46,357 INFO L273 TraceCheckUtils]: 93: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,357 INFO L273 TraceCheckUtils]: 94: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {2741#false} is VALID [2018-11-14 18:39:46,357 INFO L273 TraceCheckUtils]: 95: Hoare triple {2741#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {2741#false} is VALID [2018-11-14 18:39:46,357 INFO L273 TraceCheckUtils]: 96: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,358 INFO L273 TraceCheckUtils]: 97: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,358 INFO L273 TraceCheckUtils]: 98: Hoare triple {2741#false} havoc ~x~0;~x~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,358 INFO L273 TraceCheckUtils]: 99: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,358 INFO L273 TraceCheckUtils]: 100: Hoare triple {2741#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {2741#false} is VALID [2018-11-14 18:39:46,359 INFO L256 TraceCheckUtils]: 101: Hoare triple {2741#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {2741#false} is VALID [2018-11-14 18:39:46,359 INFO L273 TraceCheckUtils]: 102: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2018-11-14 18:39:46,359 INFO L273 TraceCheckUtils]: 103: Hoare triple {2741#false} assume ~cond == 0; {2741#false} is VALID [2018-11-14 18:39:46,359 INFO L273 TraceCheckUtils]: 104: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2018-11-14 18:39:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-14 18:39:46,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:46,365 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-14 18:39:46,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:39:46,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 18:39:46,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:46,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:46,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {2740#true} call ULTIMATE.init(); {2740#true} is VALID [2018-11-14 18:39:46,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {2740#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2740#true} is VALID [2018-11-14 18:39:46,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2740#true} {2740#true} #186#return; {2740#true} is VALID [2018-11-14 18:39:46,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {2740#true} call #t~ret24 := main(); {2740#true} is VALID [2018-11-14 18:39:46,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {2740#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {2740#true} is VALID [2018-11-14 18:39:46,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {2740#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2740#true} is VALID [2018-11-14 18:39:46,693 INFO L273 TraceCheckUtils]: 8: Hoare triple {2740#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2740#true} is VALID [2018-11-14 18:39:46,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {2740#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2740#true} is VALID [2018-11-14 18:39:46,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {2740#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2740#true} is VALID [2018-11-14 18:39:46,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,694 INFO L273 TraceCheckUtils]: 13: Hoare triple {2740#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {2740#true} is VALID [2018-11-14 18:39:46,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {2740#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {2740#true} is VALID [2018-11-14 18:39:46,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {2740#true} assume !(~a~0 < 100000); {2740#true} is VALID [2018-11-14 18:39:46,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {2740#true} havoc ~i~0;~i~0 := 0; {2740#true} is VALID [2018-11-14 18:39:46,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2740#true} is VALID [2018-11-14 18:39:46,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {2740#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 23: Hoare triple {2740#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 25: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2740#true} is VALID [2018-11-14 18:39:46,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {2740#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2740#true} is VALID [2018-11-14 18:39:46,697 INFO L273 TraceCheckUtils]: 30: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,697 INFO L273 TraceCheckUtils]: 31: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {2740#true} is VALID [2018-11-14 18:39:46,697 INFO L273 TraceCheckUtils]: 32: Hoare triple {2740#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {2740#true} is VALID [2018-11-14 18:39:46,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,697 INFO L273 TraceCheckUtils]: 34: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 18:39:46,697 INFO L273 TraceCheckUtils]: 35: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 36: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 37: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {2740#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 39: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {2740#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 18:39:46,699 INFO L273 TraceCheckUtils]: 44: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 18:39:46,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,699 INFO L273 TraceCheckUtils]: 46: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2740#true} is VALID [2018-11-14 18:39:46,699 INFO L273 TraceCheckUtils]: 47: Hoare triple {2740#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2740#true} is VALID [2018-11-14 18:39:46,699 INFO L273 TraceCheckUtils]: 48: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,699 INFO L273 TraceCheckUtils]: 49: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {2740#true} is VALID [2018-11-14 18:39:46,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {2740#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 51: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 53: Hoare triple {2740#true} ~i~0 := 0; {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 54: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {2740#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 57: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,700 INFO L273 TraceCheckUtils]: 58: Hoare triple {2740#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {2740#true} is VALID [2018-11-14 18:39:46,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {2740#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {2740#true} is VALID [2018-11-14 18:39:46,701 INFO L273 TraceCheckUtils]: 60: Hoare triple {2740#true} assume true; {2740#true} is VALID [2018-11-14 18:39:46,701 INFO L273 TraceCheckUtils]: 61: Hoare triple {2740#true} assume !(~i~0 < 100000); {2740#true} is VALID [2018-11-14 18:39:46,701 INFO L273 TraceCheckUtils]: 62: Hoare triple {2740#true} ~i~0 := 0; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:46,702 INFO L273 TraceCheckUtils]: 63: Hoare triple {2935#(<= main_~i~0 0)} assume true; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:46,702 INFO L273 TraceCheckUtils]: 64: Hoare triple {2935#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {2935#(<= main_~i~0 0)} is VALID [2018-11-14 18:39:46,703 INFO L273 TraceCheckUtils]: 65: Hoare triple {2935#(<= main_~i~0 0)} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {2945#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:46,703 INFO L273 TraceCheckUtils]: 66: Hoare triple {2945#(<= main_~i~0 1)} assume true; {2945#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:46,703 INFO L273 TraceCheckUtils]: 67: Hoare triple {2945#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {2945#(<= main_~i~0 1)} is VALID [2018-11-14 18:39:46,704 INFO L273 TraceCheckUtils]: 68: Hoare triple {2945#(<= main_~i~0 1)} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {2955#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:46,704 INFO L273 TraceCheckUtils]: 69: Hoare triple {2955#(<= main_~i~0 2)} assume true; {2955#(<= main_~i~0 2)} is VALID [2018-11-14 18:39:46,704 INFO L273 TraceCheckUtils]: 70: Hoare triple {2955#(<= main_~i~0 2)} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,705 INFO L273 TraceCheckUtils]: 73: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {2741#false} is VALID [2018-11-14 18:39:46,705 INFO L273 TraceCheckUtils]: 74: Hoare triple {2741#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {2741#false} is VALID [2018-11-14 18:39:46,706 INFO L273 TraceCheckUtils]: 75: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,706 INFO L273 TraceCheckUtils]: 76: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {2741#false} is VALID [2018-11-14 18:39:46,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {2741#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {2741#false} is VALID [2018-11-14 18:39:46,706 INFO L273 TraceCheckUtils]: 78: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,707 INFO L273 TraceCheckUtils]: 81: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,707 INFO L273 TraceCheckUtils]: 82: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {2741#false} is VALID [2018-11-14 18:39:46,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {2741#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2741#false} is VALID [2018-11-14 18:39:46,708 INFO L273 TraceCheckUtils]: 84: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,708 INFO L273 TraceCheckUtils]: 85: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {2741#false} is VALID [2018-11-14 18:39:46,708 INFO L273 TraceCheckUtils]: 86: Hoare triple {2741#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2741#false} is VALID [2018-11-14 18:39:46,708 INFO L273 TraceCheckUtils]: 87: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,708 INFO L273 TraceCheckUtils]: 88: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,709 INFO L273 TraceCheckUtils]: 89: Hoare triple {2741#false} ~i~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,709 INFO L273 TraceCheckUtils]: 90: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,709 INFO L273 TraceCheckUtils]: 91: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {2741#false} is VALID [2018-11-14 18:39:46,709 INFO L273 TraceCheckUtils]: 92: Hoare triple {2741#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {2741#false} is VALID [2018-11-14 18:39:46,709 INFO L273 TraceCheckUtils]: 93: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,709 INFO L273 TraceCheckUtils]: 94: Hoare triple {2741#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {2741#false} is VALID [2018-11-14 18:39:46,710 INFO L273 TraceCheckUtils]: 95: Hoare triple {2741#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {2741#false} is VALID [2018-11-14 18:39:46,710 INFO L273 TraceCheckUtils]: 96: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,710 INFO L273 TraceCheckUtils]: 97: Hoare triple {2741#false} assume !(~i~0 < 100000); {2741#false} is VALID [2018-11-14 18:39:46,710 INFO L273 TraceCheckUtils]: 98: Hoare triple {2741#false} havoc ~x~0;~x~0 := 0; {2741#false} is VALID [2018-11-14 18:39:46,710 INFO L273 TraceCheckUtils]: 99: Hoare triple {2741#false} assume true; {2741#false} is VALID [2018-11-14 18:39:46,711 INFO L273 TraceCheckUtils]: 100: Hoare triple {2741#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {2741#false} is VALID [2018-11-14 18:39:46,711 INFO L256 TraceCheckUtils]: 101: Hoare triple {2741#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {2741#false} is VALID [2018-11-14 18:39:46,711 INFO L273 TraceCheckUtils]: 102: Hoare triple {2741#false} ~cond := #in~cond; {2741#false} is VALID [2018-11-14 18:39:46,711 INFO L273 TraceCheckUtils]: 103: Hoare triple {2741#false} assume ~cond == 0; {2741#false} is VALID [2018-11-14 18:39:46,711 INFO L273 TraceCheckUtils]: 104: Hoare triple {2741#false} assume !false; {2741#false} is VALID [2018-11-14 18:39:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-14 18:39:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:46,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-14 18:39:46,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-14 18:39:46,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:46,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:39:47,054 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-14 18:39:47,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:39:47,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:39:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:39:47,055 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 9 states. [2018-11-14 18:39:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:48,032 INFO L93 Difference]: Finished difference Result 243 states and 272 transitions. [2018-11-14 18:39:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:39:48,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-11-14 18:39:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:39:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2018-11-14 18:39:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:39:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2018-11-14 18:39:48,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 227 transitions. [2018-11-14 18:39:48,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:39:48,312 INFO L225 Difference]: With dead ends: 243 [2018-11-14 18:39:48,312 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 18:39:48,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:39:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 18:39:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2018-11-14 18:39:48,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:48,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 140 states. [2018-11-14 18:39:48,367 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 140 states. [2018-11-14 18:39:48,367 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 140 states. [2018-11-14 18:39:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:48,372 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-14 18:39:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-14 18:39:48,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:48,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:48,373 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 150 states. [2018-11-14 18:39:48,373 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 150 states. [2018-11-14 18:39:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:48,378 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-11-14 18:39:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-11-14 18:39:48,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:48,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:48,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:48,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 18:39:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-11-14 18:39:48,384 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 105 [2018-11-14 18:39:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:48,384 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-11-14 18:39:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:39:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-11-14 18:39:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-14 18:39:48,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:48,386 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:48,386 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:48,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash -218217580, now seen corresponding path program 4 times [2018-11-14 18:39:48,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:48,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:48,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:48,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:48,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:48,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {3872#true} call ULTIMATE.init(); {3872#true} is VALID [2018-11-14 18:39:48,564 INFO L273 TraceCheckUtils]: 1: Hoare triple {3872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3872#true} is VALID [2018-11-14 18:39:48,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {3872#true} assume true; {3872#true} is VALID [2018-11-14 18:39:48,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3872#true} {3872#true} #186#return; {3872#true} is VALID [2018-11-14 18:39:48,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {3872#true} call #t~ret24 := main(); {3872#true} is VALID [2018-11-14 18:39:48,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {3872#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3874#(= main_~a~0 0)} is VALID [2018-11-14 18:39:48,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {3874#(= main_~a~0 0)} assume true; {3874#(= main_~a~0 0)} is VALID [2018-11-14 18:39:48,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {3874#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3874#(= main_~a~0 0)} is VALID [2018-11-14 18:39:48,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {3874#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:48,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {3875#(<= main_~a~0 1)} assume true; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:48,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {3875#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:48,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:48,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~a~0 2)} assume true; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:48,597 INFO L273 TraceCheckUtils]: 13: Hoare triple {3876#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:48,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {3876#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:48,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~a~0 3)} assume true; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:48,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {3877#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:48,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {3877#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 18:39:48,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {3878#(<= main_~a~0 4)} assume true; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 18:39:48,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {3878#(<= main_~a~0 4)} assume !(~a~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {3873#false} havoc ~i~0;~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3873#false} is VALID [2018-11-14 18:39:48,670 INFO L273 TraceCheckUtils]: 23: Hoare triple {3873#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3873#false} is VALID [2018-11-14 18:39:48,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,671 INFO L273 TraceCheckUtils]: 25: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3873#false} is VALID [2018-11-14 18:39:48,671 INFO L273 TraceCheckUtils]: 26: Hoare triple {3873#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3873#false} is VALID [2018-11-14 18:39:48,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,671 INFO L273 TraceCheckUtils]: 28: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3873#false} is VALID [2018-11-14 18:39:48,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {3873#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3873#false} is VALID [2018-11-14 18:39:48,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,672 INFO L273 TraceCheckUtils]: 31: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,672 INFO L273 TraceCheckUtils]: 32: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,672 INFO L273 TraceCheckUtils]: 33: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,672 INFO L273 TraceCheckUtils]: 34: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3873#false} is VALID [2018-11-14 18:39:48,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {3873#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3873#false} is VALID [2018-11-14 18:39:48,673 INFO L273 TraceCheckUtils]: 36: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,673 INFO L273 TraceCheckUtils]: 37: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3873#false} is VALID [2018-11-14 18:39:48,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {3873#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3873#false} is VALID [2018-11-14 18:39:48,673 INFO L273 TraceCheckUtils]: 39: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,673 INFO L273 TraceCheckUtils]: 40: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3873#false} is VALID [2018-11-14 18:39:48,674 INFO L273 TraceCheckUtils]: 41: Hoare triple {3873#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3873#false} is VALID [2018-11-14 18:39:48,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,674 INFO L273 TraceCheckUtils]: 43: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,674 INFO L273 TraceCheckUtils]: 44: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,675 INFO L273 TraceCheckUtils]: 45: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3873#false} is VALID [2018-11-14 18:39:48,675 INFO L273 TraceCheckUtils]: 47: Hoare triple {3873#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3873#false} is VALID [2018-11-14 18:39:48,675 INFO L273 TraceCheckUtils]: 48: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,675 INFO L273 TraceCheckUtils]: 49: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3873#false} is VALID [2018-11-14 18:39:48,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {3873#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3873#false} is VALID [2018-11-14 18:39:48,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,676 INFO L273 TraceCheckUtils]: 52: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3873#false} is VALID [2018-11-14 18:39:48,676 INFO L273 TraceCheckUtils]: 53: Hoare triple {3873#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3873#false} is VALID [2018-11-14 18:39:48,676 INFO L273 TraceCheckUtils]: 54: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,677 INFO L273 TraceCheckUtils]: 55: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,677 INFO L273 TraceCheckUtils]: 57: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,677 INFO L273 TraceCheckUtils]: 58: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3873#false} is VALID [2018-11-14 18:39:48,678 INFO L273 TraceCheckUtils]: 59: Hoare triple {3873#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3873#false} is VALID [2018-11-14 18:39:48,678 INFO L273 TraceCheckUtils]: 60: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,678 INFO L273 TraceCheckUtils]: 61: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3873#false} is VALID [2018-11-14 18:39:48,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {3873#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3873#false} is VALID [2018-11-14 18:39:48,678 INFO L273 TraceCheckUtils]: 63: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,679 INFO L273 TraceCheckUtils]: 64: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3873#false} is VALID [2018-11-14 18:39:48,679 INFO L273 TraceCheckUtils]: 65: Hoare triple {3873#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3873#false} is VALID [2018-11-14 18:39:48,679 INFO L273 TraceCheckUtils]: 66: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,679 INFO L273 TraceCheckUtils]: 67: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,680 INFO L273 TraceCheckUtils]: 69: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,680 INFO L273 TraceCheckUtils]: 70: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3873#false} is VALID [2018-11-14 18:39:48,680 INFO L273 TraceCheckUtils]: 71: Hoare triple {3873#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3873#false} is VALID [2018-11-14 18:39:48,680 INFO L273 TraceCheckUtils]: 72: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,681 INFO L273 TraceCheckUtils]: 73: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3873#false} is VALID [2018-11-14 18:39:48,681 INFO L273 TraceCheckUtils]: 74: Hoare triple {3873#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3873#false} is VALID [2018-11-14 18:39:48,681 INFO L273 TraceCheckUtils]: 75: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,681 INFO L273 TraceCheckUtils]: 76: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3873#false} is VALID [2018-11-14 18:39:48,681 INFO L273 TraceCheckUtils]: 77: Hoare triple {3873#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3873#false} is VALID [2018-11-14 18:39:48,682 INFO L273 TraceCheckUtils]: 78: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,682 INFO L273 TraceCheckUtils]: 79: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,682 INFO L273 TraceCheckUtils]: 80: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,682 INFO L273 TraceCheckUtils]: 81: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,682 INFO L273 TraceCheckUtils]: 82: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {3873#false} is VALID [2018-11-14 18:39:48,683 INFO L273 TraceCheckUtils]: 83: Hoare triple {3873#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {3873#false} is VALID [2018-11-14 18:39:48,683 INFO L273 TraceCheckUtils]: 84: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,683 INFO L273 TraceCheckUtils]: 85: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {3873#false} is VALID [2018-11-14 18:39:48,683 INFO L273 TraceCheckUtils]: 86: Hoare triple {3873#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {3873#false} is VALID [2018-11-14 18:39:48,683 INFO L273 TraceCheckUtils]: 87: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,684 INFO L273 TraceCheckUtils]: 88: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {3873#false} is VALID [2018-11-14 18:39:48,684 INFO L273 TraceCheckUtils]: 89: Hoare triple {3873#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {3873#false} is VALID [2018-11-14 18:39:48,684 INFO L273 TraceCheckUtils]: 90: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,684 INFO L273 TraceCheckUtils]: 91: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,685 INFO L273 TraceCheckUtils]: 92: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,685 INFO L273 TraceCheckUtils]: 93: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,685 INFO L273 TraceCheckUtils]: 94: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {3873#false} is VALID [2018-11-14 18:39:48,685 INFO L273 TraceCheckUtils]: 95: Hoare triple {3873#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {3873#false} is VALID [2018-11-14 18:39:48,685 INFO L273 TraceCheckUtils]: 96: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,686 INFO L273 TraceCheckUtils]: 97: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {3873#false} is VALID [2018-11-14 18:39:48,686 INFO L273 TraceCheckUtils]: 98: Hoare triple {3873#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {3873#false} is VALID [2018-11-14 18:39:48,686 INFO L273 TraceCheckUtils]: 99: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,686 INFO L273 TraceCheckUtils]: 100: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {3873#false} is VALID [2018-11-14 18:39:48,686 INFO L273 TraceCheckUtils]: 101: Hoare triple {3873#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {3873#false} is VALID [2018-11-14 18:39:48,687 INFO L273 TraceCheckUtils]: 102: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,687 INFO L273 TraceCheckUtils]: 103: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,687 INFO L273 TraceCheckUtils]: 104: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,687 INFO L273 TraceCheckUtils]: 105: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,688 INFO L273 TraceCheckUtils]: 106: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {3873#false} is VALID [2018-11-14 18:39:48,688 INFO L273 TraceCheckUtils]: 107: Hoare triple {3873#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3873#false} is VALID [2018-11-14 18:39:48,688 INFO L273 TraceCheckUtils]: 108: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,688 INFO L273 TraceCheckUtils]: 109: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {3873#false} is VALID [2018-11-14 18:39:48,688 INFO L273 TraceCheckUtils]: 110: Hoare triple {3873#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3873#false} is VALID [2018-11-14 18:39:48,689 INFO L273 TraceCheckUtils]: 111: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,689 INFO L273 TraceCheckUtils]: 112: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {3873#false} is VALID [2018-11-14 18:39:48,689 INFO L273 TraceCheckUtils]: 113: Hoare triple {3873#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3873#false} is VALID [2018-11-14 18:39:48,689 INFO L273 TraceCheckUtils]: 114: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,689 INFO L273 TraceCheckUtils]: 115: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,690 INFO L273 TraceCheckUtils]: 116: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,690 INFO L273 TraceCheckUtils]: 117: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,690 INFO L273 TraceCheckUtils]: 118: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {3873#false} is VALID [2018-11-14 18:39:48,690 INFO L273 TraceCheckUtils]: 119: Hoare triple {3873#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {3873#false} is VALID [2018-11-14 18:39:48,691 INFO L273 TraceCheckUtils]: 120: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,691 INFO L273 TraceCheckUtils]: 121: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {3873#false} is VALID [2018-11-14 18:39:48,691 INFO L273 TraceCheckUtils]: 122: Hoare triple {3873#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {3873#false} is VALID [2018-11-14 18:39:48,691 INFO L273 TraceCheckUtils]: 123: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,691 INFO L273 TraceCheckUtils]: 124: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {3873#false} is VALID [2018-11-14 18:39:48,692 INFO L273 TraceCheckUtils]: 125: Hoare triple {3873#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {3873#false} is VALID [2018-11-14 18:39:48,692 INFO L273 TraceCheckUtils]: 126: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,692 INFO L273 TraceCheckUtils]: 127: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:48,692 INFO L273 TraceCheckUtils]: 128: Hoare triple {3873#false} havoc ~x~0;~x~0 := 0; {3873#false} is VALID [2018-11-14 18:39:48,693 INFO L273 TraceCheckUtils]: 129: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:48,693 INFO L273 TraceCheckUtils]: 130: Hoare triple {3873#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {3873#false} is VALID [2018-11-14 18:39:48,693 INFO L256 TraceCheckUtils]: 131: Hoare triple {3873#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {3873#false} is VALID [2018-11-14 18:39:48,693 INFO L273 TraceCheckUtils]: 132: Hoare triple {3873#false} ~cond := #in~cond; {3873#false} is VALID [2018-11-14 18:39:48,694 INFO L273 TraceCheckUtils]: 133: Hoare triple {3873#false} assume ~cond == 0; {3873#false} is VALID [2018-11-14 18:39:48,694 INFO L273 TraceCheckUtils]: 134: Hoare triple {3873#false} assume !false; {3873#false} is VALID [2018-11-14 18:39:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 18:39:48,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:48,705 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-14 18:39:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:39:48,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:39:48,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:39:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:48,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:39:49,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {3872#true} call ULTIMATE.init(); {3872#true} is VALID [2018-11-14 18:39:49,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {3872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3872#true} is VALID [2018-11-14 18:39:49,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {3872#true} assume true; {3872#true} is VALID [2018-11-14 18:39:49,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3872#true} {3872#true} #186#return; {3872#true} is VALID [2018-11-14 18:39:49,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {3872#true} call #t~ret24 := main(); {3872#true} is VALID [2018-11-14 18:39:49,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {3872#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {3897#(<= main_~a~0 0)} is VALID [2018-11-14 18:39:49,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {3897#(<= main_~a~0 0)} assume true; {3897#(<= main_~a~0 0)} is VALID [2018-11-14 18:39:49,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {3897#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3897#(<= main_~a~0 0)} is VALID [2018-11-14 18:39:49,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {3897#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:49,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {3875#(<= main_~a~0 1)} assume true; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:49,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {3875#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3875#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:49,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {3875#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:49,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {3876#(<= main_~a~0 2)} assume true; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:49,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {3876#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3876#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:49,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {3876#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:49,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {3877#(<= main_~a~0 3)} assume true; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:49,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {3877#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {3877#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:49,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {3877#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 18:39:49,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {3878#(<= main_~a~0 4)} assume true; {3878#(<= main_~a~0 4)} is VALID [2018-11-14 18:39:49,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {3878#(<= main_~a~0 4)} assume !(~a~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {3873#false} havoc ~i~0;~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3873#false} is VALID [2018-11-14 18:39:49,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {3873#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3873#false} is VALID [2018-11-14 18:39:49,490 INFO L273 TraceCheckUtils]: 24: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3873#false} is VALID [2018-11-14 18:39:49,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {3873#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3873#false} is VALID [2018-11-14 18:39:49,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {3873#false} is VALID [2018-11-14 18:39:49,492 INFO L273 TraceCheckUtils]: 29: Hoare triple {3873#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3873#false} is VALID [2018-11-14 18:39:49,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,492 INFO L273 TraceCheckUtils]: 33: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3873#false} is VALID [2018-11-14 18:39:49,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {3873#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3873#false} is VALID [2018-11-14 18:39:49,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,493 INFO L273 TraceCheckUtils]: 37: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3873#false} is VALID [2018-11-14 18:39:49,493 INFO L273 TraceCheckUtils]: 38: Hoare triple {3873#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3873#false} is VALID [2018-11-14 18:39:49,493 INFO L273 TraceCheckUtils]: 39: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,494 INFO L273 TraceCheckUtils]: 40: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {3873#false} is VALID [2018-11-14 18:39:49,494 INFO L273 TraceCheckUtils]: 41: Hoare triple {3873#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {3873#false} is VALID [2018-11-14 18:39:49,494 INFO L273 TraceCheckUtils]: 42: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,494 INFO L273 TraceCheckUtils]: 43: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,495 INFO L273 TraceCheckUtils]: 45: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,495 INFO L273 TraceCheckUtils]: 46: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3873#false} is VALID [2018-11-14 18:39:49,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {3873#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3873#false} is VALID [2018-11-14 18:39:49,495 INFO L273 TraceCheckUtils]: 48: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,495 INFO L273 TraceCheckUtils]: 49: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3873#false} is VALID [2018-11-14 18:39:49,496 INFO L273 TraceCheckUtils]: 50: Hoare triple {3873#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3873#false} is VALID [2018-11-14 18:39:49,496 INFO L273 TraceCheckUtils]: 51: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,496 INFO L273 TraceCheckUtils]: 52: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {3873#false} is VALID [2018-11-14 18:39:49,496 INFO L273 TraceCheckUtils]: 53: Hoare triple {3873#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3873#false} is VALID [2018-11-14 18:39:49,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,496 INFO L273 TraceCheckUtils]: 55: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,497 INFO L273 TraceCheckUtils]: 56: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,497 INFO L273 TraceCheckUtils]: 57: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,497 INFO L273 TraceCheckUtils]: 58: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3873#false} is VALID [2018-11-14 18:39:49,497 INFO L273 TraceCheckUtils]: 59: Hoare triple {3873#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3873#false} is VALID [2018-11-14 18:39:49,497 INFO L273 TraceCheckUtils]: 60: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,498 INFO L273 TraceCheckUtils]: 61: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3873#false} is VALID [2018-11-14 18:39:49,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {3873#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3873#false} is VALID [2018-11-14 18:39:49,498 INFO L273 TraceCheckUtils]: 63: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,498 INFO L273 TraceCheckUtils]: 64: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {3873#false} is VALID [2018-11-14 18:39:49,498 INFO L273 TraceCheckUtils]: 65: Hoare triple {3873#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {3873#false} is VALID [2018-11-14 18:39:49,498 INFO L273 TraceCheckUtils]: 66: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,499 INFO L273 TraceCheckUtils]: 67: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,499 INFO L273 TraceCheckUtils]: 68: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,499 INFO L273 TraceCheckUtils]: 69: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,499 INFO L273 TraceCheckUtils]: 70: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3873#false} is VALID [2018-11-14 18:39:49,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {3873#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3873#false} is VALID [2018-11-14 18:39:49,500 INFO L273 TraceCheckUtils]: 72: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3873#false} is VALID [2018-11-14 18:39:49,500 INFO L273 TraceCheckUtils]: 74: Hoare triple {3873#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3873#false} is VALID [2018-11-14 18:39:49,500 INFO L273 TraceCheckUtils]: 75: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,500 INFO L273 TraceCheckUtils]: 76: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {3873#false} is VALID [2018-11-14 18:39:49,500 INFO L273 TraceCheckUtils]: 77: Hoare triple {3873#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {3873#false} is VALID [2018-11-14 18:39:49,501 INFO L273 TraceCheckUtils]: 78: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,501 INFO L273 TraceCheckUtils]: 79: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,501 INFO L273 TraceCheckUtils]: 80: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,501 INFO L273 TraceCheckUtils]: 81: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,501 INFO L273 TraceCheckUtils]: 82: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {3873#false} is VALID [2018-11-14 18:39:49,501 INFO L273 TraceCheckUtils]: 83: Hoare triple {3873#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {3873#false} is VALID [2018-11-14 18:39:49,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {3873#false} is VALID [2018-11-14 18:39:49,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {3873#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {3873#false} is VALID [2018-11-14 18:39:49,502 INFO L273 TraceCheckUtils]: 87: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,502 INFO L273 TraceCheckUtils]: 88: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {3873#false} is VALID [2018-11-14 18:39:49,502 INFO L273 TraceCheckUtils]: 89: Hoare triple {3873#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {3873#false} is VALID [2018-11-14 18:39:49,503 INFO L273 TraceCheckUtils]: 90: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,503 INFO L273 TraceCheckUtils]: 91: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,503 INFO L273 TraceCheckUtils]: 92: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,503 INFO L273 TraceCheckUtils]: 93: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,503 INFO L273 TraceCheckUtils]: 94: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {3873#false} is VALID [2018-11-14 18:39:49,504 INFO L273 TraceCheckUtils]: 95: Hoare triple {3873#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {3873#false} is VALID [2018-11-14 18:39:49,504 INFO L273 TraceCheckUtils]: 96: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,504 INFO L273 TraceCheckUtils]: 97: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {3873#false} is VALID [2018-11-14 18:39:49,504 INFO L273 TraceCheckUtils]: 98: Hoare triple {3873#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {3873#false} is VALID [2018-11-14 18:39:49,504 INFO L273 TraceCheckUtils]: 99: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,504 INFO L273 TraceCheckUtils]: 100: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {3873#false} is VALID [2018-11-14 18:39:49,505 INFO L273 TraceCheckUtils]: 101: Hoare triple {3873#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {3873#false} is VALID [2018-11-14 18:39:49,505 INFO L273 TraceCheckUtils]: 102: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,505 INFO L273 TraceCheckUtils]: 103: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,505 INFO L273 TraceCheckUtils]: 104: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,505 INFO L273 TraceCheckUtils]: 105: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,505 INFO L273 TraceCheckUtils]: 106: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {3873#false} is VALID [2018-11-14 18:39:49,506 INFO L273 TraceCheckUtils]: 107: Hoare triple {3873#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3873#false} is VALID [2018-11-14 18:39:49,506 INFO L273 TraceCheckUtils]: 108: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,506 INFO L273 TraceCheckUtils]: 109: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {3873#false} is VALID [2018-11-14 18:39:49,506 INFO L273 TraceCheckUtils]: 110: Hoare triple {3873#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3873#false} is VALID [2018-11-14 18:39:49,506 INFO L273 TraceCheckUtils]: 111: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,507 INFO L273 TraceCheckUtils]: 112: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {3873#false} is VALID [2018-11-14 18:39:49,507 INFO L273 TraceCheckUtils]: 113: Hoare triple {3873#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3873#false} is VALID [2018-11-14 18:39:49,507 INFO L273 TraceCheckUtils]: 114: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,507 INFO L273 TraceCheckUtils]: 115: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,507 INFO L273 TraceCheckUtils]: 116: Hoare triple {3873#false} ~i~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,507 INFO L273 TraceCheckUtils]: 117: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,508 INFO L273 TraceCheckUtils]: 118: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {3873#false} is VALID [2018-11-14 18:39:49,508 INFO L273 TraceCheckUtils]: 119: Hoare triple {3873#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {3873#false} is VALID [2018-11-14 18:39:49,508 INFO L273 TraceCheckUtils]: 120: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,508 INFO L273 TraceCheckUtils]: 121: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {3873#false} is VALID [2018-11-14 18:39:49,508 INFO L273 TraceCheckUtils]: 122: Hoare triple {3873#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {3873#false} is VALID [2018-11-14 18:39:49,508 INFO L273 TraceCheckUtils]: 123: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,509 INFO L273 TraceCheckUtils]: 124: Hoare triple {3873#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {3873#false} is VALID [2018-11-14 18:39:49,509 INFO L273 TraceCheckUtils]: 125: Hoare triple {3873#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {3873#false} is VALID [2018-11-14 18:39:49,509 INFO L273 TraceCheckUtils]: 126: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,509 INFO L273 TraceCheckUtils]: 127: Hoare triple {3873#false} assume !(~i~0 < 100000); {3873#false} is VALID [2018-11-14 18:39:49,509 INFO L273 TraceCheckUtils]: 128: Hoare triple {3873#false} havoc ~x~0;~x~0 := 0; {3873#false} is VALID [2018-11-14 18:39:49,510 INFO L273 TraceCheckUtils]: 129: Hoare triple {3873#false} assume true; {3873#false} is VALID [2018-11-14 18:39:49,510 INFO L273 TraceCheckUtils]: 130: Hoare triple {3873#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {3873#false} is VALID [2018-11-14 18:39:49,510 INFO L256 TraceCheckUtils]: 131: Hoare triple {3873#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {3873#false} is VALID [2018-11-14 18:39:49,510 INFO L273 TraceCheckUtils]: 132: Hoare triple {3873#false} ~cond := #in~cond; {3873#false} is VALID [2018-11-14 18:39:49,510 INFO L273 TraceCheckUtils]: 133: Hoare triple {3873#false} assume ~cond == 0; {3873#false} is VALID [2018-11-14 18:39:49,510 INFO L273 TraceCheckUtils]: 134: Hoare triple {3873#false} assume !false; {3873#false} is VALID [2018-11-14 18:39:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 18:39:49,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:39:49,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:39:49,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2018-11-14 18:39:49,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:39:49,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:39:49,788 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-14 18:39:49,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:39:49,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:39:49,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:39:49,789 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 8 states. [2018-11-14 18:39:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:50,252 INFO L93 Difference]: Finished difference Result 264 states and 284 transitions. [2018-11-14 18:39:50,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:39:50,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2018-11-14 18:39:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:39:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:39:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2018-11-14 18:39:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:39:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2018-11-14 18:39:50,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 140 transitions. [2018-11-14 18:39:50,390 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-14 18:39:50,394 INFO L225 Difference]: With dead ends: 264 [2018-11-14 18:39:50,394 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 18:39:50,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:39:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 18:39:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-11-14 18:39:51,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:39:51,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 143 states. [2018-11-14 18:39:51,381 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 143 states. [2018-11-14 18:39:51,382 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 143 states. [2018-11-14 18:39:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:51,386 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-14 18:39:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-14 18:39:51,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:51,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:51,387 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 144 states. [2018-11-14 18:39:51,387 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 144 states. [2018-11-14 18:39:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:39:51,391 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-14 18:39:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-11-14 18:39:51,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:39:51,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:39:51,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:39:51,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:39:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-14 18:39:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-11-14 18:39:51,396 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 135 [2018-11-14 18:39:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:39:51,397 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-11-14 18:39:51,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:39:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-11-14 18:39:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-14 18:39:51,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:39:51,398 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:39:51,398 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:39:51,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:39:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1078731425, now seen corresponding path program 5 times [2018-11-14 18:39:51,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:39:51,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:39:51,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:51,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:39:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:39:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:39:51,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {5116#true} call ULTIMATE.init(); {5116#true} is VALID [2018-11-14 18:39:51,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {5116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5116#true} is VALID [2018-11-14 18:39:51,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:39:51,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5116#true} {5116#true} #186#return; {5116#true} is VALID [2018-11-14 18:39:51,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {5116#true} call #t~ret24 := main(); {5116#true} is VALID [2018-11-14 18:39:51,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {5116#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5118#(= main_~a~0 0)} is VALID [2018-11-14 18:39:51,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {5118#(= main_~a~0 0)} assume true; {5118#(= main_~a~0 0)} is VALID [2018-11-14 18:39:51,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {5118#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5118#(= main_~a~0 0)} is VALID [2018-11-14 18:39:51,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {5118#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5119#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:51,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {5119#(<= main_~a~0 1)} assume true; {5119#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:51,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {5119#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5119#(<= main_~a~0 1)} is VALID [2018-11-14 18:39:51,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {5119#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5120#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:51,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {5120#(<= main_~a~0 2)} assume true; {5120#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:51,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {5120#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5120#(<= main_~a~0 2)} is VALID [2018-11-14 18:39:51,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {5120#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5121#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:51,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {5121#(<= main_~a~0 3)} assume true; {5121#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:51,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {5121#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5121#(<= main_~a~0 3)} is VALID [2018-11-14 18:39:51,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {5121#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5122#(<= main_~a~0 4)} is VALID [2018-11-14 18:39:51,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {5122#(<= main_~a~0 4)} assume true; {5122#(<= main_~a~0 4)} is VALID [2018-11-14 18:39:51,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {5122#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5122#(<= main_~a~0 4)} is VALID [2018-11-14 18:39:51,789 INFO L273 TraceCheckUtils]: 20: Hoare triple {5122#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5123#(<= main_~a~0 5)} is VALID [2018-11-14 18:39:51,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {5123#(<= main_~a~0 5)} assume true; {5123#(<= main_~a~0 5)} is VALID [2018-11-14 18:39:51,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {5123#(<= main_~a~0 5)} assume !(~a~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {5117#false} havoc ~i~0;~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,791 INFO L273 TraceCheckUtils]: 25: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5117#false} is VALID [2018-11-14 18:39:51,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {5117#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5117#false} is VALID [2018-11-14 18:39:51,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5117#false} is VALID [2018-11-14 18:39:51,792 INFO L273 TraceCheckUtils]: 29: Hoare triple {5117#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5117#false} is VALID [2018-11-14 18:39:51,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5117#false} is VALID [2018-11-14 18:39:51,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {5117#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5117#false} is VALID [2018-11-14 18:39:51,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,794 INFO L273 TraceCheckUtils]: 35: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,795 INFO L273 TraceCheckUtils]: 37: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5117#false} is VALID [2018-11-14 18:39:51,795 INFO L273 TraceCheckUtils]: 38: Hoare triple {5117#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5117#false} is VALID [2018-11-14 18:39:51,795 INFO L273 TraceCheckUtils]: 39: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,795 INFO L273 TraceCheckUtils]: 40: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5117#false} is VALID [2018-11-14 18:39:51,795 INFO L273 TraceCheckUtils]: 41: Hoare triple {5117#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5117#false} is VALID [2018-11-14 18:39:51,796 INFO L273 TraceCheckUtils]: 42: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,796 INFO L273 TraceCheckUtils]: 43: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5117#false} is VALID [2018-11-14 18:39:51,796 INFO L273 TraceCheckUtils]: 44: Hoare triple {5117#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5117#false} is VALID [2018-11-14 18:39:51,796 INFO L273 TraceCheckUtils]: 45: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,796 INFO L273 TraceCheckUtils]: 46: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,796 INFO L273 TraceCheckUtils]: 47: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,797 INFO L273 TraceCheckUtils]: 48: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,797 INFO L273 TraceCheckUtils]: 49: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5117#false} is VALID [2018-11-14 18:39:51,797 INFO L273 TraceCheckUtils]: 50: Hoare triple {5117#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5117#false} is VALID [2018-11-14 18:39:51,797 INFO L273 TraceCheckUtils]: 51: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5117#false} is VALID [2018-11-14 18:39:51,797 INFO L273 TraceCheckUtils]: 53: Hoare triple {5117#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5117#false} is VALID [2018-11-14 18:39:51,798 INFO L273 TraceCheckUtils]: 54: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,798 INFO L273 TraceCheckUtils]: 55: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5117#false} is VALID [2018-11-14 18:39:51,798 INFO L273 TraceCheckUtils]: 56: Hoare triple {5117#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5117#false} is VALID [2018-11-14 18:39:51,798 INFO L273 TraceCheckUtils]: 57: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,798 INFO L273 TraceCheckUtils]: 58: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,798 INFO L273 TraceCheckUtils]: 59: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,798 INFO L273 TraceCheckUtils]: 60: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 61: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 62: Hoare triple {5117#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 64: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 65: Hoare triple {5117#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 66: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 67: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 68: Hoare triple {5117#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5117#false} is VALID [2018-11-14 18:39:51,799 INFO L273 TraceCheckUtils]: 69: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 70: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 71: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 72: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 73: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 74: Hoare triple {5117#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 75: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 76: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5117#false} is VALID [2018-11-14 18:39:51,800 INFO L273 TraceCheckUtils]: 77: Hoare triple {5117#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 78: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 79: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 80: Hoare triple {5117#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 81: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 82: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 83: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 84: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,801 INFO L273 TraceCheckUtils]: 85: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 86: Hoare triple {5117#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 87: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 88: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 89: Hoare triple {5117#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 90: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 91: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 92: Hoare triple {5117#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {5117#false} is VALID [2018-11-14 18:39:51,802 INFO L273 TraceCheckUtils]: 93: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,803 INFO L273 TraceCheckUtils]: 94: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,803 INFO L273 TraceCheckUtils]: 95: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,803 INFO L273 TraceCheckUtils]: 96: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,803 INFO L273 TraceCheckUtils]: 97: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {5117#false} is VALID [2018-11-14 18:39:51,803 INFO L273 TraceCheckUtils]: 98: Hoare triple {5117#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {5117#false} is VALID [2018-11-14 18:39:51,803 INFO L273 TraceCheckUtils]: 99: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,803 INFO L273 TraceCheckUtils]: 100: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {5117#false} is VALID [2018-11-14 18:39:51,804 INFO L273 TraceCheckUtils]: 101: Hoare triple {5117#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {5117#false} is VALID [2018-11-14 18:39:51,804 INFO L273 TraceCheckUtils]: 102: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,804 INFO L273 TraceCheckUtils]: 103: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {5117#false} is VALID [2018-11-14 18:39:51,804 INFO L273 TraceCheckUtils]: 104: Hoare triple {5117#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {5117#false} is VALID [2018-11-14 18:39:51,804 INFO L273 TraceCheckUtils]: 105: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,804 INFO L273 TraceCheckUtils]: 106: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,805 INFO L273 TraceCheckUtils]: 107: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,805 INFO L273 TraceCheckUtils]: 108: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,805 INFO L273 TraceCheckUtils]: 109: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {5117#false} is VALID [2018-11-14 18:39:51,805 INFO L273 TraceCheckUtils]: 110: Hoare triple {5117#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {5117#false} is VALID [2018-11-14 18:39:51,805 INFO L273 TraceCheckUtils]: 111: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,805 INFO L273 TraceCheckUtils]: 112: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {5117#false} is VALID [2018-11-14 18:39:51,806 INFO L273 TraceCheckUtils]: 113: Hoare triple {5117#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {5117#false} is VALID [2018-11-14 18:39:51,806 INFO L273 TraceCheckUtils]: 114: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,806 INFO L273 TraceCheckUtils]: 115: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {5117#false} is VALID [2018-11-14 18:39:51,806 INFO L273 TraceCheckUtils]: 116: Hoare triple {5117#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {5117#false} is VALID [2018-11-14 18:39:51,806 INFO L273 TraceCheckUtils]: 117: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,807 INFO L273 TraceCheckUtils]: 118: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,807 INFO L273 TraceCheckUtils]: 119: Hoare triple {5117#false} ~i~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,807 INFO L273 TraceCheckUtils]: 120: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,807 INFO L273 TraceCheckUtils]: 121: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {5117#false} is VALID [2018-11-14 18:39:51,807 INFO L273 TraceCheckUtils]: 122: Hoare triple {5117#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {5117#false} is VALID [2018-11-14 18:39:51,807 INFO L273 TraceCheckUtils]: 123: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,808 INFO L273 TraceCheckUtils]: 124: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {5117#false} is VALID [2018-11-14 18:39:51,808 INFO L273 TraceCheckUtils]: 125: Hoare triple {5117#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {5117#false} is VALID [2018-11-14 18:39:51,808 INFO L273 TraceCheckUtils]: 126: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,808 INFO L273 TraceCheckUtils]: 127: Hoare triple {5117#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {5117#false} is VALID [2018-11-14 18:39:51,808 INFO L273 TraceCheckUtils]: 128: Hoare triple {5117#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {5117#false} is VALID [2018-11-14 18:39:51,808 INFO L273 TraceCheckUtils]: 129: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,809 INFO L273 TraceCheckUtils]: 130: Hoare triple {5117#false} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:39:51,809 INFO L273 TraceCheckUtils]: 131: Hoare triple {5117#false} havoc ~x~0;~x~0 := 0; {5117#false} is VALID [2018-11-14 18:39:51,809 INFO L273 TraceCheckUtils]: 132: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:39:51,809 INFO L273 TraceCheckUtils]: 133: Hoare triple {5117#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {5117#false} is VALID [2018-11-14 18:39:51,809 INFO L256 TraceCheckUtils]: 134: Hoare triple {5117#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {5117#false} is VALID [2018-11-14 18:39:51,809 INFO L273 TraceCheckUtils]: 135: Hoare triple {5117#false} ~cond := #in~cond; {5117#false} is VALID [2018-11-14 18:39:51,810 INFO L273 TraceCheckUtils]: 136: Hoare triple {5117#false} assume ~cond == 0; {5117#false} is VALID [2018-11-14 18:39:51,810 INFO L273 TraceCheckUtils]: 137: Hoare triple {5117#false} assume !false; {5117#false} is VALID [2018-11-14 18:39:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-11-14 18:39:51,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:39:51,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:39:51,835 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:40:16,291 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:40:16,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:16,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:16,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {5116#true} call ULTIMATE.init(); {5116#true} is VALID [2018-11-14 18:40:16,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {5116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5116#true} is VALID [2018-11-14 18:40:16,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5116#true} {5116#true} #186#return; {5116#true} is VALID [2018-11-14 18:40:16,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {5116#true} call #t~ret24 := main(); {5116#true} is VALID [2018-11-14 18:40:16,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {5116#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5116#true} is VALID [2018-11-14 18:40:16,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 18:40:16,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5116#true} is VALID [2018-11-14 18:40:16,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 18:40:16,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5116#true} is VALID [2018-11-14 18:40:16,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 18:40:16,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5116#true} is VALID [2018-11-14 18:40:16,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 18:40:16,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,508 INFO L273 TraceCheckUtils]: 19: Hoare triple {5116#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {5116#true} is VALID [2018-11-14 18:40:16,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {5116#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {5116#true} is VALID [2018-11-14 18:40:16,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,508 INFO L273 TraceCheckUtils]: 22: Hoare triple {5116#true} assume !(~a~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {5116#true} havoc ~i~0;~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,509 INFO L273 TraceCheckUtils]: 25: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5116#true} is VALID [2018-11-14 18:40:16,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {5116#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5116#true} is VALID [2018-11-14 18:40:16,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5116#true} is VALID [2018-11-14 18:40:16,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {5116#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5116#true} is VALID [2018-11-14 18:40:16,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {5116#true} is VALID [2018-11-14 18:40:16,510 INFO L273 TraceCheckUtils]: 32: Hoare triple {5116#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5116#true} is VALID [2018-11-14 18:40:16,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,511 INFO L273 TraceCheckUtils]: 35: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,511 INFO L273 TraceCheckUtils]: 37: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5116#true} is VALID [2018-11-14 18:40:16,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {5116#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5116#true} is VALID [2018-11-14 18:40:16,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5116#true} is VALID [2018-11-14 18:40:16,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {5116#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5116#true} is VALID [2018-11-14 18:40:16,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {5116#true} is VALID [2018-11-14 18:40:16,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {5116#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {5116#true} is VALID [2018-11-14 18:40:16,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,512 INFO L273 TraceCheckUtils]: 46: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,513 INFO L273 TraceCheckUtils]: 47: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,513 INFO L273 TraceCheckUtils]: 48: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,513 INFO L273 TraceCheckUtils]: 49: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5116#true} is VALID [2018-11-14 18:40:16,513 INFO L273 TraceCheckUtils]: 50: Hoare triple {5116#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5116#true} is VALID [2018-11-14 18:40:16,513 INFO L273 TraceCheckUtils]: 51: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5116#true} is VALID [2018-11-14 18:40:16,514 INFO L273 TraceCheckUtils]: 53: Hoare triple {5116#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5116#true} is VALID [2018-11-14 18:40:16,514 INFO L273 TraceCheckUtils]: 54: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {5116#true} is VALID [2018-11-14 18:40:16,514 INFO L273 TraceCheckUtils]: 56: Hoare triple {5116#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {5116#true} is VALID [2018-11-14 18:40:16,514 INFO L273 TraceCheckUtils]: 57: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,514 INFO L273 TraceCheckUtils]: 58: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,515 INFO L273 TraceCheckUtils]: 60: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,515 INFO L273 TraceCheckUtils]: 61: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5116#true} is VALID [2018-11-14 18:40:16,515 INFO L273 TraceCheckUtils]: 62: Hoare triple {5116#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5116#true} is VALID [2018-11-14 18:40:16,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5116#true} is VALID [2018-11-14 18:40:16,515 INFO L273 TraceCheckUtils]: 65: Hoare triple {5116#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5116#true} is VALID [2018-11-14 18:40:16,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,516 INFO L273 TraceCheckUtils]: 67: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {5116#true} is VALID [2018-11-14 18:40:16,516 INFO L273 TraceCheckUtils]: 68: Hoare triple {5116#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {5116#true} is VALID [2018-11-14 18:40:16,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,516 INFO L273 TraceCheckUtils]: 71: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,516 INFO L273 TraceCheckUtils]: 72: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,517 INFO L273 TraceCheckUtils]: 73: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5116#true} is VALID [2018-11-14 18:40:16,517 INFO L273 TraceCheckUtils]: 74: Hoare triple {5116#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5116#true} is VALID [2018-11-14 18:40:16,517 INFO L273 TraceCheckUtils]: 75: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,517 INFO L273 TraceCheckUtils]: 76: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5116#true} is VALID [2018-11-14 18:40:16,517 INFO L273 TraceCheckUtils]: 77: Hoare triple {5116#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5116#true} is VALID [2018-11-14 18:40:16,517 INFO L273 TraceCheckUtils]: 78: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,518 INFO L273 TraceCheckUtils]: 79: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {5116#true} is VALID [2018-11-14 18:40:16,518 INFO L273 TraceCheckUtils]: 80: Hoare triple {5116#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {5116#true} is VALID [2018-11-14 18:40:16,518 INFO L273 TraceCheckUtils]: 81: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,518 INFO L273 TraceCheckUtils]: 82: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,518 INFO L273 TraceCheckUtils]: 83: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,518 INFO L273 TraceCheckUtils]: 84: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,518 INFO L273 TraceCheckUtils]: 85: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {5116#true} is VALID [2018-11-14 18:40:16,519 INFO L273 TraceCheckUtils]: 86: Hoare triple {5116#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {5116#true} is VALID [2018-11-14 18:40:16,519 INFO L273 TraceCheckUtils]: 87: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,519 INFO L273 TraceCheckUtils]: 88: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {5116#true} is VALID [2018-11-14 18:40:16,519 INFO L273 TraceCheckUtils]: 89: Hoare triple {5116#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {5116#true} is VALID [2018-11-14 18:40:16,519 INFO L273 TraceCheckUtils]: 90: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,519 INFO L273 TraceCheckUtils]: 91: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {5116#true} is VALID [2018-11-14 18:40:16,520 INFO L273 TraceCheckUtils]: 92: Hoare triple {5116#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {5116#true} is VALID [2018-11-14 18:40:16,520 INFO L273 TraceCheckUtils]: 93: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,520 INFO L273 TraceCheckUtils]: 94: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,520 INFO L273 TraceCheckUtils]: 95: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,520 INFO L273 TraceCheckUtils]: 96: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,520 INFO L273 TraceCheckUtils]: 97: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {5116#true} is VALID [2018-11-14 18:40:16,520 INFO L273 TraceCheckUtils]: 98: Hoare triple {5116#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {5116#true} is VALID [2018-11-14 18:40:16,521 INFO L273 TraceCheckUtils]: 99: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,521 INFO L273 TraceCheckUtils]: 100: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {5116#true} is VALID [2018-11-14 18:40:16,521 INFO L273 TraceCheckUtils]: 101: Hoare triple {5116#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {5116#true} is VALID [2018-11-14 18:40:16,521 INFO L273 TraceCheckUtils]: 102: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,521 INFO L273 TraceCheckUtils]: 103: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {5116#true} is VALID [2018-11-14 18:40:16,521 INFO L273 TraceCheckUtils]: 104: Hoare triple {5116#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {5116#true} is VALID [2018-11-14 18:40:16,522 INFO L273 TraceCheckUtils]: 105: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,522 INFO L273 TraceCheckUtils]: 106: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,522 INFO L273 TraceCheckUtils]: 107: Hoare triple {5116#true} ~i~0 := 0; {5116#true} is VALID [2018-11-14 18:40:16,522 INFO L273 TraceCheckUtils]: 108: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,522 INFO L273 TraceCheckUtils]: 109: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {5116#true} is VALID [2018-11-14 18:40:16,522 INFO L273 TraceCheckUtils]: 110: Hoare triple {5116#true} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {5116#true} is VALID [2018-11-14 18:40:16,522 INFO L273 TraceCheckUtils]: 111: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,523 INFO L273 TraceCheckUtils]: 112: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {5116#true} is VALID [2018-11-14 18:40:16,523 INFO L273 TraceCheckUtils]: 113: Hoare triple {5116#true} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {5116#true} is VALID [2018-11-14 18:40:16,523 INFO L273 TraceCheckUtils]: 114: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,523 INFO L273 TraceCheckUtils]: 115: Hoare triple {5116#true} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {5116#true} is VALID [2018-11-14 18:40:16,523 INFO L273 TraceCheckUtils]: 116: Hoare triple {5116#true} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {5116#true} is VALID [2018-11-14 18:40:16,523 INFO L273 TraceCheckUtils]: 117: Hoare triple {5116#true} assume true; {5116#true} is VALID [2018-11-14 18:40:16,524 INFO L273 TraceCheckUtils]: 118: Hoare triple {5116#true} assume !(~i~0 < 100000); {5116#true} is VALID [2018-11-14 18:40:16,524 INFO L273 TraceCheckUtils]: 119: Hoare triple {5116#true} ~i~0 := 0; {5484#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:16,525 INFO L273 TraceCheckUtils]: 120: Hoare triple {5484#(<= main_~i~0 0)} assume true; {5484#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:16,525 INFO L273 TraceCheckUtils]: 121: Hoare triple {5484#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {5484#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:16,527 INFO L273 TraceCheckUtils]: 122: Hoare triple {5484#(<= main_~i~0 0)} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {5494#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:16,527 INFO L273 TraceCheckUtils]: 123: Hoare triple {5494#(<= main_~i~0 1)} assume true; {5494#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:16,529 INFO L273 TraceCheckUtils]: 124: Hoare triple {5494#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {5494#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:16,529 INFO L273 TraceCheckUtils]: 125: Hoare triple {5494#(<= main_~i~0 1)} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {5504#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:16,531 INFO L273 TraceCheckUtils]: 126: Hoare triple {5504#(<= main_~i~0 2)} assume true; {5504#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:16,531 INFO L273 TraceCheckUtils]: 127: Hoare triple {5504#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {5504#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:16,533 INFO L273 TraceCheckUtils]: 128: Hoare triple {5504#(<= main_~i~0 2)} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {5514#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:16,533 INFO L273 TraceCheckUtils]: 129: Hoare triple {5514#(<= main_~i~0 3)} assume true; {5514#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:16,535 INFO L273 TraceCheckUtils]: 130: Hoare triple {5514#(<= main_~i~0 3)} assume !(~i~0 < 100000); {5117#false} is VALID [2018-11-14 18:40:16,535 INFO L273 TraceCheckUtils]: 131: Hoare triple {5117#false} havoc ~x~0;~x~0 := 0; {5117#false} is VALID [2018-11-14 18:40:16,535 INFO L273 TraceCheckUtils]: 132: Hoare triple {5117#false} assume true; {5117#false} is VALID [2018-11-14 18:40:16,535 INFO L273 TraceCheckUtils]: 133: Hoare triple {5117#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {5117#false} is VALID [2018-11-14 18:40:16,535 INFO L256 TraceCheckUtils]: 134: Hoare triple {5117#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {5117#false} is VALID [2018-11-14 18:40:16,535 INFO L273 TraceCheckUtils]: 135: Hoare triple {5117#false} ~cond := #in~cond; {5117#false} is VALID [2018-11-14 18:40:16,536 INFO L273 TraceCheckUtils]: 136: Hoare triple {5117#false} assume ~cond == 0; {5117#false} is VALID [2018-11-14 18:40:16,536 INFO L273 TraceCheckUtils]: 137: Hoare triple {5117#false} assume !false; {5117#false} is VALID [2018-11-14 18:40:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-11-14 18:40:16,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:16,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-14 18:40:16,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 138 [2018-11-14 18:40:16,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:16,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:40:16,717 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-14 18:40:16,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:40:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:40:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:40:16,719 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 12 states. [2018-11-14 18:40:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:17,722 INFO L93 Difference]: Finished difference Result 303 states and 332 transitions. [2018-11-14 18:40:17,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:40:17,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 138 [2018-11-14 18:40:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:40:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2018-11-14 18:40:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:40:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2018-11-14 18:40:17,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 260 transitions. [2018-11-14 18:40:17,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:17,994 INFO L225 Difference]: With dead ends: 303 [2018-11-14 18:40:17,994 INFO L226 Difference]: Without dead ends: 183 [2018-11-14 18:40:17,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:40:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-14 18:40:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2018-11-14 18:40:18,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:18,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 173 states. [2018-11-14 18:40:18,054 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 173 states. [2018-11-14 18:40:18,054 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 173 states. [2018-11-14 18:40:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:18,062 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2018-11-14 18:40:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-11-14 18:40:18,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:18,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:18,063 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 183 states. [2018-11-14 18:40:18,063 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 183 states. [2018-11-14 18:40:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:18,069 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2018-11-14 18:40:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-11-14 18:40:18,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:18,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:18,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:18,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-14 18:40:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-11-14 18:40:18,075 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 138 [2018-11-14 18:40:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:18,076 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-11-14 18:40:18,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:40:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-11-14 18:40:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-14 18:40:18,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:18,078 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:18,078 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:18,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1275571858, now seen corresponding path program 6 times [2018-11-14 18:40:18,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:18,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:18,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:18,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {6540#true} call ULTIMATE.init(); {6540#true} is VALID [2018-11-14 18:40:18,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {6540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6540#true} is VALID [2018-11-14 18:40:18,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:18,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6540#true} {6540#true} #186#return; {6540#true} is VALID [2018-11-14 18:40:18,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {6540#true} call #t~ret24 := main(); {6540#true} is VALID [2018-11-14 18:40:18,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {6540#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6542#(= main_~a~0 0)} is VALID [2018-11-14 18:40:18,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {6542#(= main_~a~0 0)} assume true; {6542#(= main_~a~0 0)} is VALID [2018-11-14 18:40:18,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {6542#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6542#(= main_~a~0 0)} is VALID [2018-11-14 18:40:18,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {6542#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6543#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:18,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {6543#(<= main_~a~0 1)} assume true; {6543#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:18,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {6543#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6543#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:18,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {6543#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6544#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:18,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {6544#(<= main_~a~0 2)} assume true; {6544#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:18,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {6544#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6544#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:18,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {6544#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6545#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:18,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {6545#(<= main_~a~0 3)} assume true; {6545#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:18,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {6545#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6545#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:18,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {6545#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6546#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:18,280 INFO L273 TraceCheckUtils]: 18: Hoare triple {6546#(<= main_~a~0 4)} assume true; {6546#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:18,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {6546#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6546#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:18,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {6546#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6547#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:18,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {6547#(<= main_~a~0 5)} assume true; {6547#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:18,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {6547#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6547#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:18,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {6547#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6548#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:18,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {6548#(<= main_~a~0 6)} assume true; {6548#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:18,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {6548#(<= main_~a~0 6)} assume !(~a~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {6541#false} havoc ~i~0;~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,285 INFO L273 TraceCheckUtils]: 27: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,285 INFO L273 TraceCheckUtils]: 28: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6541#false} is VALID [2018-11-14 18:40:18,285 INFO L273 TraceCheckUtils]: 29: Hoare triple {6541#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6541#false} is VALID [2018-11-14 18:40:18,286 INFO L273 TraceCheckUtils]: 30: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,286 INFO L273 TraceCheckUtils]: 31: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6541#false} is VALID [2018-11-14 18:40:18,286 INFO L273 TraceCheckUtils]: 32: Hoare triple {6541#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6541#false} is VALID [2018-11-14 18:40:18,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6541#false} is VALID [2018-11-14 18:40:18,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {6541#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6541#false} is VALID [2018-11-14 18:40:18,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,287 INFO L273 TraceCheckUtils]: 37: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6541#false} is VALID [2018-11-14 18:40:18,287 INFO L273 TraceCheckUtils]: 38: Hoare triple {6541#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6541#false} is VALID [2018-11-14 18:40:18,287 INFO L273 TraceCheckUtils]: 39: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,288 INFO L273 TraceCheckUtils]: 40: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,288 INFO L273 TraceCheckUtils]: 41: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,288 INFO L273 TraceCheckUtils]: 42: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,288 INFO L273 TraceCheckUtils]: 43: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6541#false} is VALID [2018-11-14 18:40:18,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {6541#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6541#false} is VALID [2018-11-14 18:40:18,289 INFO L273 TraceCheckUtils]: 45: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,289 INFO L273 TraceCheckUtils]: 46: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6541#false} is VALID [2018-11-14 18:40:18,289 INFO L273 TraceCheckUtils]: 47: Hoare triple {6541#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6541#false} is VALID [2018-11-14 18:40:18,289 INFO L273 TraceCheckUtils]: 48: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,289 INFO L273 TraceCheckUtils]: 49: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6541#false} is VALID [2018-11-14 18:40:18,290 INFO L273 TraceCheckUtils]: 50: Hoare triple {6541#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6541#false} is VALID [2018-11-14 18:40:18,290 INFO L273 TraceCheckUtils]: 51: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,290 INFO L273 TraceCheckUtils]: 52: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6541#false} is VALID [2018-11-14 18:40:18,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {6541#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6541#false} is VALID [2018-11-14 18:40:18,290 INFO L273 TraceCheckUtils]: 54: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,290 INFO L273 TraceCheckUtils]: 55: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,291 INFO L273 TraceCheckUtils]: 57: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6541#false} is VALID [2018-11-14 18:40:18,291 INFO L273 TraceCheckUtils]: 59: Hoare triple {6541#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6541#false} is VALID [2018-11-14 18:40:18,291 INFO L273 TraceCheckUtils]: 60: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,291 INFO L273 TraceCheckUtils]: 61: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6541#false} is VALID [2018-11-14 18:40:18,292 INFO L273 TraceCheckUtils]: 62: Hoare triple {6541#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6541#false} is VALID [2018-11-14 18:40:18,292 INFO L273 TraceCheckUtils]: 63: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,292 INFO L273 TraceCheckUtils]: 64: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6541#false} is VALID [2018-11-14 18:40:18,292 INFO L273 TraceCheckUtils]: 65: Hoare triple {6541#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6541#false} is VALID [2018-11-14 18:40:18,292 INFO L273 TraceCheckUtils]: 66: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,292 INFO L273 TraceCheckUtils]: 67: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6541#false} is VALID [2018-11-14 18:40:18,293 INFO L273 TraceCheckUtils]: 68: Hoare triple {6541#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6541#false} is VALID [2018-11-14 18:40:18,293 INFO L273 TraceCheckUtils]: 69: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,293 INFO L273 TraceCheckUtils]: 70: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,293 INFO L273 TraceCheckUtils]: 73: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6541#false} is VALID [2018-11-14 18:40:18,294 INFO L273 TraceCheckUtils]: 74: Hoare triple {6541#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6541#false} is VALID [2018-11-14 18:40:18,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6541#false} is VALID [2018-11-14 18:40:18,294 INFO L273 TraceCheckUtils]: 77: Hoare triple {6541#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6541#false} is VALID [2018-11-14 18:40:18,294 INFO L273 TraceCheckUtils]: 78: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,294 INFO L273 TraceCheckUtils]: 79: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6541#false} is VALID [2018-11-14 18:40:18,295 INFO L273 TraceCheckUtils]: 80: Hoare triple {6541#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6541#false} is VALID [2018-11-14 18:40:18,295 INFO L273 TraceCheckUtils]: 81: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6541#false} is VALID [2018-11-14 18:40:18,295 INFO L273 TraceCheckUtils]: 83: Hoare triple {6541#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6541#false} is VALID [2018-11-14 18:40:18,295 INFO L273 TraceCheckUtils]: 84: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,295 INFO L273 TraceCheckUtils]: 85: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,296 INFO L273 TraceCheckUtils]: 86: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6541#false} is VALID [2018-11-14 18:40:18,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {6541#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6541#false} is VALID [2018-11-14 18:40:18,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6541#false} is VALID [2018-11-14 18:40:18,297 INFO L273 TraceCheckUtils]: 92: Hoare triple {6541#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6541#false} is VALID [2018-11-14 18:40:18,297 INFO L273 TraceCheckUtils]: 93: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,297 INFO L273 TraceCheckUtils]: 94: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6541#false} is VALID [2018-11-14 18:40:18,297 INFO L273 TraceCheckUtils]: 95: Hoare triple {6541#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6541#false} is VALID [2018-11-14 18:40:18,297 INFO L273 TraceCheckUtils]: 96: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,297 INFO L273 TraceCheckUtils]: 97: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6541#false} is VALID [2018-11-14 18:40:18,298 INFO L273 TraceCheckUtils]: 98: Hoare triple {6541#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6541#false} is VALID [2018-11-14 18:40:18,298 INFO L273 TraceCheckUtils]: 99: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,298 INFO L273 TraceCheckUtils]: 100: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,298 INFO L273 TraceCheckUtils]: 101: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,298 INFO L273 TraceCheckUtils]: 102: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,298 INFO L273 TraceCheckUtils]: 103: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6541#false} is VALID [2018-11-14 18:40:18,299 INFO L273 TraceCheckUtils]: 104: Hoare triple {6541#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6541#false} is VALID [2018-11-14 18:40:18,299 INFO L273 TraceCheckUtils]: 105: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,299 INFO L273 TraceCheckUtils]: 106: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6541#false} is VALID [2018-11-14 18:40:18,299 INFO L273 TraceCheckUtils]: 107: Hoare triple {6541#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6541#false} is VALID [2018-11-14 18:40:18,299 INFO L273 TraceCheckUtils]: 108: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,300 INFO L273 TraceCheckUtils]: 109: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6541#false} is VALID [2018-11-14 18:40:18,300 INFO L273 TraceCheckUtils]: 110: Hoare triple {6541#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6541#false} is VALID [2018-11-14 18:40:18,300 INFO L273 TraceCheckUtils]: 111: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,300 INFO L273 TraceCheckUtils]: 112: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6541#false} is VALID [2018-11-14 18:40:18,300 INFO L273 TraceCheckUtils]: 113: Hoare triple {6541#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6541#false} is VALID [2018-11-14 18:40:18,300 INFO L273 TraceCheckUtils]: 114: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,301 INFO L273 TraceCheckUtils]: 115: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,301 INFO L273 TraceCheckUtils]: 116: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,301 INFO L273 TraceCheckUtils]: 117: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,301 INFO L273 TraceCheckUtils]: 118: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6541#false} is VALID [2018-11-14 18:40:18,301 INFO L273 TraceCheckUtils]: 119: Hoare triple {6541#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6541#false} is VALID [2018-11-14 18:40:18,301 INFO L273 TraceCheckUtils]: 120: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,301 INFO L273 TraceCheckUtils]: 121: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6541#false} is VALID [2018-11-14 18:40:18,302 INFO L273 TraceCheckUtils]: 122: Hoare triple {6541#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6541#false} is VALID [2018-11-14 18:40:18,302 INFO L273 TraceCheckUtils]: 123: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,302 INFO L273 TraceCheckUtils]: 124: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6541#false} is VALID [2018-11-14 18:40:18,302 INFO L273 TraceCheckUtils]: 125: Hoare triple {6541#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6541#false} is VALID [2018-11-14 18:40:18,302 INFO L273 TraceCheckUtils]: 126: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,302 INFO L273 TraceCheckUtils]: 127: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6541#false} is VALID [2018-11-14 18:40:18,303 INFO L273 TraceCheckUtils]: 128: Hoare triple {6541#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6541#false} is VALID [2018-11-14 18:40:18,303 INFO L273 TraceCheckUtils]: 129: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,303 INFO L273 TraceCheckUtils]: 130: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,303 INFO L273 TraceCheckUtils]: 131: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,303 INFO L273 TraceCheckUtils]: 132: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,303 INFO L273 TraceCheckUtils]: 133: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6541#false} is VALID [2018-11-14 18:40:18,304 INFO L273 TraceCheckUtils]: 134: Hoare triple {6541#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6541#false} is VALID [2018-11-14 18:40:18,304 INFO L273 TraceCheckUtils]: 135: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,304 INFO L273 TraceCheckUtils]: 136: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6541#false} is VALID [2018-11-14 18:40:18,304 INFO L273 TraceCheckUtils]: 137: Hoare triple {6541#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6541#false} is VALID [2018-11-14 18:40:18,304 INFO L273 TraceCheckUtils]: 138: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,304 INFO L273 TraceCheckUtils]: 139: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6541#false} is VALID [2018-11-14 18:40:18,305 INFO L273 TraceCheckUtils]: 140: Hoare triple {6541#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6541#false} is VALID [2018-11-14 18:40:18,305 INFO L273 TraceCheckUtils]: 141: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,305 INFO L273 TraceCheckUtils]: 142: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6541#false} is VALID [2018-11-14 18:40:18,305 INFO L273 TraceCheckUtils]: 143: Hoare triple {6541#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6541#false} is VALID [2018-11-14 18:40:18,305 INFO L273 TraceCheckUtils]: 144: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,305 INFO L273 TraceCheckUtils]: 145: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,306 INFO L273 TraceCheckUtils]: 146: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,306 INFO L273 TraceCheckUtils]: 147: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,306 INFO L273 TraceCheckUtils]: 148: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:18,306 INFO L273 TraceCheckUtils]: 149: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:18,306 INFO L273 TraceCheckUtils]: 150: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,306 INFO L273 TraceCheckUtils]: 151: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:18,307 INFO L273 TraceCheckUtils]: 152: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:18,307 INFO L273 TraceCheckUtils]: 153: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,307 INFO L273 TraceCheckUtils]: 154: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:18,307 INFO L273 TraceCheckUtils]: 155: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:18,307 INFO L273 TraceCheckUtils]: 156: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,307 INFO L273 TraceCheckUtils]: 157: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L273 TraceCheckUtils]: 158: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L273 TraceCheckUtils]: 159: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L273 TraceCheckUtils]: 160: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L273 TraceCheckUtils]: 161: Hoare triple {6541#false} havoc ~x~0;~x~0 := 0; {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L273 TraceCheckUtils]: 162: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L273 TraceCheckUtils]: 163: Hoare triple {6541#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L256 TraceCheckUtils]: 164: Hoare triple {6541#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {6541#false} is VALID [2018-11-14 18:40:18,308 INFO L273 TraceCheckUtils]: 165: Hoare triple {6541#false} ~cond := #in~cond; {6541#false} is VALID [2018-11-14 18:40:18,309 INFO L273 TraceCheckUtils]: 166: Hoare triple {6541#false} assume ~cond == 0; {6541#false} is VALID [2018-11-14 18:40:18,309 INFO L273 TraceCheckUtils]: 167: Hoare triple {6541#false} assume !false; {6541#false} is VALID [2018-11-14 18:40:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-14 18:40:18,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:18,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:40:18,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:40:21,377 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:40:21,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:21,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:21,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {6540#true} call ULTIMATE.init(); {6540#true} is VALID [2018-11-14 18:40:21,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {6540#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6540#true} is VALID [2018-11-14 18:40:21,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6540#true} {6540#true} #186#return; {6540#true} is VALID [2018-11-14 18:40:21,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {6540#true} call #t~ret24 := main(); {6540#true} is VALID [2018-11-14 18:40:21,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {6540#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6540#true} is VALID [2018-11-14 18:40:21,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 18:40:21,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6540#true} is VALID [2018-11-14 18:40:21,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 18:40:21,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6540#true} is VALID [2018-11-14 18:40:21,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 18:40:21,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6540#true} is VALID [2018-11-14 18:40:21,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 18:40:21,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 20: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 22: Hoare triple {6540#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {6540#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 24: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {6540#true} assume !(~a~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {6540#true} havoc ~i~0;~i~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {6540#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 32: Hoare triple {6540#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {6540#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6540#true} is VALID [2018-11-14 18:40:21,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {6540#true} is VALID [2018-11-14 18:40:21,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {6540#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6540#true} is VALID [2018-11-14 18:40:21,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6540#true} is VALID [2018-11-14 18:40:21,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {6540#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6540#true} is VALID [2018-11-14 18:40:21,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6540#true} is VALID [2018-11-14 18:40:21,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {6540#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6540#true} is VALID [2018-11-14 18:40:21,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,619 INFO L273 TraceCheckUtils]: 49: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6540#true} is VALID [2018-11-14 18:40:21,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {6540#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6540#true} is VALID [2018-11-14 18:40:21,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {6540#true} is VALID [2018-11-14 18:40:21,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {6540#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {6540#true} is VALID [2018-11-14 18:40:21,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6540#true} is VALID [2018-11-14 18:40:21,620 INFO L273 TraceCheckUtils]: 59: Hoare triple {6540#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6540#true} is VALID [2018-11-14 18:40:21,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,621 INFO L273 TraceCheckUtils]: 61: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6540#true} is VALID [2018-11-14 18:40:21,621 INFO L273 TraceCheckUtils]: 62: Hoare triple {6540#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6540#true} is VALID [2018-11-14 18:40:21,621 INFO L273 TraceCheckUtils]: 63: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,621 INFO L273 TraceCheckUtils]: 64: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6540#true} is VALID [2018-11-14 18:40:21,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {6540#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6540#true} is VALID [2018-11-14 18:40:21,621 INFO L273 TraceCheckUtils]: 66: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,622 INFO L273 TraceCheckUtils]: 67: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {6540#true} is VALID [2018-11-14 18:40:21,622 INFO L273 TraceCheckUtils]: 68: Hoare triple {6540#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {6540#true} is VALID [2018-11-14 18:40:21,622 INFO L273 TraceCheckUtils]: 69: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,622 INFO L273 TraceCheckUtils]: 70: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,622 INFO L273 TraceCheckUtils]: 71: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,622 INFO L273 TraceCheckUtils]: 72: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,623 INFO L273 TraceCheckUtils]: 73: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6540#true} is VALID [2018-11-14 18:40:21,623 INFO L273 TraceCheckUtils]: 74: Hoare triple {6540#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6540#true} is VALID [2018-11-14 18:40:21,623 INFO L273 TraceCheckUtils]: 75: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,623 INFO L273 TraceCheckUtils]: 76: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6540#true} is VALID [2018-11-14 18:40:21,623 INFO L273 TraceCheckUtils]: 77: Hoare triple {6540#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6540#true} is VALID [2018-11-14 18:40:21,623 INFO L273 TraceCheckUtils]: 78: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,624 INFO L273 TraceCheckUtils]: 79: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6540#true} is VALID [2018-11-14 18:40:21,624 INFO L273 TraceCheckUtils]: 80: Hoare triple {6540#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6540#true} is VALID [2018-11-14 18:40:21,624 INFO L273 TraceCheckUtils]: 81: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,624 INFO L273 TraceCheckUtils]: 82: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {6540#true} is VALID [2018-11-14 18:40:21,624 INFO L273 TraceCheckUtils]: 83: Hoare triple {6540#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {6540#true} is VALID [2018-11-14 18:40:21,624 INFO L273 TraceCheckUtils]: 84: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,625 INFO L273 TraceCheckUtils]: 85: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,625 INFO L273 TraceCheckUtils]: 86: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,625 INFO L273 TraceCheckUtils]: 87: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,625 INFO L273 TraceCheckUtils]: 88: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6540#true} is VALID [2018-11-14 18:40:21,625 INFO L273 TraceCheckUtils]: 89: Hoare triple {6540#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6540#true} is VALID [2018-11-14 18:40:21,625 INFO L273 TraceCheckUtils]: 90: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,626 INFO L273 TraceCheckUtils]: 91: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6540#true} is VALID [2018-11-14 18:40:21,626 INFO L273 TraceCheckUtils]: 92: Hoare triple {6540#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6540#true} is VALID [2018-11-14 18:40:21,626 INFO L273 TraceCheckUtils]: 93: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,626 INFO L273 TraceCheckUtils]: 94: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6540#true} is VALID [2018-11-14 18:40:21,626 INFO L273 TraceCheckUtils]: 95: Hoare triple {6540#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6540#true} is VALID [2018-11-14 18:40:21,626 INFO L273 TraceCheckUtils]: 96: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,627 INFO L273 TraceCheckUtils]: 97: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {6540#true} is VALID [2018-11-14 18:40:21,627 INFO L273 TraceCheckUtils]: 98: Hoare triple {6540#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {6540#true} is VALID [2018-11-14 18:40:21,627 INFO L273 TraceCheckUtils]: 99: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,627 INFO L273 TraceCheckUtils]: 100: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,627 INFO L273 TraceCheckUtils]: 101: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,627 INFO L273 TraceCheckUtils]: 102: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,628 INFO L273 TraceCheckUtils]: 103: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6540#true} is VALID [2018-11-14 18:40:21,628 INFO L273 TraceCheckUtils]: 104: Hoare triple {6540#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6540#true} is VALID [2018-11-14 18:40:21,628 INFO L273 TraceCheckUtils]: 105: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,628 INFO L273 TraceCheckUtils]: 106: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6540#true} is VALID [2018-11-14 18:40:21,628 INFO L273 TraceCheckUtils]: 107: Hoare triple {6540#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6540#true} is VALID [2018-11-14 18:40:21,628 INFO L273 TraceCheckUtils]: 108: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,629 INFO L273 TraceCheckUtils]: 109: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6540#true} is VALID [2018-11-14 18:40:21,629 INFO L273 TraceCheckUtils]: 110: Hoare triple {6540#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6540#true} is VALID [2018-11-14 18:40:21,629 INFO L273 TraceCheckUtils]: 111: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,629 INFO L273 TraceCheckUtils]: 112: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {6540#true} is VALID [2018-11-14 18:40:21,629 INFO L273 TraceCheckUtils]: 113: Hoare triple {6540#true} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {6540#true} is VALID [2018-11-14 18:40:21,629 INFO L273 TraceCheckUtils]: 114: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,629 INFO L273 TraceCheckUtils]: 115: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,630 INFO L273 TraceCheckUtils]: 116: Hoare triple {6540#true} ~i~0 := 0; {6540#true} is VALID [2018-11-14 18:40:21,630 INFO L273 TraceCheckUtils]: 117: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,630 INFO L273 TraceCheckUtils]: 118: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6540#true} is VALID [2018-11-14 18:40:21,630 INFO L273 TraceCheckUtils]: 119: Hoare triple {6540#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6540#true} is VALID [2018-11-14 18:40:21,630 INFO L273 TraceCheckUtils]: 120: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,630 INFO L273 TraceCheckUtils]: 121: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6540#true} is VALID [2018-11-14 18:40:21,631 INFO L273 TraceCheckUtils]: 122: Hoare triple {6540#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6540#true} is VALID [2018-11-14 18:40:21,631 INFO L273 TraceCheckUtils]: 123: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,631 INFO L273 TraceCheckUtils]: 124: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6540#true} is VALID [2018-11-14 18:40:21,631 INFO L273 TraceCheckUtils]: 125: Hoare triple {6540#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6540#true} is VALID [2018-11-14 18:40:21,631 INFO L273 TraceCheckUtils]: 126: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,631 INFO L273 TraceCheckUtils]: 127: Hoare triple {6540#true} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {6540#true} is VALID [2018-11-14 18:40:21,632 INFO L273 TraceCheckUtils]: 128: Hoare triple {6540#true} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {6540#true} is VALID [2018-11-14 18:40:21,632 INFO L273 TraceCheckUtils]: 129: Hoare triple {6540#true} assume true; {6540#true} is VALID [2018-11-14 18:40:21,632 INFO L273 TraceCheckUtils]: 130: Hoare triple {6540#true} assume !(~i~0 < 100000); {6540#true} is VALID [2018-11-14 18:40:21,639 INFO L273 TraceCheckUtils]: 131: Hoare triple {6540#true} ~i~0 := 0; {6945#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:21,640 INFO L273 TraceCheckUtils]: 132: Hoare triple {6945#(<= main_~i~0 0)} assume true; {6945#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:21,640 INFO L273 TraceCheckUtils]: 133: Hoare triple {6945#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6945#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:21,642 INFO L273 TraceCheckUtils]: 134: Hoare triple {6945#(<= main_~i~0 0)} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6955#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:21,642 INFO L273 TraceCheckUtils]: 135: Hoare triple {6955#(<= main_~i~0 1)} assume true; {6955#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:21,645 INFO L273 TraceCheckUtils]: 136: Hoare triple {6955#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6955#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:21,645 INFO L273 TraceCheckUtils]: 137: Hoare triple {6955#(<= main_~i~0 1)} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6965#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:21,647 INFO L273 TraceCheckUtils]: 138: Hoare triple {6965#(<= main_~i~0 2)} assume true; {6965#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:21,647 INFO L273 TraceCheckUtils]: 139: Hoare triple {6965#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6965#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:21,650 INFO L273 TraceCheckUtils]: 140: Hoare triple {6965#(<= main_~i~0 2)} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6975#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:21,650 INFO L273 TraceCheckUtils]: 141: Hoare triple {6975#(<= main_~i~0 3)} assume true; {6975#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:21,652 INFO L273 TraceCheckUtils]: 142: Hoare triple {6975#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {6975#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:21,652 INFO L273 TraceCheckUtils]: 143: Hoare triple {6975#(<= main_~i~0 3)} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {6985#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:21,654 INFO L273 TraceCheckUtils]: 144: Hoare triple {6985#(<= main_~i~0 4)} assume true; {6985#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:21,654 INFO L273 TraceCheckUtils]: 145: Hoare triple {6985#(<= main_~i~0 4)} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:21,654 INFO L273 TraceCheckUtils]: 146: Hoare triple {6541#false} ~i~0 := 0; {6541#false} is VALID [2018-11-14 18:40:21,654 INFO L273 TraceCheckUtils]: 147: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:21,654 INFO L273 TraceCheckUtils]: 148: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 149: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 150: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 151: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 152: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 153: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 154: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 155: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:21,655 INFO L273 TraceCheckUtils]: 156: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 157: Hoare triple {6541#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 158: Hoare triple {6541#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 159: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 160: Hoare triple {6541#false} assume !(~i~0 < 100000); {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 161: Hoare triple {6541#false} havoc ~x~0;~x~0 := 0; {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 162: Hoare triple {6541#false} assume true; {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 163: Hoare triple {6541#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L256 TraceCheckUtils]: 164: Hoare triple {6541#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {6541#false} is VALID [2018-11-14 18:40:21,656 INFO L273 TraceCheckUtils]: 165: Hoare triple {6541#false} ~cond := #in~cond; {6541#false} is VALID [2018-11-14 18:40:21,657 INFO L273 TraceCheckUtils]: 166: Hoare triple {6541#false} assume ~cond == 0; {6541#false} is VALID [2018-11-14 18:40:21,657 INFO L273 TraceCheckUtils]: 167: Hoare triple {6541#false} assume !false; {6541#false} is VALID [2018-11-14 18:40:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-11-14 18:40:21,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:21,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-14 18:40:21,690 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2018-11-14 18:40:21,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:21,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:40:21,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:21,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:40:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:40:21,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:40:21,808 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 14 states. [2018-11-14 18:40:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:24,212 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2018-11-14 18:40:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:40:24,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2018-11-14 18:40:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:40:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2018-11-14 18:40:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:40:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2018-11-14 18:40:24,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 290 transitions. [2018-11-14 18:40:24,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:24,508 INFO L225 Difference]: With dead ends: 360 [2018-11-14 18:40:24,508 INFO L226 Difference]: Without dead ends: 213 [2018-11-14 18:40:24,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:40:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-14 18:40:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2018-11-14 18:40:24,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:24,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 203 states. [2018-11-14 18:40:24,699 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 203 states. [2018-11-14 18:40:24,699 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 203 states. [2018-11-14 18:40:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:24,707 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-11-14 18:40:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 223 transitions. [2018-11-14 18:40:24,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:24,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:24,708 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 213 states. [2018-11-14 18:40:24,708 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 213 states. [2018-11-14 18:40:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:24,715 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-11-14 18:40:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 223 transitions. [2018-11-14 18:40:24,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:24,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:24,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:24,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:24,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-14 18:40:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 213 transitions. [2018-11-14 18:40:24,723 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 213 transitions. Word has length 168 [2018-11-14 18:40:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:24,724 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 213 transitions. [2018-11-14 18:40:24,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:40:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 213 transitions. [2018-11-14 18:40:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-14 18:40:24,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:24,726 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:24,727 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:24,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1790904641, now seen corresponding path program 7 times [2018-11-14 18:40:24,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:24,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:24,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:24,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:24,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:25,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {8232#true} call ULTIMATE.init(); {8232#true} is VALID [2018-11-14 18:40:25,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {8232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8232#true} is VALID [2018-11-14 18:40:25,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {8232#true} assume true; {8232#true} is VALID [2018-11-14 18:40:25,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8232#true} {8232#true} #186#return; {8232#true} is VALID [2018-11-14 18:40:25,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {8232#true} call #t~ret24 := main(); {8232#true} is VALID [2018-11-14 18:40:25,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {8232#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8234#(= main_~a~0 0)} is VALID [2018-11-14 18:40:25,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {8234#(= main_~a~0 0)} assume true; {8234#(= main_~a~0 0)} is VALID [2018-11-14 18:40:25,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {8234#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8234#(= main_~a~0 0)} is VALID [2018-11-14 18:40:25,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {8234#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8235#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:25,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {8235#(<= main_~a~0 1)} assume true; {8235#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:25,077 INFO L273 TraceCheckUtils]: 10: Hoare triple {8235#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8235#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:25,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {8235#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8236#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:25,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {8236#(<= main_~a~0 2)} assume true; {8236#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:25,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {8236#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8236#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:25,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {8236#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8237#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:25,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {8237#(<= main_~a~0 3)} assume true; {8237#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:25,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {8237#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8237#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:25,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {8237#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8238#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:25,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {8238#(<= main_~a~0 4)} assume true; {8238#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:25,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {8238#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8238#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:25,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {8238#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8239#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:25,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {8239#(<= main_~a~0 5)} assume true; {8239#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:25,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {8239#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8239#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:25,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {8239#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8240#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:25,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {8240#(<= main_~a~0 6)} assume true; {8240#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:25,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {8240#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8240#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:25,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {8240#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8241#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:25,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {8241#(<= main_~a~0 7)} assume true; {8241#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:25,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {8241#(<= main_~a~0 7)} assume !(~a~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {8233#false} havoc ~i~0;~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,090 INFO L273 TraceCheckUtils]: 38: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,091 INFO L273 TraceCheckUtils]: 41: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,091 INFO L273 TraceCheckUtils]: 43: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,091 INFO L273 TraceCheckUtils]: 44: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,091 INFO L273 TraceCheckUtils]: 45: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 46: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 47: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 48: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 49: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 50: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 51: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 52: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,092 INFO L273 TraceCheckUtils]: 53: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 54: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 55: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 56: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 57: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 58: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 59: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 61: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,093 INFO L273 TraceCheckUtils]: 62: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 64: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 65: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 66: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 67: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 68: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 69: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,094 INFO L273 TraceCheckUtils]: 70: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 71: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 72: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 73: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 74: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 75: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 76: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 77: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,095 INFO L273 TraceCheckUtils]: 78: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 79: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 80: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 81: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 82: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 83: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 84: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 85: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 86: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,096 INFO L273 TraceCheckUtils]: 87: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 88: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 89: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 90: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 91: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 92: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 93: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 94: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,097 INFO L273 TraceCheckUtils]: 95: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 96: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 97: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 98: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 99: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 100: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 101: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 102: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,098 INFO L273 TraceCheckUtils]: 103: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 104: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 105: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 106: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 107: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 108: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 109: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 110: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,099 INFO L273 TraceCheckUtils]: 111: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 112: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 113: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 114: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 115: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 116: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 117: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 118: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,100 INFO L273 TraceCheckUtils]: 119: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 120: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 121: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 122: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 123: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 124: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 125: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 126: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 127: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,101 INFO L273 TraceCheckUtils]: 128: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 129: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 130: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 131: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 132: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 133: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 134: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 135: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,102 INFO L273 TraceCheckUtils]: 136: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 137: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 138: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 139: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 140: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 141: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 142: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 143: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 144: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,103 INFO L273 TraceCheckUtils]: 145: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 146: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 147: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 148: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 149: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 150: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 151: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 152: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,104 INFO L273 TraceCheckUtils]: 153: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 154: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 155: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 156: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 157: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 158: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 159: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 160: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,105 INFO L273 TraceCheckUtils]: 161: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 162: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 163: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 164: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 165: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 166: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 167: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 168: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 169: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,106 INFO L273 TraceCheckUtils]: 170: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 171: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 172: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 173: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 174: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 175: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 176: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 177: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,107 INFO L273 TraceCheckUtils]: 178: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 179: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 180: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 181: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 182: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 183: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 184: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 185: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 186: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,108 INFO L273 TraceCheckUtils]: 187: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L273 TraceCheckUtils]: 188: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L273 TraceCheckUtils]: 189: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L273 TraceCheckUtils]: 190: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L273 TraceCheckUtils]: 191: Hoare triple {8233#false} havoc ~x~0;~x~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L273 TraceCheckUtils]: 192: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L273 TraceCheckUtils]: 193: Hoare triple {8233#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L256 TraceCheckUtils]: 194: Hoare triple {8233#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {8233#false} is VALID [2018-11-14 18:40:25,109 INFO L273 TraceCheckUtils]: 195: Hoare triple {8233#false} ~cond := #in~cond; {8233#false} is VALID [2018-11-14 18:40:25,110 INFO L273 TraceCheckUtils]: 196: Hoare triple {8233#false} assume ~cond == 0; {8233#false} is VALID [2018-11-14 18:40:25,110 INFO L273 TraceCheckUtils]: 197: Hoare triple {8233#false} assume !false; {8233#false} is VALID [2018-11-14 18:40:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-14 18:40:25,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:25,125 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-14 18:40:25,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:25,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:25,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {8232#true} call ULTIMATE.init(); {8232#true} is VALID [2018-11-14 18:40:25,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {8232#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8232#true} is VALID [2018-11-14 18:40:25,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {8232#true} assume true; {8232#true} is VALID [2018-11-14 18:40:25,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8232#true} {8232#true} #186#return; {8232#true} is VALID [2018-11-14 18:40:25,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {8232#true} call #t~ret24 := main(); {8232#true} is VALID [2018-11-14 18:40:25,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {8232#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {8260#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:25,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {8260#(<= main_~a~0 0)} assume true; {8260#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:25,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {8260#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8260#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:25,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {8260#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8235#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:25,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {8235#(<= main_~a~0 1)} assume true; {8235#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:25,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {8235#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8235#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:25,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {8235#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8236#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:25,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {8236#(<= main_~a~0 2)} assume true; {8236#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:25,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {8236#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8236#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:25,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {8236#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8237#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:25,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {8237#(<= main_~a~0 3)} assume true; {8237#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:25,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {8237#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8237#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:25,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {8237#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8238#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:25,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {8238#(<= main_~a~0 4)} assume true; {8238#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:25,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {8238#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8238#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:25,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {8238#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8239#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:25,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {8239#(<= main_~a~0 5)} assume true; {8239#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:25,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {8239#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8239#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:25,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {8239#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8240#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:25,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {8240#(<= main_~a~0 6)} assume true; {8240#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:25,726 INFO L273 TraceCheckUtils]: 25: Hoare triple {8240#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {8240#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:25,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {8240#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {8241#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:25,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {8241#(<= main_~a~0 7)} assume true; {8241#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:25,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {8241#(<= main_~a~0 7)} assume !(~a~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {8233#false} havoc ~i~0;~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,729 INFO L273 TraceCheckUtils]: 43: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {8233#false} is VALID [2018-11-14 18:40:25,729 INFO L273 TraceCheckUtils]: 44: Hoare triple {8233#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8233#false} is VALID [2018-11-14 18:40:25,729 INFO L273 TraceCheckUtils]: 45: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,730 INFO L273 TraceCheckUtils]: 47: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,730 INFO L273 TraceCheckUtils]: 48: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,730 INFO L273 TraceCheckUtils]: 50: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,730 INFO L273 TraceCheckUtils]: 51: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,731 INFO L273 TraceCheckUtils]: 53: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,731 INFO L273 TraceCheckUtils]: 54: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,732 INFO L273 TraceCheckUtils]: 55: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,732 INFO L273 TraceCheckUtils]: 58: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {8233#false} is VALID [2018-11-14 18:40:25,733 INFO L273 TraceCheckUtils]: 62: Hoare triple {8233#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {8233#false} is VALID [2018-11-14 18:40:25,733 INFO L273 TraceCheckUtils]: 63: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,733 INFO L273 TraceCheckUtils]: 64: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,733 INFO L273 TraceCheckUtils]: 65: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,733 INFO L273 TraceCheckUtils]: 66: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,734 INFO L273 TraceCheckUtils]: 67: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,734 INFO L273 TraceCheckUtils]: 68: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,734 INFO L273 TraceCheckUtils]: 69: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,734 INFO L273 TraceCheckUtils]: 71: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,734 INFO L273 TraceCheckUtils]: 72: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,735 INFO L273 TraceCheckUtils]: 73: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,735 INFO L273 TraceCheckUtils]: 74: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,735 INFO L273 TraceCheckUtils]: 75: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,735 INFO L273 TraceCheckUtils]: 76: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,735 INFO L273 TraceCheckUtils]: 77: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,735 INFO L273 TraceCheckUtils]: 78: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,735 INFO L273 TraceCheckUtils]: 79: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {8233#false} is VALID [2018-11-14 18:40:25,736 INFO L273 TraceCheckUtils]: 80: Hoare triple {8233#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {8233#false} is VALID [2018-11-14 18:40:25,736 INFO L273 TraceCheckUtils]: 81: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,736 INFO L273 TraceCheckUtils]: 82: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,736 INFO L273 TraceCheckUtils]: 83: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,736 INFO L273 TraceCheckUtils]: 84: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,736 INFO L273 TraceCheckUtils]: 85: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,737 INFO L273 TraceCheckUtils]: 86: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,737 INFO L273 TraceCheckUtils]: 87: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,737 INFO L273 TraceCheckUtils]: 88: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,737 INFO L273 TraceCheckUtils]: 90: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,737 INFO L273 TraceCheckUtils]: 91: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,737 INFO L273 TraceCheckUtils]: 92: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,738 INFO L273 TraceCheckUtils]: 93: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,738 INFO L273 TraceCheckUtils]: 94: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,738 INFO L273 TraceCheckUtils]: 95: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,738 INFO L273 TraceCheckUtils]: 96: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,738 INFO L273 TraceCheckUtils]: 97: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {8233#false} is VALID [2018-11-14 18:40:25,738 INFO L273 TraceCheckUtils]: 98: Hoare triple {8233#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {8233#false} is VALID [2018-11-14 18:40:25,739 INFO L273 TraceCheckUtils]: 99: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,739 INFO L273 TraceCheckUtils]: 100: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,739 INFO L273 TraceCheckUtils]: 101: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,739 INFO L273 TraceCheckUtils]: 102: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,739 INFO L273 TraceCheckUtils]: 103: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,739 INFO L273 TraceCheckUtils]: 104: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,739 INFO L273 TraceCheckUtils]: 105: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,740 INFO L273 TraceCheckUtils]: 106: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,740 INFO L273 TraceCheckUtils]: 107: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,740 INFO L273 TraceCheckUtils]: 108: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,740 INFO L273 TraceCheckUtils]: 109: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,740 INFO L273 TraceCheckUtils]: 110: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,740 INFO L273 TraceCheckUtils]: 111: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,741 INFO L273 TraceCheckUtils]: 112: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,741 INFO L273 TraceCheckUtils]: 113: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,741 INFO L273 TraceCheckUtils]: 114: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,741 INFO L273 TraceCheckUtils]: 115: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {8233#false} is VALID [2018-11-14 18:40:25,741 INFO L273 TraceCheckUtils]: 116: Hoare triple {8233#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {8233#false} is VALID [2018-11-14 18:40:25,741 INFO L273 TraceCheckUtils]: 117: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,741 INFO L273 TraceCheckUtils]: 118: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,742 INFO L273 TraceCheckUtils]: 119: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,742 INFO L273 TraceCheckUtils]: 120: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,742 INFO L273 TraceCheckUtils]: 121: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,742 INFO L273 TraceCheckUtils]: 122: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,742 INFO L273 TraceCheckUtils]: 123: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,742 INFO L273 TraceCheckUtils]: 124: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,742 INFO L273 TraceCheckUtils]: 125: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,743 INFO L273 TraceCheckUtils]: 126: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,743 INFO L273 TraceCheckUtils]: 127: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,743 INFO L273 TraceCheckUtils]: 128: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,743 INFO L273 TraceCheckUtils]: 129: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,743 INFO L273 TraceCheckUtils]: 130: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,743 INFO L273 TraceCheckUtils]: 131: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,744 INFO L273 TraceCheckUtils]: 132: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,744 INFO L273 TraceCheckUtils]: 133: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {8233#false} is VALID [2018-11-14 18:40:25,744 INFO L273 TraceCheckUtils]: 134: Hoare triple {8233#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {8233#false} is VALID [2018-11-14 18:40:25,744 INFO L273 TraceCheckUtils]: 135: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,744 INFO L273 TraceCheckUtils]: 136: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,744 INFO L273 TraceCheckUtils]: 137: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,744 INFO L273 TraceCheckUtils]: 138: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,745 INFO L273 TraceCheckUtils]: 139: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,745 INFO L273 TraceCheckUtils]: 140: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,745 INFO L273 TraceCheckUtils]: 141: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,745 INFO L273 TraceCheckUtils]: 142: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,745 INFO L273 TraceCheckUtils]: 143: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,745 INFO L273 TraceCheckUtils]: 144: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,746 INFO L273 TraceCheckUtils]: 145: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,746 INFO L273 TraceCheckUtils]: 146: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,746 INFO L273 TraceCheckUtils]: 147: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,746 INFO L273 TraceCheckUtils]: 148: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,746 INFO L273 TraceCheckUtils]: 149: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,746 INFO L273 TraceCheckUtils]: 150: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,746 INFO L273 TraceCheckUtils]: 151: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {8233#false} is VALID [2018-11-14 18:40:25,747 INFO L273 TraceCheckUtils]: 152: Hoare triple {8233#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {8233#false} is VALID [2018-11-14 18:40:25,747 INFO L273 TraceCheckUtils]: 153: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,747 INFO L273 TraceCheckUtils]: 154: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,747 INFO L273 TraceCheckUtils]: 155: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,747 INFO L273 TraceCheckUtils]: 156: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,747 INFO L273 TraceCheckUtils]: 157: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,748 INFO L273 TraceCheckUtils]: 158: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,748 INFO L273 TraceCheckUtils]: 159: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,748 INFO L273 TraceCheckUtils]: 160: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,748 INFO L273 TraceCheckUtils]: 161: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,748 INFO L273 TraceCheckUtils]: 162: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,748 INFO L273 TraceCheckUtils]: 163: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,748 INFO L273 TraceCheckUtils]: 164: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,749 INFO L273 TraceCheckUtils]: 165: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,749 INFO L273 TraceCheckUtils]: 166: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,749 INFO L273 TraceCheckUtils]: 167: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,749 INFO L273 TraceCheckUtils]: 168: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,749 INFO L273 TraceCheckUtils]: 169: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {8233#false} is VALID [2018-11-14 18:40:25,749 INFO L273 TraceCheckUtils]: 170: Hoare triple {8233#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {8233#false} is VALID [2018-11-14 18:40:25,749 INFO L273 TraceCheckUtils]: 171: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,750 INFO L273 TraceCheckUtils]: 172: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,750 INFO L273 TraceCheckUtils]: 173: Hoare triple {8233#false} ~i~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,750 INFO L273 TraceCheckUtils]: 174: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,750 INFO L273 TraceCheckUtils]: 175: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,750 INFO L273 TraceCheckUtils]: 176: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,750 INFO L273 TraceCheckUtils]: 177: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,751 INFO L273 TraceCheckUtils]: 178: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,751 INFO L273 TraceCheckUtils]: 179: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,751 INFO L273 TraceCheckUtils]: 180: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,751 INFO L273 TraceCheckUtils]: 181: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,751 INFO L273 TraceCheckUtils]: 182: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,752 INFO L273 TraceCheckUtils]: 183: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,752 INFO L273 TraceCheckUtils]: 184: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,752 INFO L273 TraceCheckUtils]: 185: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,752 INFO L273 TraceCheckUtils]: 186: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,752 INFO L273 TraceCheckUtils]: 187: Hoare triple {8233#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {8233#false} is VALID [2018-11-14 18:40:25,753 INFO L273 TraceCheckUtils]: 188: Hoare triple {8233#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {8233#false} is VALID [2018-11-14 18:40:25,753 INFO L273 TraceCheckUtils]: 189: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,753 INFO L273 TraceCheckUtils]: 190: Hoare triple {8233#false} assume !(~i~0 < 100000); {8233#false} is VALID [2018-11-14 18:40:25,753 INFO L273 TraceCheckUtils]: 191: Hoare triple {8233#false} havoc ~x~0;~x~0 := 0; {8233#false} is VALID [2018-11-14 18:40:25,753 INFO L273 TraceCheckUtils]: 192: Hoare triple {8233#false} assume true; {8233#false} is VALID [2018-11-14 18:40:25,754 INFO L273 TraceCheckUtils]: 193: Hoare triple {8233#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {8233#false} is VALID [2018-11-14 18:40:25,754 INFO L256 TraceCheckUtils]: 194: Hoare triple {8233#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {8233#false} is VALID [2018-11-14 18:40:25,754 INFO L273 TraceCheckUtils]: 195: Hoare triple {8233#false} ~cond := #in~cond; {8233#false} is VALID [2018-11-14 18:40:25,754 INFO L273 TraceCheckUtils]: 196: Hoare triple {8233#false} assume ~cond == 0; {8233#false} is VALID [2018-11-14 18:40:25,754 INFO L273 TraceCheckUtils]: 197: Hoare triple {8233#false} assume !false; {8233#false} is VALID [2018-11-14 18:40:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-14 18:40:25,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:25,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:40:25,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-11-14 18:40:25,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:25,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:40:25,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:25,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:40:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:40:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:40:25,910 INFO L87 Difference]: Start difference. First operand 203 states and 213 transitions. Second operand 11 states. [2018-11-14 18:40:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:26,754 INFO L93 Difference]: Finished difference Result 381 states and 401 transitions. [2018-11-14 18:40:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:40:26,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-11-14 18:40:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:40:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2018-11-14 18:40:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:40:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2018-11-14 18:40:26,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 149 transitions. [2018-11-14 18:40:26,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:26,903 INFO L225 Difference]: With dead ends: 381 [2018-11-14 18:40:26,903 INFO L226 Difference]: Without dead ends: 207 [2018-11-14 18:40:26,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:40:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-14 18:40:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-11-14 18:40:26,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:26,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 206 states. [2018-11-14 18:40:26,982 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 206 states. [2018-11-14 18:40:26,982 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 206 states. [2018-11-14 18:40:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:26,987 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-11-14 18:40:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2018-11-14 18:40:26,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:26,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:26,988 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 207 states. [2018-11-14 18:40:26,988 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 207 states. [2018-11-14 18:40:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:26,992 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-11-14 18:40:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2018-11-14 18:40:26,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:26,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:26,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:26,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-14 18:40:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 216 transitions. [2018-11-14 18:40:26,998 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 216 transitions. Word has length 198 [2018-11-14 18:40:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:26,998 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 216 transitions. [2018-11-14 18:40:26,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:40:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 216 transitions. [2018-11-14 18:40:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-14 18:40:27,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:27,001 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:27,001 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:27,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash 942296980, now seen corresponding path program 8 times [2018-11-14 18:40:27,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:27,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:27,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:40:27,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:27,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {10034#true} call ULTIMATE.init(); {10034#true} is VALID [2018-11-14 18:40:27,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {10034#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10034#true} is VALID [2018-11-14 18:40:27,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {10034#true} assume true; {10034#true} is VALID [2018-11-14 18:40:27,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10034#true} {10034#true} #186#return; {10034#true} is VALID [2018-11-14 18:40:27,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {10034#true} call #t~ret24 := main(); {10034#true} is VALID [2018-11-14 18:40:27,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {10034#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10036#(= main_~a~0 0)} is VALID [2018-11-14 18:40:27,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {10036#(= main_~a~0 0)} assume true; {10036#(= main_~a~0 0)} is VALID [2018-11-14 18:40:27,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {10036#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10036#(= main_~a~0 0)} is VALID [2018-11-14 18:40:27,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {10036#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10037#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:27,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {10037#(<= main_~a~0 1)} assume true; {10037#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:27,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {10037#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10037#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:27,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {10037#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10038#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:27,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {10038#(<= main_~a~0 2)} assume true; {10038#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:27,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {10038#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10038#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:27,715 INFO L273 TraceCheckUtils]: 14: Hoare triple {10038#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10039#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:27,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {10039#(<= main_~a~0 3)} assume true; {10039#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:27,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {10039#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10039#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:27,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {10039#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10040#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:27,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {10040#(<= main_~a~0 4)} assume true; {10040#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:27,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {10040#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10040#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:27,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {10040#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10041#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:27,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {10041#(<= main_~a~0 5)} assume true; {10041#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:27,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {10041#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10041#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:27,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {10041#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10042#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:27,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {10042#(<= main_~a~0 6)} assume true; {10042#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:27,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {10042#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10042#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:27,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {10042#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10043#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:27,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {10043#(<= main_~a~0 7)} assume true; {10043#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:27,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {10043#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10043#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:27,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {10043#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10044#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:27,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {10044#(<= main_~a~0 8)} assume true; {10044#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:27,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {10044#(<= main_~a~0 8)} assume !(~a~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {10035#false} havoc ~i~0;~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,725 INFO L273 TraceCheckUtils]: 34: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:27,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:27,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,726 INFO L273 TraceCheckUtils]: 37: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:27,726 INFO L273 TraceCheckUtils]: 38: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:27,726 INFO L273 TraceCheckUtils]: 39: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,727 INFO L273 TraceCheckUtils]: 40: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:27,727 INFO L273 TraceCheckUtils]: 41: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:27,727 INFO L273 TraceCheckUtils]: 42: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,727 INFO L273 TraceCheckUtils]: 43: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:27,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:27,728 INFO L273 TraceCheckUtils]: 45: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:27,728 INFO L273 TraceCheckUtils]: 47: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:27,728 INFO L273 TraceCheckUtils]: 48: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,729 INFO L273 TraceCheckUtils]: 49: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,729 INFO L273 TraceCheckUtils]: 50: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,729 INFO L273 TraceCheckUtils]: 51: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,729 INFO L273 TraceCheckUtils]: 52: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:27,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:27,729 INFO L273 TraceCheckUtils]: 54: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,729 INFO L273 TraceCheckUtils]: 55: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 56: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 57: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 58: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 59: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 60: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 61: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 62: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 63: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,730 INFO L273 TraceCheckUtils]: 64: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 65: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 66: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 67: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 68: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 69: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 70: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 71: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:27,731 INFO L273 TraceCheckUtils]: 72: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,732 INFO L273 TraceCheckUtils]: 73: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:27,732 INFO L273 TraceCheckUtils]: 74: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:27,732 INFO L273 TraceCheckUtils]: 75: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,732 INFO L273 TraceCheckUtils]: 76: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:27,732 INFO L273 TraceCheckUtils]: 77: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:27,732 INFO L273 TraceCheckUtils]: 78: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:27,733 INFO L273 TraceCheckUtils]: 80: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:27,733 INFO L273 TraceCheckUtils]: 81: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,733 INFO L273 TraceCheckUtils]: 82: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:27,733 INFO L273 TraceCheckUtils]: 83: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:27,733 INFO L273 TraceCheckUtils]: 84: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,734 INFO L273 TraceCheckUtils]: 85: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,734 INFO L273 TraceCheckUtils]: 86: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,734 INFO L273 TraceCheckUtils]: 87: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,734 INFO L273 TraceCheckUtils]: 88: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:27,734 INFO L273 TraceCheckUtils]: 89: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:27,734 INFO L273 TraceCheckUtils]: 90: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,735 INFO L273 TraceCheckUtils]: 91: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:27,735 INFO L273 TraceCheckUtils]: 92: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:27,735 INFO L273 TraceCheckUtils]: 93: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,735 INFO L273 TraceCheckUtils]: 94: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:27,735 INFO L273 TraceCheckUtils]: 95: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:27,735 INFO L273 TraceCheckUtils]: 96: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,736 INFO L273 TraceCheckUtils]: 97: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:27,736 INFO L273 TraceCheckUtils]: 98: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:27,736 INFO L273 TraceCheckUtils]: 99: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,736 INFO L273 TraceCheckUtils]: 100: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:27,736 INFO L273 TraceCheckUtils]: 101: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:27,736 INFO L273 TraceCheckUtils]: 102: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,737 INFO L273 TraceCheckUtils]: 103: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,737 INFO L273 TraceCheckUtils]: 104: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,737 INFO L273 TraceCheckUtils]: 105: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,737 INFO L273 TraceCheckUtils]: 106: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:27,737 INFO L273 TraceCheckUtils]: 107: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:27,737 INFO L273 TraceCheckUtils]: 108: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,738 INFO L273 TraceCheckUtils]: 109: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:27,738 INFO L273 TraceCheckUtils]: 110: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:27,738 INFO L273 TraceCheckUtils]: 111: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,738 INFO L273 TraceCheckUtils]: 112: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:27,738 INFO L273 TraceCheckUtils]: 113: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:27,738 INFO L273 TraceCheckUtils]: 114: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,739 INFO L273 TraceCheckUtils]: 115: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:27,739 INFO L273 TraceCheckUtils]: 116: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:27,739 INFO L273 TraceCheckUtils]: 117: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,739 INFO L273 TraceCheckUtils]: 118: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:27,739 INFO L273 TraceCheckUtils]: 119: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:27,739 INFO L273 TraceCheckUtils]: 120: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 121: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 122: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 123: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 124: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 125: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 126: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 127: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 128: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:27,740 INFO L273 TraceCheckUtils]: 129: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 130: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 131: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 132: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 133: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 134: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 135: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 136: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:27,741 INFO L273 TraceCheckUtils]: 137: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 138: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 139: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 140: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 141: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 142: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 143: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 144: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,742 INFO L273 TraceCheckUtils]: 145: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 146: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 147: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 148: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 149: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 150: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 151: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 152: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 153: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,743 INFO L273 TraceCheckUtils]: 154: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 155: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 156: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 157: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 158: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 159: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 160: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 161: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:27,744 INFO L273 TraceCheckUtils]: 162: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 163: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 164: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 165: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 166: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 167: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 168: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 169: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 170: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:27,745 INFO L273 TraceCheckUtils]: 171: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 172: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 173: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 174: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 175: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 176: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 177: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 178: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:27,746 INFO L273 TraceCheckUtils]: 179: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 180: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 181: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 182: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 183: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 184: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 185: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 186: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,747 INFO L273 TraceCheckUtils]: 187: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 188: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 189: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 190: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 191: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 192: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 193: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 194: Hoare triple {10035#false} havoc ~x~0;~x~0 := 0; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 195: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:27,748 INFO L273 TraceCheckUtils]: 196: Hoare triple {10035#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {10035#false} is VALID [2018-11-14 18:40:27,749 INFO L256 TraceCheckUtils]: 197: Hoare triple {10035#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {10035#false} is VALID [2018-11-14 18:40:27,749 INFO L273 TraceCheckUtils]: 198: Hoare triple {10035#false} ~cond := #in~cond; {10035#false} is VALID [2018-11-14 18:40:27,749 INFO L273 TraceCheckUtils]: 199: Hoare triple {10035#false} assume ~cond == 0; {10035#false} is VALID [2018-11-14 18:40:27,749 INFO L273 TraceCheckUtils]: 200: Hoare triple {10035#false} assume !false; {10035#false} is VALID [2018-11-14 18:40:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-14 18:40:27,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:27,764 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-14 18:40:27,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:40:27,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:40:27,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:27,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:28,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {10034#true} call ULTIMATE.init(); {10034#true} is VALID [2018-11-14 18:40:28,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {10034#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10034#true} is VALID [2018-11-14 18:40:28,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {10034#true} assume true; {10034#true} is VALID [2018-11-14 18:40:28,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10034#true} {10034#true} #186#return; {10034#true} is VALID [2018-11-14 18:40:28,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {10034#true} call #t~ret24 := main(); {10034#true} is VALID [2018-11-14 18:40:28,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {10034#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {10063#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:28,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {10063#(<= main_~a~0 0)} assume true; {10063#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:28,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {10063#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10063#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:28,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {10063#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10037#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:28,120 INFO L273 TraceCheckUtils]: 9: Hoare triple {10037#(<= main_~a~0 1)} assume true; {10037#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:28,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {10037#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10037#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:28,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {10037#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10038#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:28,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {10038#(<= main_~a~0 2)} assume true; {10038#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:28,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {10038#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10038#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:28,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {10038#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10039#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:28,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {10039#(<= main_~a~0 3)} assume true; {10039#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:28,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {10039#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10039#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:28,125 INFO L273 TraceCheckUtils]: 17: Hoare triple {10039#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10040#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:28,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {10040#(<= main_~a~0 4)} assume true; {10040#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:28,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {10040#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10040#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:28,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {10040#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10041#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:28,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {10041#(<= main_~a~0 5)} assume true; {10041#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:28,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {10041#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10041#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:28,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {10041#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10042#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:28,129 INFO L273 TraceCheckUtils]: 24: Hoare triple {10042#(<= main_~a~0 6)} assume true; {10042#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:28,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {10042#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10042#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:28,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {10042#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10043#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:28,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {10043#(<= main_~a~0 7)} assume true; {10043#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:28,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {10043#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {10043#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:28,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {10043#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {10044#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:28,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {10044#(<= main_~a~0 8)} assume true; {10044#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:28,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {10044#(<= main_~a~0 8)} assume !(~a~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {10035#false} havoc ~i~0;~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:28,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:28,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,134 INFO L273 TraceCheckUtils]: 37: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:28,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:28,135 INFO L273 TraceCheckUtils]: 39: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,135 INFO L273 TraceCheckUtils]: 40: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:28,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:28,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:28,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:28,136 INFO L273 TraceCheckUtils]: 45: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,136 INFO L273 TraceCheckUtils]: 46: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {10035#false} is VALID [2018-11-14 18:40:28,136 INFO L273 TraceCheckUtils]: 47: Hoare triple {10035#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {10035#false} is VALID [2018-11-14 18:40:28,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 49: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 50: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 51: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 52: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 53: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 54: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 55: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:28,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 57: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 58: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 60: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 61: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 62: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 63: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,138 INFO L273 TraceCheckUtils]: 64: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 65: Hoare triple {10035#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 66: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 67: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 68: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 69: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,139 INFO L273 TraceCheckUtils]: 73: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 74: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 75: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 76: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 77: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 78: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 79: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 80: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:28,140 INFO L273 TraceCheckUtils]: 81: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 82: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 83: Hoare triple {10035#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 84: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 85: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 86: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 87: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 88: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 89: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:28,141 INFO L273 TraceCheckUtils]: 90: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 91: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 92: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 93: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 94: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 95: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 96: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 97: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:28,142 INFO L273 TraceCheckUtils]: 98: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 99: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 100: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 101: Hoare triple {10035#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 102: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 103: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 104: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 105: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 106: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:28,143 INFO L273 TraceCheckUtils]: 107: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 108: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 109: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 110: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 111: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 112: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 113: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 114: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,144 INFO L273 TraceCheckUtils]: 115: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 116: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 117: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 118: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 119: Hoare triple {10035#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 120: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 121: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 122: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,145 INFO L273 TraceCheckUtils]: 123: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 124: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 125: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 126: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 127: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 128: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 129: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 130: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 131: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:28,146 INFO L273 TraceCheckUtils]: 132: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 133: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 134: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 135: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 136: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 137: Hoare triple {10035#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 138: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 139: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,147 INFO L273 TraceCheckUtils]: 140: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 141: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 142: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 143: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 144: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 145: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 146: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 147: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,148 INFO L273 TraceCheckUtils]: 148: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 149: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 150: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 151: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 152: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 153: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 154: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 155: Hoare triple {10035#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 156: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,149 INFO L273 TraceCheckUtils]: 157: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 158: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 159: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 160: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 161: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 162: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 163: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 164: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:28,150 INFO L273 TraceCheckUtils]: 165: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 166: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 167: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 168: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 169: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 170: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 171: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 172: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 173: Hoare triple {10035#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {10035#false} is VALID [2018-11-14 18:40:28,151 INFO L273 TraceCheckUtils]: 174: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 175: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 176: Hoare triple {10035#false} ~i~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 177: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 178: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 179: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 180: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 181: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:28,152 INFO L273 TraceCheckUtils]: 182: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 183: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 184: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 185: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 186: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 187: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 188: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 189: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 190: Hoare triple {10035#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {10035#false} is VALID [2018-11-14 18:40:28,153 INFO L273 TraceCheckUtils]: 191: Hoare triple {10035#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L273 TraceCheckUtils]: 192: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L273 TraceCheckUtils]: 193: Hoare triple {10035#false} assume !(~i~0 < 100000); {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L273 TraceCheckUtils]: 194: Hoare triple {10035#false} havoc ~x~0;~x~0 := 0; {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L273 TraceCheckUtils]: 195: Hoare triple {10035#false} assume true; {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L273 TraceCheckUtils]: 196: Hoare triple {10035#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L256 TraceCheckUtils]: 197: Hoare triple {10035#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L273 TraceCheckUtils]: 198: Hoare triple {10035#false} ~cond := #in~cond; {10035#false} is VALID [2018-11-14 18:40:28,154 INFO L273 TraceCheckUtils]: 199: Hoare triple {10035#false} assume ~cond == 0; {10035#false} is VALID [2018-11-14 18:40:28,155 INFO L273 TraceCheckUtils]: 200: Hoare triple {10035#false} assume !false; {10035#false} is VALID [2018-11-14 18:40:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-14 18:40:28,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:28,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:40:28,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 201 [2018-11-14 18:40:28,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:28,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:40:28,272 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-14 18:40:28,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:40:28,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:40:28,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:40:28,273 INFO L87 Difference]: Start difference. First operand 206 states and 216 transitions. Second operand 12 states. [2018-11-14 18:40:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:28,827 INFO L93 Difference]: Finished difference Result 384 states and 404 transitions. [2018-11-14 18:40:28,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:40:28,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 201 [2018-11-14 18:40:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:40:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-14 18:40:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:40:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 152 transitions. [2018-11-14 18:40:28,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 152 transitions. [2018-11-14 18:40:29,397 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-14 18:40:29,402 INFO L225 Difference]: With dead ends: 384 [2018-11-14 18:40:29,402 INFO L226 Difference]: Without dead ends: 210 [2018-11-14 18:40:29,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:40:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-14 18:40:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-11-14 18:40:29,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:29,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 209 states. [2018-11-14 18:40:29,681 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 209 states. [2018-11-14 18:40:29,681 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 209 states. [2018-11-14 18:40:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:29,687 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-11-14 18:40:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 220 transitions. [2018-11-14 18:40:29,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:29,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:29,688 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 210 states. [2018-11-14 18:40:29,688 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 210 states. [2018-11-14 18:40:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:29,692 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-11-14 18:40:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 220 transitions. [2018-11-14 18:40:29,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:29,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:29,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:29,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-14 18:40:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 219 transitions. [2018-11-14 18:40:29,698 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 219 transitions. Word has length 201 [2018-11-14 18:40:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:29,698 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 219 transitions. [2018-11-14 18:40:29,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:40:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 219 transitions. [2018-11-14 18:40:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-14 18:40:29,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:29,701 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:29,701 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:29,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1761790623, now seen corresponding path program 9 times [2018-11-14 18:40:29,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:29,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:29,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:29,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:29,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:31,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {11860#true} call ULTIMATE.init(); {11860#true} is VALID [2018-11-14 18:40:31,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {11860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11860#true} is VALID [2018-11-14 18:40:31,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:31,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11860#true} {11860#true} #186#return; {11860#true} is VALID [2018-11-14 18:40:31,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {11860#true} call #t~ret24 := main(); {11860#true} is VALID [2018-11-14 18:40:31,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {11860#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11862#(= main_~a~0 0)} is VALID [2018-11-14 18:40:31,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {11862#(= main_~a~0 0)} assume true; {11862#(= main_~a~0 0)} is VALID [2018-11-14 18:40:31,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {11862#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11862#(= main_~a~0 0)} is VALID [2018-11-14 18:40:31,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {11862#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11863#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:31,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {11863#(<= main_~a~0 1)} assume true; {11863#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:31,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {11863#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11863#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:31,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {11863#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11864#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:31,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {11864#(<= main_~a~0 2)} assume true; {11864#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:31,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {11864#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11864#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:31,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {11864#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11865#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:31,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {11865#(<= main_~a~0 3)} assume true; {11865#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:31,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {11865#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11865#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:31,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {11865#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11866#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:31,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {11866#(<= main_~a~0 4)} assume true; {11866#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:31,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {11866#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11866#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:31,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {11866#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11867#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:31,064 INFO L273 TraceCheckUtils]: 21: Hoare triple {11867#(<= main_~a~0 5)} assume true; {11867#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:31,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {11867#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11867#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:31,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {11867#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11868#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:31,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {11868#(<= main_~a~0 6)} assume true; {11868#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:31,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {11868#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11868#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:31,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {11868#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11869#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:31,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {11869#(<= main_~a~0 7)} assume true; {11869#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:31,102 INFO L273 TraceCheckUtils]: 28: Hoare triple {11869#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11869#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:31,102 INFO L273 TraceCheckUtils]: 29: Hoare triple {11869#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11870#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:31,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {11870#(<= main_~a~0 8)} assume true; {11870#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:31,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {11870#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11870#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:31,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {11870#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11871#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:31,104 INFO L273 TraceCheckUtils]: 33: Hoare triple {11871#(<= main_~a~0 9)} assume true; {11871#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:31,104 INFO L273 TraceCheckUtils]: 34: Hoare triple {11871#(<= main_~a~0 9)} assume !(~a~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,104 INFO L273 TraceCheckUtils]: 35: Hoare triple {11861#false} havoc ~i~0;~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 37: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 39: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 40: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-14 18:40:31,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 48: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 49: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 50: Hoare triple {11861#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 51: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,107 INFO L273 TraceCheckUtils]: 53: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,107 INFO L273 TraceCheckUtils]: 54: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,107 INFO L273 TraceCheckUtils]: 55: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11861#false} is VALID [2018-11-14 18:40:31,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {11861#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11861#false} is VALID [2018-11-14 18:40:31,107 INFO L273 TraceCheckUtils]: 57: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11861#false} is VALID [2018-11-14 18:40:31,108 INFO L273 TraceCheckUtils]: 59: Hoare triple {11861#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11861#false} is VALID [2018-11-14 18:40:31,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,108 INFO L273 TraceCheckUtils]: 61: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11861#false} is VALID [2018-11-14 18:40:31,108 INFO L273 TraceCheckUtils]: 62: Hoare triple {11861#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11861#false} is VALID [2018-11-14 18:40:31,108 INFO L273 TraceCheckUtils]: 63: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 64: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 65: Hoare triple {11861#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 66: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 67: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 68: Hoare triple {11861#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 69: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 70: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 71: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,109 INFO L273 TraceCheckUtils]: 72: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 73: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 74: Hoare triple {11861#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 75: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 76: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 77: Hoare triple {11861#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 78: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 79: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11861#false} is VALID [2018-11-14 18:40:31,110 INFO L273 TraceCheckUtils]: 80: Hoare triple {11861#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 81: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 82: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 83: Hoare triple {11861#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 84: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 85: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 86: Hoare triple {11861#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 87: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 88: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,111 INFO L273 TraceCheckUtils]: 89: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 90: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 91: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 92: Hoare triple {11861#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 93: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 94: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 95: Hoare triple {11861#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 96: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,112 INFO L273 TraceCheckUtils]: 97: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 98: Hoare triple {11861#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 99: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 100: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 101: Hoare triple {11861#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 102: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 103: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 104: Hoare triple {11861#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 105: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,113 INFO L273 TraceCheckUtils]: 106: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 107: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 108: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 109: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 110: Hoare triple {11861#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 111: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 112: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 113: Hoare triple {11861#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 114: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,114 INFO L273 TraceCheckUtils]: 115: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 116: Hoare triple {11861#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 117: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 118: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 119: Hoare triple {11861#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 120: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 121: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 122: Hoare triple {11861#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11861#false} is VALID [2018-11-14 18:40:31,115 INFO L273 TraceCheckUtils]: 123: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 124: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 125: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 126: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 127: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 128: Hoare triple {11861#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 129: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 130: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 131: Hoare triple {11861#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {11861#false} is VALID [2018-11-14 18:40:31,116 INFO L273 TraceCheckUtils]: 132: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 133: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 134: Hoare triple {11861#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 135: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 136: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 137: Hoare triple {11861#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 138: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 139: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 140: Hoare triple {11861#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {11861#false} is VALID [2018-11-14 18:40:31,117 INFO L273 TraceCheckUtils]: 141: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 142: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 143: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 144: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 145: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 146: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 147: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 148: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 149: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:31,118 INFO L273 TraceCheckUtils]: 150: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 151: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 152: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 153: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 154: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 155: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 156: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 157: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:31,119 INFO L273 TraceCheckUtils]: 158: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 159: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 160: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 161: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 162: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 163: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 164: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 165: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 166: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:31,120 INFO L273 TraceCheckUtils]: 167: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:31,121 INFO L273 TraceCheckUtils]: 168: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,121 INFO L273 TraceCheckUtils]: 169: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:31,121 INFO L273 TraceCheckUtils]: 170: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:31,121 INFO L273 TraceCheckUtils]: 171: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,121 INFO L273 TraceCheckUtils]: 172: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:31,121 INFO L273 TraceCheckUtils]: 173: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:31,121 INFO L273 TraceCheckUtils]: 174: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,122 INFO L273 TraceCheckUtils]: 175: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:31,122 INFO L273 TraceCheckUtils]: 176: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:31,122 INFO L273 TraceCheckUtils]: 177: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,122 INFO L273 TraceCheckUtils]: 178: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 179: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 180: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 181: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 182: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 183: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 184: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 185: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 186: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,123 INFO L273 TraceCheckUtils]: 187: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 188: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 189: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 190: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 191: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 192: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 193: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 194: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 195: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,124 INFO L273 TraceCheckUtils]: 196: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:31,125 INFO L273 TraceCheckUtils]: 197: Hoare triple {11861#false} havoc ~x~0;~x~0 := 0; {11861#false} is VALID [2018-11-14 18:40:31,125 INFO L273 TraceCheckUtils]: 198: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:31,125 INFO L273 TraceCheckUtils]: 199: Hoare triple {11861#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {11861#false} is VALID [2018-11-14 18:40:31,125 INFO L256 TraceCheckUtils]: 200: Hoare triple {11861#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {11861#false} is VALID [2018-11-14 18:40:31,125 INFO L273 TraceCheckUtils]: 201: Hoare triple {11861#false} ~cond := #in~cond; {11861#false} is VALID [2018-11-14 18:40:31,125 INFO L273 TraceCheckUtils]: 202: Hoare triple {11861#false} assume ~cond == 0; {11861#false} is VALID [2018-11-14 18:40:31,125 INFO L273 TraceCheckUtils]: 203: Hoare triple {11861#false} assume !false; {11861#false} is VALID [2018-11-14 18:40:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-14 18:40:31,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:31,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:40:31,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:40:36,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 18:40:36,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:36,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:37,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {11860#true} call ULTIMATE.init(); {11860#true} is VALID [2018-11-14 18:40:37,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {11860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11860#true} is VALID [2018-11-14 18:40:37,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11860#true} {11860#true} #186#return; {11860#true} is VALID [2018-11-14 18:40:37,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {11860#true} call #t~ret24 := main(); {11860#true} is VALID [2018-11-14 18:40:37,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {11860#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {11860#true} is VALID [2018-11-14 18:40:37,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 26: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11860#true} is VALID [2018-11-14 18:40:37,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {11860#true} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11860#true} is VALID [2018-11-14 18:40:37,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {11860#true} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {11968#(< main_~a~0 100000)} is VALID [2018-11-14 18:40:37,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {11968#(< main_~a~0 100000)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {11972#(<= main_~a~0 100000)} is VALID [2018-11-14 18:40:37,359 INFO L273 TraceCheckUtils]: 33: Hoare triple {11972#(<= main_~a~0 100000)} assume true; {11972#(<= main_~a~0 100000)} is VALID [2018-11-14 18:40:37,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {11972#(<= main_~a~0 100000)} assume !(~a~0 < 100000); {11860#true} is VALID [2018-11-14 18:40:37,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {11860#true} havoc ~i~0;~i~0 := 0; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {11860#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 39: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 40: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 41: Hoare triple {11860#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 43: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11860#true} is VALID [2018-11-14 18:40:37,360 INFO L273 TraceCheckUtils]: 44: Hoare triple {11860#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11860#true} is VALID [2018-11-14 18:40:37,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,361 INFO L273 TraceCheckUtils]: 46: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {11860#true} is VALID [2018-11-14 18:40:37,361 INFO L273 TraceCheckUtils]: 47: Hoare triple {11860#true} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {11860#true} is VALID [2018-11-14 18:40:37,361 INFO L273 TraceCheckUtils]: 48: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,361 INFO L273 TraceCheckUtils]: 49: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {12024#(< main_~i~0 100000)} is VALID [2018-11-14 18:40:37,362 INFO L273 TraceCheckUtils]: 50: Hoare triple {12024#(< main_~i~0 100000)} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,362 INFO L273 TraceCheckUtils]: 51: Hoare triple {12028#(<= main_~i~0 100000)} assume true; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,362 INFO L273 TraceCheckUtils]: 52: Hoare triple {12028#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11860#true} is VALID [2018-11-14 18:40:37,362 INFO L273 TraceCheckUtils]: 53: Hoare triple {11860#true} ~i~0 := 0; {11860#true} is VALID [2018-11-14 18:40:37,362 INFO L273 TraceCheckUtils]: 54: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 55: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 56: Hoare triple {11860#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 57: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 58: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {11860#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 60: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 61: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {11860#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11860#true} is VALID [2018-11-14 18:40:37,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {11860#true} is VALID [2018-11-14 18:40:37,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {11860#true} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {11860#true} is VALID [2018-11-14 18:40:37,364 INFO L273 TraceCheckUtils]: 66: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,364 INFO L273 TraceCheckUtils]: 67: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {12024#(< main_~i~0 100000)} is VALID [2018-11-14 18:40:37,365 INFO L273 TraceCheckUtils]: 68: Hoare triple {12024#(< main_~i~0 100000)} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,365 INFO L273 TraceCheckUtils]: 69: Hoare triple {12028#(<= main_~i~0 100000)} assume true; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,365 INFO L273 TraceCheckUtils]: 70: Hoare triple {12028#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11860#true} is VALID [2018-11-14 18:40:37,365 INFO L273 TraceCheckUtils]: 71: Hoare triple {11860#true} ~i~0 := 0; {11860#true} is VALID [2018-11-14 18:40:37,365 INFO L273 TraceCheckUtils]: 72: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,365 INFO L273 TraceCheckUtils]: 73: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 74: Hoare triple {11860#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 75: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 76: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 77: Hoare triple {11860#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 78: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 79: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 80: Hoare triple {11860#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11860#true} is VALID [2018-11-14 18:40:37,366 INFO L273 TraceCheckUtils]: 81: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,367 INFO L273 TraceCheckUtils]: 82: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {11860#true} is VALID [2018-11-14 18:40:37,367 INFO L273 TraceCheckUtils]: 83: Hoare triple {11860#true} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {11860#true} is VALID [2018-11-14 18:40:37,367 INFO L273 TraceCheckUtils]: 84: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,367 INFO L273 TraceCheckUtils]: 85: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {12024#(< main_~i~0 100000)} is VALID [2018-11-14 18:40:37,368 INFO L273 TraceCheckUtils]: 86: Hoare triple {12024#(< main_~i~0 100000)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,368 INFO L273 TraceCheckUtils]: 87: Hoare triple {12028#(<= main_~i~0 100000)} assume true; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,368 INFO L273 TraceCheckUtils]: 88: Hoare triple {12028#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11860#true} is VALID [2018-11-14 18:40:37,368 INFO L273 TraceCheckUtils]: 89: Hoare triple {11860#true} ~i~0 := 0; {11860#true} is VALID [2018-11-14 18:40:37,368 INFO L273 TraceCheckUtils]: 90: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,368 INFO L273 TraceCheckUtils]: 91: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 92: Hoare triple {11860#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 93: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 94: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 95: Hoare triple {11860#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 96: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 97: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 98: Hoare triple {11860#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 99: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,369 INFO L273 TraceCheckUtils]: 100: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11860#true} is VALID [2018-11-14 18:40:37,370 INFO L273 TraceCheckUtils]: 101: Hoare triple {11860#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11860#true} is VALID [2018-11-14 18:40:37,370 INFO L273 TraceCheckUtils]: 102: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,370 INFO L273 TraceCheckUtils]: 103: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {11860#true} is VALID [2018-11-14 18:40:37,370 INFO L273 TraceCheckUtils]: 104: Hoare triple {11860#true} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {11860#true} is VALID [2018-11-14 18:40:37,370 INFO L273 TraceCheckUtils]: 105: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,370 INFO L273 TraceCheckUtils]: 106: Hoare triple {11860#true} assume !(~i~0 < 100000); {11860#true} is VALID [2018-11-14 18:40:37,371 INFO L273 TraceCheckUtils]: 107: Hoare triple {11860#true} ~i~0 := 0; {11860#true} is VALID [2018-11-14 18:40:37,371 INFO L273 TraceCheckUtils]: 108: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,371 INFO L273 TraceCheckUtils]: 109: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11860#true} is VALID [2018-11-14 18:40:37,371 INFO L273 TraceCheckUtils]: 110: Hoare triple {11860#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11860#true} is VALID [2018-11-14 18:40:37,371 INFO L273 TraceCheckUtils]: 111: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,371 INFO L273 TraceCheckUtils]: 112: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 113: Hoare triple {11860#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 114: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 115: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 116: Hoare triple {11860#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 117: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 118: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 119: Hoare triple {11860#true} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {11860#true} is VALID [2018-11-14 18:40:37,372 INFO L273 TraceCheckUtils]: 120: Hoare triple {11860#true} assume true; {11860#true} is VALID [2018-11-14 18:40:37,373 INFO L273 TraceCheckUtils]: 121: Hoare triple {11860#true} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {12024#(< main_~i~0 100000)} is VALID [2018-11-14 18:40:37,373 INFO L273 TraceCheckUtils]: 122: Hoare triple {12024#(< main_~i~0 100000)} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,374 INFO L273 TraceCheckUtils]: 123: Hoare triple {12028#(<= main_~i~0 100000)} assume true; {12028#(<= main_~i~0 100000)} is VALID [2018-11-14 18:40:37,374 INFO L273 TraceCheckUtils]: 124: Hoare triple {12028#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {11860#true} is VALID [2018-11-14 18:40:37,374 INFO L273 TraceCheckUtils]: 125: Hoare triple {11860#true} ~i~0 := 0; {12254#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:37,374 INFO L273 TraceCheckUtils]: 126: Hoare triple {12254#(<= main_~i~0 0)} assume true; {12254#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:37,375 INFO L273 TraceCheckUtils]: 127: Hoare triple {12254#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {12254#(<= main_~i~0 0)} is VALID [2018-11-14 18:40:37,375 INFO L273 TraceCheckUtils]: 128: Hoare triple {12254#(<= main_~i~0 0)} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {12264#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:37,376 INFO L273 TraceCheckUtils]: 129: Hoare triple {12264#(<= main_~i~0 1)} assume true; {12264#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:37,376 INFO L273 TraceCheckUtils]: 130: Hoare triple {12264#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {12264#(<= main_~i~0 1)} is VALID [2018-11-14 18:40:37,376 INFO L273 TraceCheckUtils]: 131: Hoare triple {12264#(<= main_~i~0 1)} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {12274#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:37,377 INFO L273 TraceCheckUtils]: 132: Hoare triple {12274#(<= main_~i~0 2)} assume true; {12274#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:37,377 INFO L273 TraceCheckUtils]: 133: Hoare triple {12274#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {12274#(<= main_~i~0 2)} is VALID [2018-11-14 18:40:37,378 INFO L273 TraceCheckUtils]: 134: Hoare triple {12274#(<= main_~i~0 2)} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {12284#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:37,378 INFO L273 TraceCheckUtils]: 135: Hoare triple {12284#(<= main_~i~0 3)} assume true; {12284#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:37,379 INFO L273 TraceCheckUtils]: 136: Hoare triple {12284#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {12284#(<= main_~i~0 3)} is VALID [2018-11-14 18:40:37,380 INFO L273 TraceCheckUtils]: 137: Hoare triple {12284#(<= main_~i~0 3)} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {12294#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:37,380 INFO L273 TraceCheckUtils]: 138: Hoare triple {12294#(<= main_~i~0 4)} assume true; {12294#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:37,381 INFO L273 TraceCheckUtils]: 139: Hoare triple {12294#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {12294#(<= main_~i~0 4)} is VALID [2018-11-14 18:40:37,381 INFO L273 TraceCheckUtils]: 140: Hoare triple {12294#(<= main_~i~0 4)} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {12304#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:37,382 INFO L273 TraceCheckUtils]: 141: Hoare triple {12304#(<= main_~i~0 5)} assume true; {12304#(<= main_~i~0 5)} is VALID [2018-11-14 18:40:37,383 INFO L273 TraceCheckUtils]: 142: Hoare triple {12304#(<= main_~i~0 5)} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:37,383 INFO L273 TraceCheckUtils]: 143: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:37,383 INFO L273 TraceCheckUtils]: 144: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,383 INFO L273 TraceCheckUtils]: 145: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:37,384 INFO L273 TraceCheckUtils]: 146: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:37,384 INFO L273 TraceCheckUtils]: 147: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,384 INFO L273 TraceCheckUtils]: 148: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:37,384 INFO L273 TraceCheckUtils]: 149: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:37,384 INFO L273 TraceCheckUtils]: 150: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,385 INFO L273 TraceCheckUtils]: 151: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:37,385 INFO L273 TraceCheckUtils]: 152: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:37,385 INFO L273 TraceCheckUtils]: 153: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,386 INFO L273 TraceCheckUtils]: 154: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:37,386 INFO L273 TraceCheckUtils]: 155: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:37,386 INFO L273 TraceCheckUtils]: 156: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,386 INFO L273 TraceCheckUtils]: 157: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {11861#false} is VALID [2018-11-14 18:40:37,387 INFO L273 TraceCheckUtils]: 158: Hoare triple {11861#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {11861#false} is VALID [2018-11-14 18:40:37,387 INFO L273 TraceCheckUtils]: 159: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,387 INFO L273 TraceCheckUtils]: 160: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:37,387 INFO L273 TraceCheckUtils]: 161: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:37,387 INFO L273 TraceCheckUtils]: 162: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,387 INFO L273 TraceCheckUtils]: 163: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:37,388 INFO L273 TraceCheckUtils]: 164: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:37,388 INFO L273 TraceCheckUtils]: 165: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,388 INFO L273 TraceCheckUtils]: 166: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:37,388 INFO L273 TraceCheckUtils]: 167: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:37,388 INFO L273 TraceCheckUtils]: 168: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,388 INFO L273 TraceCheckUtils]: 169: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:37,389 INFO L273 TraceCheckUtils]: 170: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:37,389 INFO L273 TraceCheckUtils]: 171: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,389 INFO L273 TraceCheckUtils]: 172: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:37,389 INFO L273 TraceCheckUtils]: 173: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:37,389 INFO L273 TraceCheckUtils]: 174: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,389 INFO L273 TraceCheckUtils]: 175: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {11861#false} is VALID [2018-11-14 18:40:37,389 INFO L273 TraceCheckUtils]: 176: Hoare triple {11861#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {11861#false} is VALID [2018-11-14 18:40:37,390 INFO L273 TraceCheckUtils]: 177: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,390 INFO L273 TraceCheckUtils]: 178: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:37,390 INFO L273 TraceCheckUtils]: 179: Hoare triple {11861#false} ~i~0 := 0; {11861#false} is VALID [2018-11-14 18:40:37,390 INFO L273 TraceCheckUtils]: 180: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,390 INFO L273 TraceCheckUtils]: 181: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:37,390 INFO L273 TraceCheckUtils]: 182: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:37,391 INFO L273 TraceCheckUtils]: 183: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,391 INFO L273 TraceCheckUtils]: 184: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:37,391 INFO L273 TraceCheckUtils]: 185: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:37,391 INFO L273 TraceCheckUtils]: 186: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,391 INFO L273 TraceCheckUtils]: 187: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:37,391 INFO L273 TraceCheckUtils]: 188: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:37,392 INFO L273 TraceCheckUtils]: 189: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,392 INFO L273 TraceCheckUtils]: 190: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:37,392 INFO L273 TraceCheckUtils]: 191: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:37,392 INFO L273 TraceCheckUtils]: 192: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,392 INFO L273 TraceCheckUtils]: 193: Hoare triple {11861#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {11861#false} is VALID [2018-11-14 18:40:37,393 INFO L273 TraceCheckUtils]: 194: Hoare triple {11861#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {11861#false} is VALID [2018-11-14 18:40:37,393 INFO L273 TraceCheckUtils]: 195: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,393 INFO L273 TraceCheckUtils]: 196: Hoare triple {11861#false} assume !(~i~0 < 100000); {11861#false} is VALID [2018-11-14 18:40:37,393 INFO L273 TraceCheckUtils]: 197: Hoare triple {11861#false} havoc ~x~0;~x~0 := 0; {11861#false} is VALID [2018-11-14 18:40:37,393 INFO L273 TraceCheckUtils]: 198: Hoare triple {11861#false} assume true; {11861#false} is VALID [2018-11-14 18:40:37,393 INFO L273 TraceCheckUtils]: 199: Hoare triple {11861#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {11861#false} is VALID [2018-11-14 18:40:37,394 INFO L256 TraceCheckUtils]: 200: Hoare triple {11861#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {11861#false} is VALID [2018-11-14 18:40:37,394 INFO L273 TraceCheckUtils]: 201: Hoare triple {11861#false} ~cond := #in~cond; {11861#false} is VALID [2018-11-14 18:40:37,394 INFO L273 TraceCheckUtils]: 202: Hoare triple {11861#false} assume ~cond == 0; {11861#false} is VALID [2018-11-14 18:40:37,394 INFO L273 TraceCheckUtils]: 203: Hoare triple {11861#false} assume !false; {11861#false} is VALID [2018-11-14 18:40:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 82 proven. 40 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-14 18:40:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-14 18:40:37,443 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 204 [2018-11-14 18:40:37,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:37,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:40:37,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:37,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:40:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:40:37,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:40:37,598 INFO L87 Difference]: Start difference. First operand 209 states and 219 transitions. Second operand 22 states. [2018-11-14 18:40:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:39,183 INFO L93 Difference]: Finished difference Result 443 states and 482 transitions. [2018-11-14 18:40:39,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:40:39,183 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 204 [2018-11-14 18:40:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:40:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 356 transitions. [2018-11-14 18:40:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:40:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 356 transitions. [2018-11-14 18:40:39,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 356 transitions. [2018-11-14 18:40:40,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:40,138 INFO L225 Difference]: With dead ends: 443 [2018-11-14 18:40:40,138 INFO L226 Difference]: Without dead ends: 269 [2018-11-14 18:40:40,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:40:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-14 18:40:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-14 18:40:40,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:40,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand 269 states. [2018-11-14 18:40:40,542 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 269 states. [2018-11-14 18:40:40,543 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 269 states. [2018-11-14 18:40:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:40,549 INFO L93 Difference]: Finished difference Result 269 states and 279 transitions. [2018-11-14 18:40:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 279 transitions. [2018-11-14 18:40:40,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:40,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:40,551 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 269 states. [2018-11-14 18:40:40,551 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 269 states. [2018-11-14 18:40:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:40,558 INFO L93 Difference]: Finished difference Result 269 states and 279 transitions. [2018-11-14 18:40:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 279 transitions. [2018-11-14 18:40:40,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:40,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:40,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:40,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-14 18:40:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 279 transitions. [2018-11-14 18:40:40,567 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 279 transitions. Word has length 204 [2018-11-14 18:40:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:40,567 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 279 transitions. [2018-11-14 18:40:40,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:40:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 279 transitions. [2018-11-14 18:40:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-14 18:40:40,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:40,569 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:40,570 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:40,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash -366724097, now seen corresponding path program 10 times [2018-11-14 18:40:40,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:40,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:40,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:40,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:40,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:41,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {14006#true} call ULTIMATE.init(); {14006#true} is VALID [2018-11-14 18:40:41,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {14006#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14006#true} is VALID [2018-11-14 18:40:41,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {14006#true} assume true; {14006#true} is VALID [2018-11-14 18:40:41,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14006#true} {14006#true} #186#return; {14006#true} is VALID [2018-11-14 18:40:41,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {14006#true} call #t~ret24 := main(); {14006#true} is VALID [2018-11-14 18:40:41,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {14006#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14008#(= main_~a~0 0)} is VALID [2018-11-14 18:40:41,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {14008#(= main_~a~0 0)} assume true; {14008#(= main_~a~0 0)} is VALID [2018-11-14 18:40:41,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {14008#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14008#(= main_~a~0 0)} is VALID [2018-11-14 18:40:41,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {14008#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14009#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:41,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {14009#(<= main_~a~0 1)} assume true; {14009#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:41,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {14009#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14009#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:41,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {14009#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14010#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:41,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {14010#(<= main_~a~0 2)} assume true; {14010#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:41,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {14010#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14010#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:41,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {14010#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14011#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:41,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {14011#(<= main_~a~0 3)} assume true; {14011#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:41,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {14011#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14011#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:41,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {14011#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14012#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:41,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {14012#(<= main_~a~0 4)} assume true; {14012#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:41,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {14012#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14012#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:41,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {14012#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14013#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:41,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {14013#(<= main_~a~0 5)} assume true; {14013#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:41,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {14013#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14013#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:41,867 INFO L273 TraceCheckUtils]: 23: Hoare triple {14013#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14014#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:41,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {14014#(<= main_~a~0 6)} assume true; {14014#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:41,868 INFO L273 TraceCheckUtils]: 25: Hoare triple {14014#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14014#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:41,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {14014#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14015#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:41,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {14015#(<= main_~a~0 7)} assume true; {14015#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:41,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {14015#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14015#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:41,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {14015#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14016#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:41,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {14016#(<= main_~a~0 8)} assume true; {14016#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:41,872 INFO L273 TraceCheckUtils]: 31: Hoare triple {14016#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14016#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:41,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {14016#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14017#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:41,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {14017#(<= main_~a~0 9)} assume true; {14017#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:41,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {14017#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14017#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:41,874 INFO L273 TraceCheckUtils]: 35: Hoare triple {14017#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14018#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:41,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {14018#(<= main_~a~0 10)} assume true; {14018#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:41,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {14018#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14018#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:41,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {14018#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14019#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:41,877 INFO L273 TraceCheckUtils]: 39: Hoare triple {14019#(<= main_~a~0 11)} assume true; {14019#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:41,877 INFO L273 TraceCheckUtils]: 40: Hoare triple {14019#(<= main_~a~0 11)} assume !(~a~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,878 INFO L273 TraceCheckUtils]: 41: Hoare triple {14007#false} havoc ~i~0;~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:41,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:41,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:41,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:41,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:41,880 INFO L273 TraceCheckUtils]: 50: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:41,880 INFO L273 TraceCheckUtils]: 51: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,881 INFO L273 TraceCheckUtils]: 52: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:41,881 INFO L273 TraceCheckUtils]: 53: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:41,881 INFO L273 TraceCheckUtils]: 54: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,881 INFO L273 TraceCheckUtils]: 55: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:41,881 INFO L273 TraceCheckUtils]: 56: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:41,881 INFO L273 TraceCheckUtils]: 57: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 58: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 59: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 60: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 61: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 64: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 65: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,882 INFO L273 TraceCheckUtils]: 66: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 67: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 68: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 69: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 70: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 71: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 72: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 73: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:41,883 INFO L273 TraceCheckUtils]: 74: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 75: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 76: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 77: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 78: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 79: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 80: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 81: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,884 INFO L273 TraceCheckUtils]: 82: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 83: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 84: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 85: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 86: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 87: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 88: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 89: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 90: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,885 INFO L273 TraceCheckUtils]: 91: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 92: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 93: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 94: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 95: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 96: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 97: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 98: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 99: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,886 INFO L273 TraceCheckUtils]: 100: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 101: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 102: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 103: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 104: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 105: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 106: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 107: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:41,887 INFO L273 TraceCheckUtils]: 108: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 109: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 110: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 111: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 112: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 113: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 114: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 115: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 116: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:41,888 INFO L273 TraceCheckUtils]: 117: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 118: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 119: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 120: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 121: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 122: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 123: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 124: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:41,889 INFO L273 TraceCheckUtils]: 125: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:41,890 INFO L273 TraceCheckUtils]: 126: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,890 INFO L273 TraceCheckUtils]: 127: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:41,890 INFO L273 TraceCheckUtils]: 128: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:41,890 INFO L273 TraceCheckUtils]: 129: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,890 INFO L273 TraceCheckUtils]: 130: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:41,890 INFO L273 TraceCheckUtils]: 131: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:41,891 INFO L273 TraceCheckUtils]: 132: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,891 INFO L273 TraceCheckUtils]: 133: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:41,891 INFO L273 TraceCheckUtils]: 134: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:41,891 INFO L273 TraceCheckUtils]: 135: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,891 INFO L273 TraceCheckUtils]: 136: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,891 INFO L273 TraceCheckUtils]: 137: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,892 INFO L273 TraceCheckUtils]: 138: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,892 INFO L273 TraceCheckUtils]: 139: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:41,892 INFO L273 TraceCheckUtils]: 140: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:41,892 INFO L273 TraceCheckUtils]: 141: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,892 INFO L273 TraceCheckUtils]: 142: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:41,893 INFO L273 TraceCheckUtils]: 143: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:41,893 INFO L273 TraceCheckUtils]: 144: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,893 INFO L273 TraceCheckUtils]: 145: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:41,893 INFO L273 TraceCheckUtils]: 146: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:41,893 INFO L273 TraceCheckUtils]: 147: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,893 INFO L273 TraceCheckUtils]: 148: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:41,894 INFO L273 TraceCheckUtils]: 149: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:41,894 INFO L273 TraceCheckUtils]: 150: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,894 INFO L273 TraceCheckUtils]: 151: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:41,894 INFO L273 TraceCheckUtils]: 152: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:41,894 INFO L273 TraceCheckUtils]: 153: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,894 INFO L273 TraceCheckUtils]: 154: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:41,895 INFO L273 TraceCheckUtils]: 155: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:41,895 INFO L273 TraceCheckUtils]: 156: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,895 INFO L273 TraceCheckUtils]: 157: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:41,895 INFO L273 TraceCheckUtils]: 158: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:41,895 INFO L273 TraceCheckUtils]: 159: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,896 INFO L273 TraceCheckUtils]: 160: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,896 INFO L273 TraceCheckUtils]: 161: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,896 INFO L273 TraceCheckUtils]: 162: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,896 INFO L273 TraceCheckUtils]: 163: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:41,896 INFO L273 TraceCheckUtils]: 164: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:41,896 INFO L273 TraceCheckUtils]: 165: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,897 INFO L273 TraceCheckUtils]: 166: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:41,897 INFO L273 TraceCheckUtils]: 167: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:41,897 INFO L273 TraceCheckUtils]: 168: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,897 INFO L273 TraceCheckUtils]: 169: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:41,897 INFO L273 TraceCheckUtils]: 170: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:41,897 INFO L273 TraceCheckUtils]: 171: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,898 INFO L273 TraceCheckUtils]: 172: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:41,898 INFO L273 TraceCheckUtils]: 173: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:41,898 INFO L273 TraceCheckUtils]: 174: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,898 INFO L273 TraceCheckUtils]: 175: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:41,898 INFO L273 TraceCheckUtils]: 176: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:41,899 INFO L273 TraceCheckUtils]: 177: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,899 INFO L273 TraceCheckUtils]: 178: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:41,899 INFO L273 TraceCheckUtils]: 179: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:41,899 INFO L273 TraceCheckUtils]: 180: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,899 INFO L273 TraceCheckUtils]: 181: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:41,899 INFO L273 TraceCheckUtils]: 182: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:41,900 INFO L273 TraceCheckUtils]: 183: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,900 INFO L273 TraceCheckUtils]: 184: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,900 INFO L273 TraceCheckUtils]: 185: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,900 INFO L273 TraceCheckUtils]: 186: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,900 INFO L273 TraceCheckUtils]: 187: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:41,901 INFO L273 TraceCheckUtils]: 188: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:41,901 INFO L273 TraceCheckUtils]: 189: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,901 INFO L273 TraceCheckUtils]: 190: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:41,901 INFO L273 TraceCheckUtils]: 191: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:41,901 INFO L273 TraceCheckUtils]: 192: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,901 INFO L273 TraceCheckUtils]: 193: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:41,902 INFO L273 TraceCheckUtils]: 194: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:41,902 INFO L273 TraceCheckUtils]: 195: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,902 INFO L273 TraceCheckUtils]: 196: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:41,902 INFO L273 TraceCheckUtils]: 197: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:41,902 INFO L273 TraceCheckUtils]: 198: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,902 INFO L273 TraceCheckUtils]: 199: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:41,903 INFO L273 TraceCheckUtils]: 200: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:41,903 INFO L273 TraceCheckUtils]: 201: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,903 INFO L273 TraceCheckUtils]: 202: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:41,903 INFO L273 TraceCheckUtils]: 203: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:41,903 INFO L273 TraceCheckUtils]: 204: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,903 INFO L273 TraceCheckUtils]: 205: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:41,904 INFO L273 TraceCheckUtils]: 206: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:41,904 INFO L273 TraceCheckUtils]: 207: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,904 INFO L273 TraceCheckUtils]: 208: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,904 INFO L273 TraceCheckUtils]: 209: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,904 INFO L273 TraceCheckUtils]: 210: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,904 INFO L273 TraceCheckUtils]: 211: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:41,905 INFO L273 TraceCheckUtils]: 212: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:41,905 INFO L273 TraceCheckUtils]: 213: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,905 INFO L273 TraceCheckUtils]: 214: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:41,905 INFO L273 TraceCheckUtils]: 215: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:41,905 INFO L273 TraceCheckUtils]: 216: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,905 INFO L273 TraceCheckUtils]: 217: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:41,906 INFO L273 TraceCheckUtils]: 218: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:41,906 INFO L273 TraceCheckUtils]: 219: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,906 INFO L273 TraceCheckUtils]: 220: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:41,906 INFO L273 TraceCheckUtils]: 221: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:41,906 INFO L273 TraceCheckUtils]: 222: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,907 INFO L273 TraceCheckUtils]: 223: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:41,907 INFO L273 TraceCheckUtils]: 224: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:41,907 INFO L273 TraceCheckUtils]: 225: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,907 INFO L273 TraceCheckUtils]: 226: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:41,907 INFO L273 TraceCheckUtils]: 227: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:41,907 INFO L273 TraceCheckUtils]: 228: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,908 INFO L273 TraceCheckUtils]: 229: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:41,908 INFO L273 TraceCheckUtils]: 230: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:41,908 INFO L273 TraceCheckUtils]: 231: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,908 INFO L273 TraceCheckUtils]: 232: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,908 INFO L273 TraceCheckUtils]: 233: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,908 INFO L273 TraceCheckUtils]: 234: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,908 INFO L273 TraceCheckUtils]: 235: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:41,909 INFO L273 TraceCheckUtils]: 236: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:41,909 INFO L273 TraceCheckUtils]: 237: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,909 INFO L273 TraceCheckUtils]: 238: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:41,909 INFO L273 TraceCheckUtils]: 239: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:41,909 INFO L273 TraceCheckUtils]: 240: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,909 INFO L273 TraceCheckUtils]: 241: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:41,910 INFO L273 TraceCheckUtils]: 242: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:41,910 INFO L273 TraceCheckUtils]: 243: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,910 INFO L273 TraceCheckUtils]: 244: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:41,910 INFO L273 TraceCheckUtils]: 245: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:41,910 INFO L273 TraceCheckUtils]: 246: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,910 INFO L273 TraceCheckUtils]: 247: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:41,911 INFO L273 TraceCheckUtils]: 248: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:41,911 INFO L273 TraceCheckUtils]: 249: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,911 INFO L273 TraceCheckUtils]: 250: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:41,911 INFO L273 TraceCheckUtils]: 251: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:41,911 INFO L273 TraceCheckUtils]: 252: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,911 INFO L273 TraceCheckUtils]: 253: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:41,912 INFO L273 TraceCheckUtils]: 254: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:41,912 INFO L273 TraceCheckUtils]: 255: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,912 INFO L273 TraceCheckUtils]: 256: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:41,912 INFO L273 TraceCheckUtils]: 257: Hoare triple {14007#false} havoc ~x~0;~x~0 := 0; {14007#false} is VALID [2018-11-14 18:40:41,912 INFO L273 TraceCheckUtils]: 258: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:41,912 INFO L273 TraceCheckUtils]: 259: Hoare triple {14007#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {14007#false} is VALID [2018-11-14 18:40:41,913 INFO L256 TraceCheckUtils]: 260: Hoare triple {14007#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {14007#false} is VALID [2018-11-14 18:40:41,913 INFO L273 TraceCheckUtils]: 261: Hoare triple {14007#false} ~cond := #in~cond; {14007#false} is VALID [2018-11-14 18:40:41,913 INFO L273 TraceCheckUtils]: 262: Hoare triple {14007#false} assume ~cond == 0; {14007#false} is VALID [2018-11-14 18:40:41,913 INFO L273 TraceCheckUtils]: 263: Hoare triple {14007#false} assume !false; {14007#false} is VALID [2018-11-14 18:40:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-14 18:40:41,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:41,949 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-14 18:40:41,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:40:42,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:40:42,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:40:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:42,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:40:42,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {14006#true} call ULTIMATE.init(); {14006#true} is VALID [2018-11-14 18:40:42,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {14006#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14006#true} is VALID [2018-11-14 18:40:42,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {14006#true} assume true; {14006#true} is VALID [2018-11-14 18:40:42,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14006#true} {14006#true} #186#return; {14006#true} is VALID [2018-11-14 18:40:42,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {14006#true} call #t~ret24 := main(); {14006#true} is VALID [2018-11-14 18:40:42,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {14006#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {14038#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:42,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {14038#(<= main_~a~0 0)} assume true; {14038#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:42,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {14038#(<= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14038#(<= main_~a~0 0)} is VALID [2018-11-14 18:40:42,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {14038#(<= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14009#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:42,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {14009#(<= main_~a~0 1)} assume true; {14009#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:42,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {14009#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14009#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:42,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {14009#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14010#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:42,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {14010#(<= main_~a~0 2)} assume true; {14010#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:42,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {14010#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14010#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:42,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {14010#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14011#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:42,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {14011#(<= main_~a~0 3)} assume true; {14011#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:42,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {14011#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14011#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:42,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {14011#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14012#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:42,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {14012#(<= main_~a~0 4)} assume true; {14012#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:42,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {14012#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14012#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:42,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {14012#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14013#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:42,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {14013#(<= main_~a~0 5)} assume true; {14013#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:42,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {14013#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14013#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:42,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {14013#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14014#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:42,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {14014#(<= main_~a~0 6)} assume true; {14014#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:42,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {14014#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14014#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:42,409 INFO L273 TraceCheckUtils]: 26: Hoare triple {14014#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14015#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:42,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {14015#(<= main_~a~0 7)} assume true; {14015#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:42,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {14015#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14015#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:42,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {14015#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14016#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:42,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {14016#(<= main_~a~0 8)} assume true; {14016#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:42,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {14016#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14016#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:42,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {14016#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14017#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:42,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {14017#(<= main_~a~0 9)} assume true; {14017#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:42,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {14017#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14017#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:42,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {14017#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14018#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:42,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {14018#(<= main_~a~0 10)} assume true; {14018#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:42,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {14018#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {14018#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:42,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {14018#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {14019#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:42,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {14019#(<= main_~a~0 11)} assume true; {14019#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:42,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {14019#(<= main_~a~0 11)} assume !(~a~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {14007#false} havoc ~i~0;~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:42,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:42,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:42,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:42,419 INFO L273 TraceCheckUtils]: 48: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:42,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:42,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 56: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 57: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 58: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:42,420 INFO L273 TraceCheckUtils]: 59: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 61: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 62: Hoare triple {14007#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 63: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 64: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 65: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 66: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:42,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 69: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 70: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 71: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 72: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 75: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 76: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:42,422 INFO L273 TraceCheckUtils]: 77: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 78: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 79: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 80: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 81: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 82: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 83: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 84: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,423 INFO L273 TraceCheckUtils]: 85: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 86: Hoare triple {14007#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 87: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 88: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 89: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 90: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 91: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 92: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:42,424 INFO L273 TraceCheckUtils]: 93: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 94: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 95: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 96: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 97: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 98: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 99: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 100: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 101: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:42,425 INFO L273 TraceCheckUtils]: 102: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 103: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 104: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 105: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 106: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 107: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 108: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 109: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 110: Hoare triple {14007#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {14007#false} is VALID [2018-11-14 18:40:42,426 INFO L273 TraceCheckUtils]: 111: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 112: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 113: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 114: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 115: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 116: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 117: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 118: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:42,427 INFO L273 TraceCheckUtils]: 119: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:42,429 INFO L273 TraceCheckUtils]: 120: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,429 INFO L273 TraceCheckUtils]: 121: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:42,429 INFO L273 TraceCheckUtils]: 122: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:42,429 INFO L273 TraceCheckUtils]: 123: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,429 INFO L273 TraceCheckUtils]: 124: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:42,430 INFO L273 TraceCheckUtils]: 125: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:42,430 INFO L273 TraceCheckUtils]: 126: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,430 INFO L273 TraceCheckUtils]: 127: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:42,430 INFO L273 TraceCheckUtils]: 128: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:42,430 INFO L273 TraceCheckUtils]: 129: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,430 INFO L273 TraceCheckUtils]: 130: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:42,431 INFO L273 TraceCheckUtils]: 131: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:42,431 INFO L273 TraceCheckUtils]: 132: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,431 INFO L273 TraceCheckUtils]: 133: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {14007#false} is VALID [2018-11-14 18:40:42,431 INFO L273 TraceCheckUtils]: 134: Hoare triple {14007#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {14007#false} is VALID [2018-11-14 18:40:42,431 INFO L273 TraceCheckUtils]: 135: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,431 INFO L273 TraceCheckUtils]: 136: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,432 INFO L273 TraceCheckUtils]: 137: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,432 INFO L273 TraceCheckUtils]: 138: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,432 INFO L273 TraceCheckUtils]: 139: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:42,432 INFO L273 TraceCheckUtils]: 140: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:42,432 INFO L273 TraceCheckUtils]: 141: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,432 INFO L273 TraceCheckUtils]: 142: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:42,433 INFO L273 TraceCheckUtils]: 143: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:42,433 INFO L273 TraceCheckUtils]: 144: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,433 INFO L273 TraceCheckUtils]: 145: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:42,433 INFO L273 TraceCheckUtils]: 146: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:42,433 INFO L273 TraceCheckUtils]: 147: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,433 INFO L273 TraceCheckUtils]: 148: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:42,434 INFO L273 TraceCheckUtils]: 149: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:42,434 INFO L273 TraceCheckUtils]: 150: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,434 INFO L273 TraceCheckUtils]: 151: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:42,434 INFO L273 TraceCheckUtils]: 152: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:42,434 INFO L273 TraceCheckUtils]: 153: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,434 INFO L273 TraceCheckUtils]: 154: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:42,434 INFO L273 TraceCheckUtils]: 155: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:42,435 INFO L273 TraceCheckUtils]: 156: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,435 INFO L273 TraceCheckUtils]: 157: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {14007#false} is VALID [2018-11-14 18:40:42,435 INFO L273 TraceCheckUtils]: 158: Hoare triple {14007#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {14007#false} is VALID [2018-11-14 18:40:42,435 INFO L273 TraceCheckUtils]: 159: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,435 INFO L273 TraceCheckUtils]: 160: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,435 INFO L273 TraceCheckUtils]: 161: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,436 INFO L273 TraceCheckUtils]: 162: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,436 INFO L273 TraceCheckUtils]: 163: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:42,436 INFO L273 TraceCheckUtils]: 164: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:42,436 INFO L273 TraceCheckUtils]: 165: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,436 INFO L273 TraceCheckUtils]: 166: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:42,436 INFO L273 TraceCheckUtils]: 167: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:42,437 INFO L273 TraceCheckUtils]: 168: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,437 INFO L273 TraceCheckUtils]: 169: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:42,437 INFO L273 TraceCheckUtils]: 170: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:42,437 INFO L273 TraceCheckUtils]: 171: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,437 INFO L273 TraceCheckUtils]: 172: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:42,437 INFO L273 TraceCheckUtils]: 173: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:42,438 INFO L273 TraceCheckUtils]: 174: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,438 INFO L273 TraceCheckUtils]: 175: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:42,438 INFO L273 TraceCheckUtils]: 176: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:42,438 INFO L273 TraceCheckUtils]: 177: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,438 INFO L273 TraceCheckUtils]: 178: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:42,438 INFO L273 TraceCheckUtils]: 179: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:42,439 INFO L273 TraceCheckUtils]: 180: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,439 INFO L273 TraceCheckUtils]: 181: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {14007#false} is VALID [2018-11-14 18:40:42,439 INFO L273 TraceCheckUtils]: 182: Hoare triple {14007#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {14007#false} is VALID [2018-11-14 18:40:42,439 INFO L273 TraceCheckUtils]: 183: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,439 INFO L273 TraceCheckUtils]: 184: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,439 INFO L273 TraceCheckUtils]: 185: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,439 INFO L273 TraceCheckUtils]: 186: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,440 INFO L273 TraceCheckUtils]: 187: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:42,440 INFO L273 TraceCheckUtils]: 188: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:42,440 INFO L273 TraceCheckUtils]: 189: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,440 INFO L273 TraceCheckUtils]: 190: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:42,440 INFO L273 TraceCheckUtils]: 191: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:42,440 INFO L273 TraceCheckUtils]: 192: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,441 INFO L273 TraceCheckUtils]: 193: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:42,441 INFO L273 TraceCheckUtils]: 194: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:42,441 INFO L273 TraceCheckUtils]: 195: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,441 INFO L273 TraceCheckUtils]: 196: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:42,441 INFO L273 TraceCheckUtils]: 197: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:42,441 INFO L273 TraceCheckUtils]: 198: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,442 INFO L273 TraceCheckUtils]: 199: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:42,442 INFO L273 TraceCheckUtils]: 200: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:42,442 INFO L273 TraceCheckUtils]: 201: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,442 INFO L273 TraceCheckUtils]: 202: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:42,442 INFO L273 TraceCheckUtils]: 203: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:42,442 INFO L273 TraceCheckUtils]: 204: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,442 INFO L273 TraceCheckUtils]: 205: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {14007#false} is VALID [2018-11-14 18:40:42,443 INFO L273 TraceCheckUtils]: 206: Hoare triple {14007#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {14007#false} is VALID [2018-11-14 18:40:42,443 INFO L273 TraceCheckUtils]: 207: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,443 INFO L273 TraceCheckUtils]: 208: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,443 INFO L273 TraceCheckUtils]: 209: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,443 INFO L273 TraceCheckUtils]: 210: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,443 INFO L273 TraceCheckUtils]: 211: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:42,444 INFO L273 TraceCheckUtils]: 212: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:42,444 INFO L273 TraceCheckUtils]: 213: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,444 INFO L273 TraceCheckUtils]: 214: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:42,444 INFO L273 TraceCheckUtils]: 215: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:42,444 INFO L273 TraceCheckUtils]: 216: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,444 INFO L273 TraceCheckUtils]: 217: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:42,445 INFO L273 TraceCheckUtils]: 218: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:42,445 INFO L273 TraceCheckUtils]: 219: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,445 INFO L273 TraceCheckUtils]: 220: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:42,445 INFO L273 TraceCheckUtils]: 221: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:42,445 INFO L273 TraceCheckUtils]: 222: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,445 INFO L273 TraceCheckUtils]: 223: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:42,445 INFO L273 TraceCheckUtils]: 224: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:42,446 INFO L273 TraceCheckUtils]: 225: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,446 INFO L273 TraceCheckUtils]: 226: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:42,446 INFO L273 TraceCheckUtils]: 227: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:42,446 INFO L273 TraceCheckUtils]: 228: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,446 INFO L273 TraceCheckUtils]: 229: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {14007#false} is VALID [2018-11-14 18:40:42,446 INFO L273 TraceCheckUtils]: 230: Hoare triple {14007#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {14007#false} is VALID [2018-11-14 18:40:42,447 INFO L273 TraceCheckUtils]: 231: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,447 INFO L273 TraceCheckUtils]: 232: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,447 INFO L273 TraceCheckUtils]: 233: Hoare triple {14007#false} ~i~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,447 INFO L273 TraceCheckUtils]: 234: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,447 INFO L273 TraceCheckUtils]: 235: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:42,447 INFO L273 TraceCheckUtils]: 236: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:42,448 INFO L273 TraceCheckUtils]: 237: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,448 INFO L273 TraceCheckUtils]: 238: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:42,448 INFO L273 TraceCheckUtils]: 239: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:42,448 INFO L273 TraceCheckUtils]: 240: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,448 INFO L273 TraceCheckUtils]: 241: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:42,449 INFO L273 TraceCheckUtils]: 242: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:42,449 INFO L273 TraceCheckUtils]: 243: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,449 INFO L273 TraceCheckUtils]: 244: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:42,449 INFO L273 TraceCheckUtils]: 245: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:42,449 INFO L273 TraceCheckUtils]: 246: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,449 INFO L273 TraceCheckUtils]: 247: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:42,449 INFO L273 TraceCheckUtils]: 248: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:42,450 INFO L273 TraceCheckUtils]: 249: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,450 INFO L273 TraceCheckUtils]: 250: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:42,450 INFO L273 TraceCheckUtils]: 251: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:42,450 INFO L273 TraceCheckUtils]: 252: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,450 INFO L273 TraceCheckUtils]: 253: Hoare triple {14007#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {14007#false} is VALID [2018-11-14 18:40:42,450 INFO L273 TraceCheckUtils]: 254: Hoare triple {14007#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {14007#false} is VALID [2018-11-14 18:40:42,450 INFO L273 TraceCheckUtils]: 255: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L273 TraceCheckUtils]: 256: Hoare triple {14007#false} assume !(~i~0 < 100000); {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L273 TraceCheckUtils]: 257: Hoare triple {14007#false} havoc ~x~0;~x~0 := 0; {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L273 TraceCheckUtils]: 258: Hoare triple {14007#false} assume true; {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L273 TraceCheckUtils]: 259: Hoare triple {14007#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L256 TraceCheckUtils]: 260: Hoare triple {14007#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L273 TraceCheckUtils]: 261: Hoare triple {14007#false} ~cond := #in~cond; {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L273 TraceCheckUtils]: 262: Hoare triple {14007#false} assume ~cond == 0; {14007#false} is VALID [2018-11-14 18:40:42,451 INFO L273 TraceCheckUtils]: 263: Hoare triple {14007#false} assume !false; {14007#false} is VALID [2018-11-14 18:40:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-14 18:40:42,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:40:42,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 18:40:42,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 264 [2018-11-14 18:40:42,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:40:42,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:40:42,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:42,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:40:42,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:40:42,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:40:42,618 INFO L87 Difference]: Start difference. First operand 269 states and 279 transitions. Second operand 15 states. [2018-11-14 18:40:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:43,164 INFO L93 Difference]: Finished difference Result 501 states and 521 transitions. [2018-11-14 18:40:43,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:40:43,164 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 264 [2018-11-14 18:40:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:40:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:40:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2018-11-14 18:40:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:40:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 161 transitions. [2018-11-14 18:40:43,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 161 transitions. [2018-11-14 18:40:43,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:40:43,839 INFO L225 Difference]: With dead ends: 501 [2018-11-14 18:40:43,839 INFO L226 Difference]: Without dead ends: 273 [2018-11-14 18:40:43,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:40:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-11-14 18:40:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-11-14 18:40:44,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:40:44,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand 272 states. [2018-11-14 18:40:44,006 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 272 states. [2018-11-14 18:40:44,006 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 272 states. [2018-11-14 18:40:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:44,013 INFO L93 Difference]: Finished difference Result 273 states and 283 transitions. [2018-11-14 18:40:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 283 transitions. [2018-11-14 18:40:44,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:44,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:44,014 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 273 states. [2018-11-14 18:40:44,014 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 273 states. [2018-11-14 18:40:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:40:44,021 INFO L93 Difference]: Finished difference Result 273 states and 283 transitions. [2018-11-14 18:40:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 283 transitions. [2018-11-14 18:40:44,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:40:44,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:40:44,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:40:44,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:40:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-11-14 18:40:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 282 transitions. [2018-11-14 18:40:44,030 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 282 transitions. Word has length 264 [2018-11-14 18:40:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:40:44,030 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 282 transitions. [2018-11-14 18:40:44,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:40:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 282 transitions. [2018-11-14 18:40:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-14 18:40:44,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:40:44,032 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:40:44,033 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:40:44,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:40:44,033 INFO L82 PathProgramCache]: Analyzing trace with hash 156470164, now seen corresponding path program 11 times [2018-11-14 18:40:44,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:40:44,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:40:44,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:44,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:40:44,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:40:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:40:44,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {16390#true} call ULTIMATE.init(); {16390#true} is VALID [2018-11-14 18:40:44,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {16390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16390#true} is VALID [2018-11-14 18:40:44,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {16390#true} assume true; {16390#true} is VALID [2018-11-14 18:40:44,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16390#true} {16390#true} #186#return; {16390#true} is VALID [2018-11-14 18:40:44,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {16390#true} call #t~ret24 := main(); {16390#true} is VALID [2018-11-14 18:40:44,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {16390#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000);call ~#a9~0.base, ~#a9~0.offset := #Ultimate.alloc(400000);call ~#a0~0.base, ~#a0~0.offset := #Ultimate.alloc(400000);havoc ~a~0;~a~0 := 0; {16392#(= main_~a~0 0)} is VALID [2018-11-14 18:40:44,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {16392#(= main_~a~0 0)} assume true; {16392#(= main_~a~0 0)} is VALID [2018-11-14 18:40:44,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {16392#(= main_~a~0 0)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16392#(= main_~a~0 0)} is VALID [2018-11-14 18:40:44,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {16392#(= main_~a~0 0)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16393#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:44,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {16393#(<= main_~a~0 1)} assume true; {16393#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:44,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {16393#(<= main_~a~0 1)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16393#(<= main_~a~0 1)} is VALID [2018-11-14 18:40:44,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {16393#(<= main_~a~0 1)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16394#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:44,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {16394#(<= main_~a~0 2)} assume true; {16394#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:44,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {16394#(<= main_~a~0 2)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16394#(<= main_~a~0 2)} is VALID [2018-11-14 18:40:44,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {16394#(<= main_~a~0 2)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16395#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:44,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {16395#(<= main_~a~0 3)} assume true; {16395#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:44,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {16395#(<= main_~a~0 3)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16395#(<= main_~a~0 3)} is VALID [2018-11-14 18:40:44,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {16395#(<= main_~a~0 3)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16396#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:44,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {16396#(<= main_~a~0 4)} assume true; {16396#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:44,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {16396#(<= main_~a~0 4)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16396#(<= main_~a~0 4)} is VALID [2018-11-14 18:40:44,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {16396#(<= main_~a~0 4)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16397#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:44,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {16397#(<= main_~a~0 5)} assume true; {16397#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:44,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {16397#(<= main_~a~0 5)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16397#(<= main_~a~0 5)} is VALID [2018-11-14 18:40:44,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {16397#(<= main_~a~0 5)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16398#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:44,716 INFO L273 TraceCheckUtils]: 24: Hoare triple {16398#(<= main_~a~0 6)} assume true; {16398#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:44,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {16398#(<= main_~a~0 6)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16398#(<= main_~a~0 6)} is VALID [2018-11-14 18:40:44,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {16398#(<= main_~a~0 6)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16399#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:44,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {16399#(<= main_~a~0 7)} assume true; {16399#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:44,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {16399#(<= main_~a~0 7)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16399#(<= main_~a~0 7)} is VALID [2018-11-14 18:40:44,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {16399#(<= main_~a~0 7)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16400#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:44,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {16400#(<= main_~a~0 8)} assume true; {16400#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:44,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {16400#(<= main_~a~0 8)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16400#(<= main_~a~0 8)} is VALID [2018-11-14 18:40:44,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {16400#(<= main_~a~0 8)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16401#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:44,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {16401#(<= main_~a~0 9)} assume true; {16401#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:44,722 INFO L273 TraceCheckUtils]: 34: Hoare triple {16401#(<= main_~a~0 9)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16401#(<= main_~a~0 9)} is VALID [2018-11-14 18:40:44,722 INFO L273 TraceCheckUtils]: 35: Hoare triple {16401#(<= main_~a~0 9)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16402#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:44,723 INFO L273 TraceCheckUtils]: 36: Hoare triple {16402#(<= main_~a~0 10)} assume true; {16402#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:44,741 INFO L273 TraceCheckUtils]: 37: Hoare triple {16402#(<= main_~a~0 10)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16402#(<= main_~a~0 10)} is VALID [2018-11-14 18:40:44,750 INFO L273 TraceCheckUtils]: 38: Hoare triple {16402#(<= main_~a~0 10)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16403#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:44,764 INFO L273 TraceCheckUtils]: 39: Hoare triple {16403#(<= main_~a~0 11)} assume true; {16403#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:44,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {16403#(<= main_~a~0 11)} assume !!(~a~0 < 100000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + ~a~0 * 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a9~0.base, ~#a9~0.offset + ~a~0 * 4, 4);havoc #t~nondet2; {16403#(<= main_~a~0 11)} is VALID [2018-11-14 18:40:44,788 INFO L273 TraceCheckUtils]: 41: Hoare triple {16403#(<= main_~a~0 11)} #t~post0 := ~a~0;~a~0 := #t~post0 + 1;havoc #t~post0; {16404#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:44,797 INFO L273 TraceCheckUtils]: 42: Hoare triple {16404#(<= main_~a~0 12)} assume true; {16404#(<= main_~a~0 12)} is VALID [2018-11-14 18:40:44,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {16404#(<= main_~a~0 12)} assume !(~a~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {16391#false} havoc ~i~0;~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,810 INFO L273 TraceCheckUtils]: 45: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,810 INFO L273 TraceCheckUtils]: 46: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {16391#false} is VALID [2018-11-14 18:40:44,811 INFO L273 TraceCheckUtils]: 47: Hoare triple {16391#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {16391#false} is VALID [2018-11-14 18:40:44,811 INFO L273 TraceCheckUtils]: 48: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,811 INFO L273 TraceCheckUtils]: 49: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {16391#false} is VALID [2018-11-14 18:40:44,811 INFO L273 TraceCheckUtils]: 50: Hoare triple {16391#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {16391#false} is VALID [2018-11-14 18:40:44,811 INFO L273 TraceCheckUtils]: 51: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,811 INFO L273 TraceCheckUtils]: 52: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {16391#false} is VALID [2018-11-14 18:40:44,812 INFO L273 TraceCheckUtils]: 53: Hoare triple {16391#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {16391#false} is VALID [2018-11-14 18:40:44,812 INFO L273 TraceCheckUtils]: 54: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,812 INFO L273 TraceCheckUtils]: 55: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {16391#false} is VALID [2018-11-14 18:40:44,812 INFO L273 TraceCheckUtils]: 56: Hoare triple {16391#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {16391#false} is VALID [2018-11-14 18:40:44,812 INFO L273 TraceCheckUtils]: 57: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,812 INFO L273 TraceCheckUtils]: 58: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {16391#false} is VALID [2018-11-14 18:40:44,813 INFO L273 TraceCheckUtils]: 59: Hoare triple {16391#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {16391#false} is VALID [2018-11-14 18:40:44,813 INFO L273 TraceCheckUtils]: 60: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,813 INFO L273 TraceCheckUtils]: 61: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {16391#false} is VALID [2018-11-14 18:40:44,813 INFO L273 TraceCheckUtils]: 62: Hoare triple {16391#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {16391#false} is VALID [2018-11-14 18:40:44,813 INFO L273 TraceCheckUtils]: 63: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,813 INFO L273 TraceCheckUtils]: 64: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + ~i~0 * 4, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);havoc #t~mem4; {16391#false} is VALID [2018-11-14 18:40:44,814 INFO L273 TraceCheckUtils]: 65: Hoare triple {16391#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {16391#false} is VALID [2018-11-14 18:40:44,814 INFO L273 TraceCheckUtils]: 66: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,814 INFO L273 TraceCheckUtils]: 67: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,814 INFO L273 TraceCheckUtils]: 68: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,814 INFO L273 TraceCheckUtils]: 69: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,814 INFO L273 TraceCheckUtils]: 70: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {16391#false} is VALID [2018-11-14 18:40:44,815 INFO L273 TraceCheckUtils]: 71: Hoare triple {16391#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {16391#false} is VALID [2018-11-14 18:40:44,815 INFO L273 TraceCheckUtils]: 72: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,815 INFO L273 TraceCheckUtils]: 73: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {16391#false} is VALID [2018-11-14 18:40:44,815 INFO L273 TraceCheckUtils]: 74: Hoare triple {16391#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {16391#false} is VALID [2018-11-14 18:40:44,815 INFO L273 TraceCheckUtils]: 75: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,815 INFO L273 TraceCheckUtils]: 76: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {16391#false} is VALID [2018-11-14 18:40:44,816 INFO L273 TraceCheckUtils]: 77: Hoare triple {16391#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {16391#false} is VALID [2018-11-14 18:40:44,816 INFO L273 TraceCheckUtils]: 78: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,816 INFO L273 TraceCheckUtils]: 79: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {16391#false} is VALID [2018-11-14 18:40:44,816 INFO L273 TraceCheckUtils]: 80: Hoare triple {16391#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {16391#false} is VALID [2018-11-14 18:40:44,816 INFO L273 TraceCheckUtils]: 81: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,816 INFO L273 TraceCheckUtils]: 82: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {16391#false} is VALID [2018-11-14 18:40:44,817 INFO L273 TraceCheckUtils]: 83: Hoare triple {16391#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {16391#false} is VALID [2018-11-14 18:40:44,817 INFO L273 TraceCheckUtils]: 84: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,817 INFO L273 TraceCheckUtils]: 85: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {16391#false} is VALID [2018-11-14 18:40:44,817 INFO L273 TraceCheckUtils]: 86: Hoare triple {16391#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {16391#false} is VALID [2018-11-14 18:40:44,817 INFO L273 TraceCheckUtils]: 87: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,817 INFO L273 TraceCheckUtils]: 88: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem6 := read~int(~#a2~0.base, ~#a2~0.offset + ~i~0 * 4, 4);call write~int(#t~mem6, ~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);havoc #t~mem6; {16391#false} is VALID [2018-11-14 18:40:44,818 INFO L273 TraceCheckUtils]: 89: Hoare triple {16391#false} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {16391#false} is VALID [2018-11-14 18:40:44,818 INFO L273 TraceCheckUtils]: 90: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,818 INFO L273 TraceCheckUtils]: 91: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,818 INFO L273 TraceCheckUtils]: 92: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,818 INFO L273 TraceCheckUtils]: 93: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,818 INFO L273 TraceCheckUtils]: 94: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {16391#false} is VALID [2018-11-14 18:40:44,819 INFO L273 TraceCheckUtils]: 95: Hoare triple {16391#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {16391#false} is VALID [2018-11-14 18:40:44,819 INFO L273 TraceCheckUtils]: 96: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,819 INFO L273 TraceCheckUtils]: 97: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {16391#false} is VALID [2018-11-14 18:40:44,819 INFO L273 TraceCheckUtils]: 98: Hoare triple {16391#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {16391#false} is VALID [2018-11-14 18:40:44,819 INFO L273 TraceCheckUtils]: 99: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,819 INFO L273 TraceCheckUtils]: 100: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {16391#false} is VALID [2018-11-14 18:40:44,820 INFO L273 TraceCheckUtils]: 101: Hoare triple {16391#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {16391#false} is VALID [2018-11-14 18:40:44,820 INFO L273 TraceCheckUtils]: 102: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,820 INFO L273 TraceCheckUtils]: 103: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {16391#false} is VALID [2018-11-14 18:40:44,820 INFO L273 TraceCheckUtils]: 104: Hoare triple {16391#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {16391#false} is VALID [2018-11-14 18:40:44,820 INFO L273 TraceCheckUtils]: 105: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,820 INFO L273 TraceCheckUtils]: 106: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {16391#false} is VALID [2018-11-14 18:40:44,821 INFO L273 TraceCheckUtils]: 107: Hoare triple {16391#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {16391#false} is VALID [2018-11-14 18:40:44,821 INFO L273 TraceCheckUtils]: 108: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,821 INFO L273 TraceCheckUtils]: 109: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {16391#false} is VALID [2018-11-14 18:40:44,821 INFO L273 TraceCheckUtils]: 110: Hoare triple {16391#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {16391#false} is VALID [2018-11-14 18:40:44,821 INFO L273 TraceCheckUtils]: 111: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,821 INFO L273 TraceCheckUtils]: 112: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem8 := read~int(~#a3~0.base, ~#a3~0.offset + ~i~0 * 4, 4);call write~int(#t~mem8, ~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);havoc #t~mem8; {16391#false} is VALID [2018-11-14 18:40:44,821 INFO L273 TraceCheckUtils]: 113: Hoare triple {16391#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {16391#false} is VALID [2018-11-14 18:40:44,822 INFO L273 TraceCheckUtils]: 114: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,822 INFO L273 TraceCheckUtils]: 115: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,822 INFO L273 TraceCheckUtils]: 116: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,822 INFO L273 TraceCheckUtils]: 117: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,822 INFO L273 TraceCheckUtils]: 118: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {16391#false} is VALID [2018-11-14 18:40:44,822 INFO L273 TraceCheckUtils]: 119: Hoare triple {16391#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {16391#false} is VALID [2018-11-14 18:40:44,823 INFO L273 TraceCheckUtils]: 120: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,823 INFO L273 TraceCheckUtils]: 121: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {16391#false} is VALID [2018-11-14 18:40:44,823 INFO L273 TraceCheckUtils]: 122: Hoare triple {16391#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {16391#false} is VALID [2018-11-14 18:40:44,823 INFO L273 TraceCheckUtils]: 123: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,823 INFO L273 TraceCheckUtils]: 124: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {16391#false} is VALID [2018-11-14 18:40:44,823 INFO L273 TraceCheckUtils]: 125: Hoare triple {16391#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {16391#false} is VALID [2018-11-14 18:40:44,824 INFO L273 TraceCheckUtils]: 126: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,824 INFO L273 TraceCheckUtils]: 127: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {16391#false} is VALID [2018-11-14 18:40:44,824 INFO L273 TraceCheckUtils]: 128: Hoare triple {16391#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {16391#false} is VALID [2018-11-14 18:40:44,824 INFO L273 TraceCheckUtils]: 129: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,824 INFO L273 TraceCheckUtils]: 130: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {16391#false} is VALID [2018-11-14 18:40:44,824 INFO L273 TraceCheckUtils]: 131: Hoare triple {16391#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {16391#false} is VALID [2018-11-14 18:40:44,825 INFO L273 TraceCheckUtils]: 132: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,825 INFO L273 TraceCheckUtils]: 133: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {16391#false} is VALID [2018-11-14 18:40:44,825 INFO L273 TraceCheckUtils]: 134: Hoare triple {16391#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {16391#false} is VALID [2018-11-14 18:40:44,825 INFO L273 TraceCheckUtils]: 135: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,825 INFO L273 TraceCheckUtils]: 136: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem10 := read~int(~#a4~0.base, ~#a4~0.offset + ~i~0 * 4, 4);call write~int(#t~mem10, ~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);havoc #t~mem10; {16391#false} is VALID [2018-11-14 18:40:44,825 INFO L273 TraceCheckUtils]: 137: Hoare triple {16391#false} #t~post9 := ~i~0;~i~0 := #t~post9 + 1;havoc #t~post9; {16391#false} is VALID [2018-11-14 18:40:44,826 INFO L273 TraceCheckUtils]: 138: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,826 INFO L273 TraceCheckUtils]: 139: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,826 INFO L273 TraceCheckUtils]: 140: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,826 INFO L273 TraceCheckUtils]: 141: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,826 INFO L273 TraceCheckUtils]: 142: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {16391#false} is VALID [2018-11-14 18:40:44,826 INFO L273 TraceCheckUtils]: 143: Hoare triple {16391#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {16391#false} is VALID [2018-11-14 18:40:44,827 INFO L273 TraceCheckUtils]: 144: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,827 INFO L273 TraceCheckUtils]: 145: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {16391#false} is VALID [2018-11-14 18:40:44,827 INFO L273 TraceCheckUtils]: 146: Hoare triple {16391#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {16391#false} is VALID [2018-11-14 18:40:44,827 INFO L273 TraceCheckUtils]: 147: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,827 INFO L273 TraceCheckUtils]: 148: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {16391#false} is VALID [2018-11-14 18:40:44,827 INFO L273 TraceCheckUtils]: 149: Hoare triple {16391#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {16391#false} is VALID [2018-11-14 18:40:44,828 INFO L273 TraceCheckUtils]: 150: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,828 INFO L273 TraceCheckUtils]: 151: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {16391#false} is VALID [2018-11-14 18:40:44,828 INFO L273 TraceCheckUtils]: 152: Hoare triple {16391#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {16391#false} is VALID [2018-11-14 18:40:44,828 INFO L273 TraceCheckUtils]: 153: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,828 INFO L273 TraceCheckUtils]: 154: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {16391#false} is VALID [2018-11-14 18:40:44,828 INFO L273 TraceCheckUtils]: 155: Hoare triple {16391#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {16391#false} is VALID [2018-11-14 18:40:44,828 INFO L273 TraceCheckUtils]: 156: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,829 INFO L273 TraceCheckUtils]: 157: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {16391#false} is VALID [2018-11-14 18:40:44,829 INFO L273 TraceCheckUtils]: 158: Hoare triple {16391#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {16391#false} is VALID [2018-11-14 18:40:44,829 INFO L273 TraceCheckUtils]: 159: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,829 INFO L273 TraceCheckUtils]: 160: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem12 := read~int(~#a5~0.base, ~#a5~0.offset + ~i~0 * 4, 4);call write~int(#t~mem12, ~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);havoc #t~mem12; {16391#false} is VALID [2018-11-14 18:40:44,829 INFO L273 TraceCheckUtils]: 161: Hoare triple {16391#false} #t~post11 := ~i~0;~i~0 := #t~post11 + 1;havoc #t~post11; {16391#false} is VALID [2018-11-14 18:40:44,830 INFO L273 TraceCheckUtils]: 162: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,830 INFO L273 TraceCheckUtils]: 163: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,830 INFO L273 TraceCheckUtils]: 164: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,830 INFO L273 TraceCheckUtils]: 165: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,830 INFO L273 TraceCheckUtils]: 166: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {16391#false} is VALID [2018-11-14 18:40:44,831 INFO L273 TraceCheckUtils]: 167: Hoare triple {16391#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {16391#false} is VALID [2018-11-14 18:40:44,831 INFO L273 TraceCheckUtils]: 168: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,831 INFO L273 TraceCheckUtils]: 169: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {16391#false} is VALID [2018-11-14 18:40:44,831 INFO L273 TraceCheckUtils]: 170: Hoare triple {16391#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {16391#false} is VALID [2018-11-14 18:40:44,831 INFO L273 TraceCheckUtils]: 171: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,831 INFO L273 TraceCheckUtils]: 172: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {16391#false} is VALID [2018-11-14 18:40:44,831 INFO L273 TraceCheckUtils]: 173: Hoare triple {16391#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {16391#false} is VALID [2018-11-14 18:40:44,832 INFO L273 TraceCheckUtils]: 174: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,832 INFO L273 TraceCheckUtils]: 175: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {16391#false} is VALID [2018-11-14 18:40:44,832 INFO L273 TraceCheckUtils]: 176: Hoare triple {16391#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {16391#false} is VALID [2018-11-14 18:40:44,832 INFO L273 TraceCheckUtils]: 177: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,832 INFO L273 TraceCheckUtils]: 178: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {16391#false} is VALID [2018-11-14 18:40:44,832 INFO L273 TraceCheckUtils]: 179: Hoare triple {16391#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {16391#false} is VALID [2018-11-14 18:40:44,833 INFO L273 TraceCheckUtils]: 180: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,833 INFO L273 TraceCheckUtils]: 181: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {16391#false} is VALID [2018-11-14 18:40:44,833 INFO L273 TraceCheckUtils]: 182: Hoare triple {16391#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {16391#false} is VALID [2018-11-14 18:40:44,833 INFO L273 TraceCheckUtils]: 183: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,833 INFO L273 TraceCheckUtils]: 184: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem14 := read~int(~#a6~0.base, ~#a6~0.offset + ~i~0 * 4, 4);call write~int(#t~mem14, ~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);havoc #t~mem14; {16391#false} is VALID [2018-11-14 18:40:44,833 INFO L273 TraceCheckUtils]: 185: Hoare triple {16391#false} #t~post13 := ~i~0;~i~0 := #t~post13 + 1;havoc #t~post13; {16391#false} is VALID [2018-11-14 18:40:44,834 INFO L273 TraceCheckUtils]: 186: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,834 INFO L273 TraceCheckUtils]: 187: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,834 INFO L273 TraceCheckUtils]: 188: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,834 INFO L273 TraceCheckUtils]: 189: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,834 INFO L273 TraceCheckUtils]: 190: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {16391#false} is VALID [2018-11-14 18:40:44,834 INFO L273 TraceCheckUtils]: 191: Hoare triple {16391#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {16391#false} is VALID [2018-11-14 18:40:44,835 INFO L273 TraceCheckUtils]: 192: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,835 INFO L273 TraceCheckUtils]: 193: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {16391#false} is VALID [2018-11-14 18:40:44,835 INFO L273 TraceCheckUtils]: 194: Hoare triple {16391#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {16391#false} is VALID [2018-11-14 18:40:44,835 INFO L273 TraceCheckUtils]: 195: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,835 INFO L273 TraceCheckUtils]: 196: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {16391#false} is VALID [2018-11-14 18:40:44,835 INFO L273 TraceCheckUtils]: 197: Hoare triple {16391#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {16391#false} is VALID [2018-11-14 18:40:44,836 INFO L273 TraceCheckUtils]: 198: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,836 INFO L273 TraceCheckUtils]: 199: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {16391#false} is VALID [2018-11-14 18:40:44,836 INFO L273 TraceCheckUtils]: 200: Hoare triple {16391#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {16391#false} is VALID [2018-11-14 18:40:44,836 INFO L273 TraceCheckUtils]: 201: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,836 INFO L273 TraceCheckUtils]: 202: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {16391#false} is VALID [2018-11-14 18:40:44,836 INFO L273 TraceCheckUtils]: 203: Hoare triple {16391#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {16391#false} is VALID [2018-11-14 18:40:44,837 INFO L273 TraceCheckUtils]: 204: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,837 INFO L273 TraceCheckUtils]: 205: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {16391#false} is VALID [2018-11-14 18:40:44,837 INFO L273 TraceCheckUtils]: 206: Hoare triple {16391#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {16391#false} is VALID [2018-11-14 18:40:44,837 INFO L273 TraceCheckUtils]: 207: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,837 INFO L273 TraceCheckUtils]: 208: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem16 := read~int(~#a7~0.base, ~#a7~0.offset + ~i~0 * 4, 4);call write~int(#t~mem16, ~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);havoc #t~mem16; {16391#false} is VALID [2018-11-14 18:40:44,837 INFO L273 TraceCheckUtils]: 209: Hoare triple {16391#false} #t~post15 := ~i~0;~i~0 := #t~post15 + 1;havoc #t~post15; {16391#false} is VALID [2018-11-14 18:40:44,838 INFO L273 TraceCheckUtils]: 210: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,838 INFO L273 TraceCheckUtils]: 211: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,838 INFO L273 TraceCheckUtils]: 212: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,838 INFO L273 TraceCheckUtils]: 213: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,838 INFO L273 TraceCheckUtils]: 214: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {16391#false} is VALID [2018-11-14 18:40:44,838 INFO L273 TraceCheckUtils]: 215: Hoare triple {16391#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {16391#false} is VALID [2018-11-14 18:40:44,839 INFO L273 TraceCheckUtils]: 216: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,839 INFO L273 TraceCheckUtils]: 217: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {16391#false} is VALID [2018-11-14 18:40:44,839 INFO L273 TraceCheckUtils]: 218: Hoare triple {16391#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {16391#false} is VALID [2018-11-14 18:40:44,839 INFO L273 TraceCheckUtils]: 219: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,839 INFO L273 TraceCheckUtils]: 220: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {16391#false} is VALID [2018-11-14 18:40:44,839 INFO L273 TraceCheckUtils]: 221: Hoare triple {16391#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {16391#false} is VALID [2018-11-14 18:40:44,839 INFO L273 TraceCheckUtils]: 222: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,840 INFO L273 TraceCheckUtils]: 223: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {16391#false} is VALID [2018-11-14 18:40:44,840 INFO L273 TraceCheckUtils]: 224: Hoare triple {16391#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {16391#false} is VALID [2018-11-14 18:40:44,840 INFO L273 TraceCheckUtils]: 225: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,840 INFO L273 TraceCheckUtils]: 226: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {16391#false} is VALID [2018-11-14 18:40:44,840 INFO L273 TraceCheckUtils]: 227: Hoare triple {16391#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {16391#false} is VALID [2018-11-14 18:40:44,840 INFO L273 TraceCheckUtils]: 228: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,841 INFO L273 TraceCheckUtils]: 229: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {16391#false} is VALID [2018-11-14 18:40:44,841 INFO L273 TraceCheckUtils]: 230: Hoare triple {16391#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {16391#false} is VALID [2018-11-14 18:40:44,841 INFO L273 TraceCheckUtils]: 231: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,841 INFO L273 TraceCheckUtils]: 232: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem18 := read~int(~#a8~0.base, ~#a8~0.offset + ~i~0 * 4, 4);call write~int(#t~mem18, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem18; {16391#false} is VALID [2018-11-14 18:40:44,841 INFO L273 TraceCheckUtils]: 233: Hoare triple {16391#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {16391#false} is VALID [2018-11-14 18:40:44,841 INFO L273 TraceCheckUtils]: 234: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,842 INFO L273 TraceCheckUtils]: 235: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,842 INFO L273 TraceCheckUtils]: 236: Hoare triple {16391#false} ~i~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,842 INFO L273 TraceCheckUtils]: 237: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,842 INFO L273 TraceCheckUtils]: 238: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {16391#false} is VALID [2018-11-14 18:40:44,842 INFO L273 TraceCheckUtils]: 239: Hoare triple {16391#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {16391#false} is VALID [2018-11-14 18:40:44,842 INFO L273 TraceCheckUtils]: 240: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,843 INFO L273 TraceCheckUtils]: 241: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {16391#false} is VALID [2018-11-14 18:40:44,843 INFO L273 TraceCheckUtils]: 242: Hoare triple {16391#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {16391#false} is VALID [2018-11-14 18:40:44,843 INFO L273 TraceCheckUtils]: 243: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,843 INFO L273 TraceCheckUtils]: 244: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {16391#false} is VALID [2018-11-14 18:40:44,843 INFO L273 TraceCheckUtils]: 245: Hoare triple {16391#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {16391#false} is VALID [2018-11-14 18:40:44,843 INFO L273 TraceCheckUtils]: 246: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,844 INFO L273 TraceCheckUtils]: 247: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {16391#false} is VALID [2018-11-14 18:40:44,844 INFO L273 TraceCheckUtils]: 248: Hoare triple {16391#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {16391#false} is VALID [2018-11-14 18:40:44,844 INFO L273 TraceCheckUtils]: 249: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,844 INFO L273 TraceCheckUtils]: 250: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {16391#false} is VALID [2018-11-14 18:40:44,844 INFO L273 TraceCheckUtils]: 251: Hoare triple {16391#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {16391#false} is VALID [2018-11-14 18:40:44,844 INFO L273 TraceCheckUtils]: 252: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,845 INFO L273 TraceCheckUtils]: 253: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {16391#false} is VALID [2018-11-14 18:40:44,845 INFO L273 TraceCheckUtils]: 254: Hoare triple {16391#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {16391#false} is VALID [2018-11-14 18:40:44,845 INFO L273 TraceCheckUtils]: 255: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,845 INFO L273 TraceCheckUtils]: 256: Hoare triple {16391#false} assume !!(~i~0 < 100000);call #t~mem20 := read~int(~#a9~0.base, ~#a9~0.offset + ~i~0 * 4, 4);call write~int(#t~mem20, ~#a0~0.base, ~#a0~0.offset + ~i~0 * 4, 4);havoc #t~mem20; {16391#false} is VALID [2018-11-14 18:40:44,845 INFO L273 TraceCheckUtils]: 257: Hoare triple {16391#false} #t~post19 := ~i~0;~i~0 := #t~post19 + 1;havoc #t~post19; {16391#false} is VALID [2018-11-14 18:40:44,845 INFO L273 TraceCheckUtils]: 258: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,846 INFO L273 TraceCheckUtils]: 259: Hoare triple {16391#false} assume !(~i~0 < 100000); {16391#false} is VALID [2018-11-14 18:40:44,846 INFO L273 TraceCheckUtils]: 260: Hoare triple {16391#false} havoc ~x~0;~x~0 := 0; {16391#false} is VALID [2018-11-14 18:40:44,846 INFO L273 TraceCheckUtils]: 261: Hoare triple {16391#false} assume true; {16391#false} is VALID [2018-11-14 18:40:44,846 INFO L273 TraceCheckUtils]: 262: Hoare triple {16391#false} assume !!(~x~0 < 100000);call #t~mem22 := read~int(~#a1~0.base, ~#a1~0.offset + ~x~0 * 4, 4);call #t~mem23 := read~int(~#a0~0.base, ~#a0~0.offset + ~x~0 * 4, 4); {16391#false} is VALID [2018-11-14 18:40:44,846 INFO L256 TraceCheckUtils]: 263: Hoare triple {16391#false} call __VERIFIER_assert((if #t~mem22 == #t~mem23 then 1 else 0)); {16391#false} is VALID [2018-11-14 18:40:44,846 INFO L273 TraceCheckUtils]: 264: Hoare triple {16391#false} ~cond := #in~cond; {16391#false} is VALID [2018-11-14 18:40:44,846 INFO L273 TraceCheckUtils]: 265: Hoare triple {16391#false} assume ~cond == 0; {16391#false} is VALID [2018-11-14 18:40:44,847 INFO L273 TraceCheckUtils]: 266: Hoare triple {16391#false} assume !false; {16391#false} is VALID [2018-11-14 18:40:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-11-14 18:40:44,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:40:44,886 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-14 18:40:44,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1